./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 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/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_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R --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-38b53e6 [2022-11-25 15:34:00,811 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:34:00,813 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:34:00,841 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:34:00,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:34:00,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:34:00,847 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:34:00,848 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:34:00,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:34:00,851 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:34:00,852 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:34:00,853 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:34:00,853 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:34:00,854 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:34:00,855 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:34:00,856 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:34:00,857 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:34:00,858 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:34:00,859 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:34:00,861 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:34:00,862 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:34:00,864 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:34:00,865 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:34:00,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:34:00,873 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:34:00,877 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:34:00,878 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:34:00,879 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:34:00,880 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:34:00,881 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:34:00,882 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:34:00,883 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:34:00,884 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:34:00,886 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:34:00,889 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:34:00,889 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:34:00,890 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:34:00,890 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:34:00,891 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:34:00,892 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:34:00,893 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:34:00,894 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 15:34:00,936 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:34:00,936 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:34:00,937 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:34:00,937 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:34:00,938 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:34:00,938 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:34:00,939 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:34:00,939 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:34:00,939 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:34:00,940 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:34:00,941 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:34:00,941 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 15:34:00,941 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:34:00,942 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:34:00,942 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:34:00,942 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 15:34:00,942 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 15:34:00,942 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 15:34:00,942 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:34:00,943 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 15:34:00,943 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:34:00,943 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:34:00,943 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:34:00,944 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:34:00,944 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:34:00,944 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:34:00,944 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:34:00,944 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:34:00,945 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:34:00,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 15:34:00,945 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:34:00,945 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:34:00,946 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:34:00,946 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_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/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_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R 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-11-25 15:34:01,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:34:01,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:34:01,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:34:01,348 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:34:01,349 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:34:01,350 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i [2022-11-25 15:34:04,415 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:34:04,787 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:34:04,788 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i [2022-11-25 15:34:04,806 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/data/b15f4d0b7/671f756489224a66ae849a4cbdf0f85e/FLAG1b52881ab [2022-11-25 15:34:04,827 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/data/b15f4d0b7/671f756489224a66ae849a4cbdf0f85e [2022-11-25 15:34:04,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:34:04,842 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:34:04,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:34:04,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:34:04,848 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:34:04,849 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:34:04" (1/1) ... [2022-11-25 15:34:04,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dee0f9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:34:04, skipping insertion in model container [2022-11-25 15:34:04,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:34:04" (1/1) ... [2022-11-25 15:34:04,858 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:34:04,936 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:34:05,665 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_110825ad-96be-4b1a-89e2-5de8b04f82e4/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44118,44131] [2022-11-25 15:34:05,678 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_110825ad-96be-4b1a-89e2-5de8b04f82e4/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44660,44673] [2022-11-25 15:34:05,681 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 15:34:05,775 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_110825ad-96be-4b1a-89e2-5de8b04f82e4/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56247,56260] [2022-11-25 15:34:05,777 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_110825ad-96be-4b1a-89e2-5de8b04f82e4/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56368,56381] [2022-11-25 15:34:05,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:34:05,796 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-11-25 15:34:05,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4b1632de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:34:05, skipping insertion in model container [2022-11-25 15:34:05,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:34:05,807 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-25 15:34:05,811 INFO L158 Benchmark]: Toolchain (without parser) took 969.16ms. Allocated memory is still 172.0MB. Free memory was 126.5MB in the beginning and 104.7MB in the end (delta: 21.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-25 15:34:05,812 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 115.3MB. Free memory is still 90.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:34:05,813 INFO L158 Benchmark]: CACSL2BoogieTranslator took 963.99ms. Allocated memory is still 172.0MB. Free memory was 126.0MB in the beginning and 104.7MB in the end (delta: 21.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-25 15:34:05,816 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.24ms. Allocated memory is still 115.3MB. Free memory is still 90.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 963.99ms. Allocated memory is still 172.0MB. Free memory was 126.0MB in the beginning and 104.7MB in the end (delta: 21.3MB). 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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/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_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R --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-38b53e6 [2022-11-25 15:34:08,124 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:34:08,126 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:34:08,148 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:34:08,148 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:34:08,150 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:34:08,151 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:34:08,153 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:34:08,155 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:34:08,156 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:34:08,157 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:34:08,158 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:34:08,159 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:34:08,160 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:34:08,161 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:34:08,163 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:34:08,164 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:34:08,165 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:34:08,167 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:34:08,169 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:34:08,170 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:34:08,173 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:34:08,174 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:34:08,175 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:34:08,179 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:34:08,179 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:34:08,180 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:34:08,181 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:34:08,181 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:34:08,183 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:34:08,183 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:34:08,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:34:08,208 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:34:08,212 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:34:08,216 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:34:08,216 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:34:08,217 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:34:08,217 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:34:08,217 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:34:08,218 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:34:08,219 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:34:08,224 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-25 15:34:08,248 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:34:08,248 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:34:08,249 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:34:08,249 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:34:08,249 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:34:08,250 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:34:08,250 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:34:08,250 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:34:08,251 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:34:08,251 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:34:08,251 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:34:08,251 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 15:34:08,251 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:34:08,252 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:34:08,252 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:34:08,252 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 15:34:08,252 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 15:34:08,252 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 15:34:08,252 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:34:08,253 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 15:34:08,253 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 15:34:08,253 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 15:34:08,253 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:34:08,253 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:34:08,253 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:34:08,254 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:34:08,254 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:34:08,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:34:08,254 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:34:08,254 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:34:08,255 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 15:34:08,255 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 15:34:08,255 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:34:08,255 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:34:08,255 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:34:08,255 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 15:34:08,256 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_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/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_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R 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-11-25 15:34:08,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:34:08,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:34:08,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:34:08,670 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:34:08,670 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:34:08,672 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i [2022-11-25 15:34:11,829 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:34:12,246 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:34:12,247 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i [2022-11-25 15:34:12,276 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/data/37b421ec4/36d7d5ac4700456c82ce6b1b4181477d/FLAGea1e0e491 [2022-11-25 15:34:12,294 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/data/37b421ec4/36d7d5ac4700456c82ce6b1b4181477d [2022-11-25 15:34:12,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:34:12,299 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:34:12,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:34:12,301 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:34:12,306 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:34:12,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:34:12" (1/1) ... [2022-11-25 15:34:12,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74f81b41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:34:12, skipping insertion in model container [2022-11-25 15:34:12,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:34:12" (1/1) ... [2022-11-25 15:34:12,316 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:34:12,376 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:34:13,033 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_110825ad-96be-4b1a-89e2-5de8b04f82e4/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44118,44131] [2022-11-25 15:34:13,046 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_110825ad-96be-4b1a-89e2-5de8b04f82e4/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44660,44673] [2022-11-25 15:34:13,049 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 15:34:13,197 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_110825ad-96be-4b1a-89e2-5de8b04f82e4/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56247,56260] [2022-11-25 15:34:13,199 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_110825ad-96be-4b1a-89e2-5de8b04f82e4/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56368,56381] [2022-11-25 15:34:13,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:34:13,220 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-25 15:34:13,236 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:34:13,256 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_110825ad-96be-4b1a-89e2-5de8b04f82e4/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44118,44131] [2022-11-25 15:34:13,258 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_110825ad-96be-4b1a-89e2-5de8b04f82e4/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44660,44673] [2022-11-25 15:34:13,259 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 15:34:13,313 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_110825ad-96be-4b1a-89e2-5de8b04f82e4/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56247,56260] [2022-11-25 15:34:13,315 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_110825ad-96be-4b1a-89e2-5de8b04f82e4/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56368,56381] [2022-11-25 15:34:13,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:34:13,330 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:34:13,381 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_110825ad-96be-4b1a-89e2-5de8b04f82e4/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44118,44131] [2022-11-25 15:34:13,383 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_110825ad-96be-4b1a-89e2-5de8b04f82e4/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44660,44673] [2022-11-25 15:34:13,385 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 15:34:13,454 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_110825ad-96be-4b1a-89e2-5de8b04f82e4/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56247,56260] [2022-11-25 15:34:13,455 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_110825ad-96be-4b1a-89e2-5de8b04f82e4/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56368,56381] [2022-11-25 15:34:13,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:34:13,560 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:34:13,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:34:13 WrapperNode [2022-11-25 15:34:13,561 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:34:13,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:34:13,564 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:34:13,564 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:34:13,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:34:13" (1/1) ... [2022-11-25 15:34:13,630 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:34:13" (1/1) ... [2022-11-25 15:34:13,722 INFO L138 Inliner]: procedures = 285, calls = 294, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1038 [2022-11-25 15:34:13,729 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:34:13,730 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:34:13,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:34:13,731 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:34:13,741 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:34:13" (1/1) ... [2022-11-25 15:34:13,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:34:13" (1/1) ... [2022-11-25 15:34:13,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:34:13" (1/1) ... [2022-11-25 15:34:13,766 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:34:13" (1/1) ... [2022-11-25 15:34:13,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:34:13" (1/1) ... [2022-11-25 15:34:13,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:34:13" (1/1) ... [2022-11-25 15:34:13,871 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:34:13" (1/1) ... [2022-11-25 15:34:13,875 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:34:13" (1/1) ... [2022-11-25 15:34:13,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:34:13,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:34:13,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:34:13,885 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:34:13,886 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:34:13" (1/1) ... [2022-11-25 15:34:13,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:34:13,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:34:13,929 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:34:13,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:34:13,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-25 15:34:13,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-25 15:34:13,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 15:34:13,978 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-25 15:34:13,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 15:34:13,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 15:34:13,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 15:34:13,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 15:34:13,980 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2022-11-25 15:34:13,980 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2022-11-25 15:34:13,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-25 15:34:13,981 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-25 15:34:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 15:34:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:34:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2022-11-25 15:34:14,004 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2022-11-25 15:34:14,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 15:34:14,004 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2022-11-25 15:34:14,005 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2022-11-25 15:34:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:34:14,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:34:14,266 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:34:14,280 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:34:19,512 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:34:19,524 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:34:19,525 INFO L300 CfgBuilder]: Removed 63 assume(true) statements. [2022-11-25 15:34:19,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:34:19 BoogieIcfgContainer [2022-11-25 15:34:19,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:34:19,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:34:19,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:34:19,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:34:19,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:34:12" (1/3) ... [2022-11-25 15:34:19,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55a6865f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:34:19, skipping insertion in model container [2022-11-25 15:34:19,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:34:13" (2/3) ... [2022-11-25 15:34:19,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55a6865f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:34:19, skipping insertion in model container [2022-11-25 15:34:19,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:34:19" (3/3) ... [2022-11-25 15:34:19,539 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test6-1.i [2022-11-25 15:34:19,559 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:34:19,560 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 531 error locations. [2022-11-25 15:34:19,666 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:34:19,674 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;@54c33568, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:34:19,675 INFO L358 AbstractCegarLoop]: Starting to check reachability of 531 error locations. [2022-11-25 15:34:19,686 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-11-25 15:34:19,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 15:34:19,692 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:34:19,693 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 15:34:19,694 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-11-25 15:34:19,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:34:19,703 INFO L85 PathProgramCache]: Analyzing trace with hash 77521, now seen corresponding path program 1 times [2022-11-25 15:34:19,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:34:19,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [828003755] [2022-11-25 15:34:19,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:34:19,717 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-11-25 15:34:19,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:34:19,723 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:19,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:34:19,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 15:34:19,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:34:19,993 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-11-25 15:34:20,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:34:20,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:34:20,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:34:20,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [828003755] [2022-11-25 15:34:20,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [828003755] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:34:20,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:34:20,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:34:20,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267362612] [2022-11-25 15:34:20,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:34:20,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:34:20,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:34:20,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:34:20,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:34:20,115 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-11-25 15:34:22,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:34:22,538 INFO L93 Difference]: Finished difference Result 1161 states and 1227 transitions. [2022-11-25 15:34:22,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:34:22,542 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-11-25 15:34:22,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:34:22,560 INFO L225 Difference]: With dead ends: 1161 [2022-11-25 15:34:22,561 INFO L226 Difference]: Without dead ends: 1159 [2022-11-25 15:34:22,562 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-11-25 15:34:22,566 INFO L413 NwaCegarLoop]: 796 mSDtfsCounter, 714 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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, 2.3s IncrementalHoareTripleChecker+Time [2022-11-25 15:34:22,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 1040 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-25 15:34:22,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2022-11-25 15:34:22,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1102. [2022-11-25 15:34:22,674 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-11-25 15:34:22,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1208 transitions. [2022-11-25 15:34:22,687 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1208 transitions. Word has length 3 [2022-11-25 15:34:22,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:34:22,687 INFO L495 AbstractCegarLoop]: Abstraction has 1102 states and 1208 transitions. [2022-11-25 15:34:22,689 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-11-25 15:34:22,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1208 transitions. [2022-11-25 15:34:22,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 15:34:22,690 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:34:22,691 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 15:34:22,708 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:22,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:22,904 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-11-25 15:34:22,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:34:22,904 INFO L85 PathProgramCache]: Analyzing trace with hash 77522, now seen corresponding path program 1 times [2022-11-25 15:34:22,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:34:22,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1856644447] [2022-11-25 15:34:22,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:34:22,910 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-11-25 15:34:22,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:34:22,912 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:22,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:34:23,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 15:34:23,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:34:23,087 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-11-25 15:34:23,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:34:23,101 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:34:23,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:34:23,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1856644447] [2022-11-25 15:34:23,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1856644447] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:34:23,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:34:23,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:34:23,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136493450] [2022-11-25 15:34:23,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:34:23,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:34:23,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:34:23,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:34:23,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:34:23,105 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-11-25 15:34:26,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:34:26,842 INFO L93 Difference]: Finished difference Result 1496 states and 1636 transitions. [2022-11-25 15:34:26,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:34:26,843 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-11-25 15:34:26,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:34:26,848 INFO L225 Difference]: With dead ends: 1496 [2022-11-25 15:34:26,848 INFO L226 Difference]: Without dead ends: 1496 [2022-11-25 15:34:26,849 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-11-25 15:34:26,850 INFO L413 NwaCegarLoop]: 941 mSDtfsCounter, 418 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s 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, 3.7s IncrementalHoareTripleChecker+Time [2022-11-25 15:34:26,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 1534 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-11-25 15:34:26,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2022-11-25 15:34:26,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1306. [2022-11-25 15:34:26,876 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-11-25 15:34:26,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1624 transitions. [2022-11-25 15:34:26,885 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1624 transitions. Word has length 3 [2022-11-25 15:34:26,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:34:26,886 INFO L495 AbstractCegarLoop]: Abstraction has 1306 states and 1624 transitions. [2022-11-25 15:34:26,886 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-11-25 15:34:26,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1624 transitions. [2022-11-25 15:34:26,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 15:34:26,887 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:34:26,887 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:34:26,904 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-25 15:34:27,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:27,099 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-11-25 15:34:27,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:34:27,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1111693489, now seen corresponding path program 1 times [2022-11-25 15:34:27,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:34:27,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892038092] [2022-11-25 15:34:27,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:34:27,101 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-11-25 15:34:27,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:34:27,103 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:27,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:34:27,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 15:34:27,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:34:27,294 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-11-25 15:34:27,301 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-11-25 15:34:27,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:34:27,375 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-11-25 15:34:27,393 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 15:34:27,394 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-11-25 15:34:27,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:34:27,429 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:34:27,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:34:27,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892038092] [2022-11-25 15:34:27,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892038092] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:34:27,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:34:27,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:34:27,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868064494] [2022-11-25 15:34:27,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:34:27,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:34:27,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:34:27,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:34:27,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:34:27,432 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-11-25 15:34:33,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:34:33,716 INFO L93 Difference]: Finished difference Result 1996 states and 2369 transitions. [2022-11-25 15:34:33,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:34:33,717 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-11-25 15:34:33,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:34:33,724 INFO L225 Difference]: With dead ends: 1996 [2022-11-25 15:34:33,724 INFO L226 Difference]: Without dead ends: 1996 [2022-11-25 15:34:33,724 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-11-25 15:34:33,726 INFO L413 NwaCegarLoop]: 653 mSDtfsCounter, 718 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 1797 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s 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, 6.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:34:33,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1581 Invalid, 1810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1797 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-11-25 15:34:33,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2022-11-25 15:34:33,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1451. [2022-11-25 15:34:33,755 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-11-25 15:34:33,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 1907 transitions. [2022-11-25 15:34:33,761 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 1907 transitions. Word has length 8 [2022-11-25 15:34:33,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:34:33,762 INFO L495 AbstractCegarLoop]: Abstraction has 1451 states and 1907 transitions. [2022-11-25 15:34:33,762 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-11-25 15:34:33,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 1907 transitions. [2022-11-25 15:34:33,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 15:34:33,763 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:34:33,763 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:34:33,780 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-25 15:34:33,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:33,974 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-11-25 15:34:33,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:34:33,975 INFO L85 PathProgramCache]: Analyzing trace with hash -102759776, now seen corresponding path program 1 times [2022-11-25 15:34:33,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:34:33,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1533173742] [2022-11-25 15:34:33,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:34:33,975 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-11-25 15:34:33,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:34:33,988 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:33,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:34:34,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 15:34:34,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:34:34,159 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-11-25 15:34:34,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:34:34,185 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:34:34,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:34:34,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1533173742] [2022-11-25 15:34:34,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1533173742] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:34:34,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:34:34,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:34:34,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915762952] [2022-11-25 15:34:34,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:34:34,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:34:34,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:34:34,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:34:34,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:34:34,197 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-11-25 15:34:38,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:34:38,145 INFO L93 Difference]: Finished difference Result 2429 states and 3105 transitions. [2022-11-25 15:34:38,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:34:38,147 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-11-25 15:34:38,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:34:38,155 INFO L225 Difference]: With dead ends: 2429 [2022-11-25 15:34:38,155 INFO L226 Difference]: Without dead ends: 2429 [2022-11-25 15:34:38,155 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-11-25 15:34:38,156 INFO L413 NwaCegarLoop]: 1012 mSDtfsCounter, 2139 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s 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, 3.8s IncrementalHoareTripleChecker+Time [2022-11-25 15:34:38,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2145 Valid, 1969 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-11-25 15:34:38,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2429 states. [2022-11-25 15:34:38,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2429 to 1406. [2022-11-25 15:34:38,190 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-11-25 15:34:38,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 1848 transitions. [2022-11-25 15:34:38,195 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 1848 transitions. Word has length 9 [2022-11-25 15:34:38,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:34:38,195 INFO L495 AbstractCegarLoop]: Abstraction has 1406 states and 1848 transitions. [2022-11-25 15:34:38,196 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-11-25 15:34:38,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 1848 transitions. [2022-11-25 15:34:38,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 15:34:38,196 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:34:38,196 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:34:38,215 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:38,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:38,411 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-11-25 15:34:38,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:34:38,412 INFO L85 PathProgramCache]: Analyzing trace with hash -102759775, now seen corresponding path program 1 times [2022-11-25 15:34:38,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:34:38,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527597323] [2022-11-25 15:34:38,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:34:38,413 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-11-25 15:34:38,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:34:38,414 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:38,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:34:38,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 15:34:38,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:34:38,590 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-11-25 15:34:38,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:34:38,657 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:34:38,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:34:38,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527597323] [2022-11-25 15:34:38,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1527597323] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:34:38,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:34:38,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:34:38,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298023838] [2022-11-25 15:34:38,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:34:38,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:34:38,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:34:38,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:34:38,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:34:38,662 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-11-25 15:34:43,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:34:43,231 INFO L93 Difference]: Finished difference Result 2045 states and 2683 transitions. [2022-11-25 15:34:43,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:34:43,232 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-11-25 15:34:43,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:34:43,237 INFO L225 Difference]: With dead ends: 2045 [2022-11-25 15:34:43,237 INFO L226 Difference]: Without dead ends: 2045 [2022-11-25 15:34:43,238 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-11-25 15:34:43,239 INFO L413 NwaCegarLoop]: 1191 mSDtfsCounter, 1375 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s 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, 4.5s IncrementalHoareTripleChecker+Time [2022-11-25 15:34:43,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1378 Valid, 2090 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-11-25 15:34:43,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2045 states. [2022-11-25 15:34:43,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2045 to 1396. [2022-11-25 15:34:43,268 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-11-25 15:34:43,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 1824 transitions. [2022-11-25 15:34:43,272 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 1824 transitions. Word has length 9 [2022-11-25 15:34:43,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:34:43,273 INFO L495 AbstractCegarLoop]: Abstraction has 1396 states and 1824 transitions. [2022-11-25 15:34:43,273 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-11-25 15:34:43,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 1824 transitions. [2022-11-25 15:34:43,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 15:34:43,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:34:43,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:34:43,286 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-25 15:34:43,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:43,486 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-11-25 15:34:43,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:34:43,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1033799265, now seen corresponding path program 1 times [2022-11-25 15:34:43,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:34:43,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1124234163] [2022-11-25 15:34:43,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:34:43,488 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-11-25 15:34:43,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:34:43,489 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:43,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:34:43,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 15:34:43,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:34:43,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:34:43,752 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:34:43,753 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:34:43,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1124234163] [2022-11-25 15:34:43,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1124234163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:34:43,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:34:43,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:34:43,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273206928] [2022-11-25 15:34:43,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:34:43,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:34:43,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:34:43,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:34:43,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:34:43,755 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-11-25 15:34:44,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:34:44,603 INFO L93 Difference]: Finished difference Result 1872 states and 2391 transitions. [2022-11-25 15:34:44,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:34:44,603 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-11-25 15:34:44,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:34:44,608 INFO L225 Difference]: With dead ends: 1872 [2022-11-25 15:34:44,608 INFO L226 Difference]: Without dead ends: 1872 [2022-11-25 15:34:44,609 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-11-25 15:34:44,610 INFO L413 NwaCegarLoop]: 1154 mSDtfsCounter, 546 mSDsluCounter, 1962 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2022-11-25 15:34:44,610 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.8s Time] [2022-11-25 15:34:44,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2022-11-25 15:34:44,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1647. [2022-11-25 15:34:44,640 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-11-25 15:34:44,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2332 transitions. [2022-11-25 15:34:44,646 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2332 transitions. Word has length 11 [2022-11-25 15:34:44,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:34:44,646 INFO L495 AbstractCegarLoop]: Abstraction has 1647 states and 2332 transitions. [2022-11-25 15:34:44,647 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-11-25 15:34:44,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2332 transitions. [2022-11-25 15:34:44,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 15:34:44,647 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:34:44,648 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:34:44,660 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:44,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:44,860 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-11-25 15:34:44,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:34:44,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1297880888, now seen corresponding path program 1 times [2022-11-25 15:34:44,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:34:44,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475528580] [2022-11-25 15:34:44,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:34:44,861 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-11-25 15:34:44,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:34:44,863 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:44,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:34:45,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 15:34:45,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:34:45,069 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:34:45,070 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:34:45,071 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:34:45,075 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-11-25 15:34:45,132 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:34:45,132 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-11-25 15:34:45,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:34:45,151 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:34:45,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:34:45,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475528580] [2022-11-25 15:34:45,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [475528580] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:34:45,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:34:45,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:34:45,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002229730] [2022-11-25 15:34:45,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:34:45,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:34:45,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:34:45,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:34:45,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:34:45,154 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-11-25 15:34:47,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:34:47,063 INFO L93 Difference]: Finished difference Result 1653 states and 2035 transitions. [2022-11-25 15:34:47,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:34:47,065 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-11-25 15:34:47,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:34:47,071 INFO L225 Difference]: With dead ends: 1653 [2022-11-25 15:34:47,071 INFO L226 Difference]: Without dead ends: 1653 [2022-11-25 15:34:47,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:34:47,072 INFO L413 NwaCegarLoop]: 1038 mSDtfsCounter, 358 mSDsluCounter, 1933 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.8s IncrementalHoareTripleChecker+Time [2022-11-25 15:34:47,073 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.8s Time] [2022-11-25 15:34:47,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2022-11-25 15:34:47,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1289. [2022-11-25 15:34:47,096 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-11-25 15:34:47,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1606 transitions. [2022-11-25 15:34:47,100 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1606 transitions. Word has length 14 [2022-11-25 15:34:47,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:34:47,100 INFO L495 AbstractCegarLoop]: Abstraction has 1289 states and 1606 transitions. [2022-11-25 15:34:47,100 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-11-25 15:34:47,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1606 transitions. [2022-11-25 15:34:47,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 15:34:47,101 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:34:47,101 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-11-25 15:34:47,114 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-25 15:34:47,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:47,314 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-11-25 15:34:47,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:34:47,314 INFO L85 PathProgramCache]: Analyzing trace with hash 769788685, now seen corresponding path program 1 times [2022-11-25 15:34:47,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:34:47,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1718899986] [2022-11-25 15:34:47,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:34:47,315 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:34:47,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:34:47,319 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:47,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:34:47,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 15:34:47,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:34:47,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:34:47,515 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:34:47,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:34:47,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1718899986] [2022-11-25 15:34:47,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1718899986] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:34:47,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:34:47,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:34:47,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231734755] [2022-11-25 15:34:47,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:34:47,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:34:47,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:34:47,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:34:47,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:34:47,517 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-11-25 15:34:47,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:34:47,544 INFO L93 Difference]: Finished difference Result 1229 states and 1520 transitions. [2022-11-25 15:34:47,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:34:47,545 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-11-25 15:34:47,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:34:47,548 INFO L225 Difference]: With dead ends: 1229 [2022-11-25 15:34:47,548 INFO L226 Difference]: Without dead ends: 1229 [2022-11-25 15:34:47,549 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-11-25 15:34:47,549 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-11-25 15:34:47,550 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-11-25 15:34:47,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2022-11-25 15:34:47,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1229. [2022-11-25 15:34:47,570 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-11-25 15:34:47,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1520 transitions. [2022-11-25 15:34:47,574 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1520 transitions. Word has length 19 [2022-11-25 15:34:47,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:34:47,575 INFO L495 AbstractCegarLoop]: Abstraction has 1229 states and 1520 transitions. [2022-11-25 15:34:47,575 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-11-25 15:34:47,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1520 transitions. [2022-11-25 15:34:47,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 15:34:47,576 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:34:47,576 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-11-25 15:34:47,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:47,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:47,794 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-11-25 15:34:47,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:34:47,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1032548102, now seen corresponding path program 1 times [2022-11-25 15:34:47,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:34:47,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192917637] [2022-11-25 15:34:47,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:34:47,795 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-11-25 15:34:47,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:34:47,796 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:47,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:34:48,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 15:34:48,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:34:48,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:34:48,029 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:34:48,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:34:48,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [192917637] [2022-11-25 15:34:48,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [192917637] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:34:48,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:34:48,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:34:48,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230005855] [2022-11-25 15:34:48,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:34:48,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:34:48,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:34:48,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:34:48,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:34:48,031 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-11-25 15:34:48,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:34:48,119 INFO L93 Difference]: Finished difference Result 1201 states and 1464 transitions. [2022-11-25 15:34:48,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:34:48,120 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-11-25 15:34:48,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:34:48,124 INFO L225 Difference]: With dead ends: 1201 [2022-11-25 15:34:48,124 INFO L226 Difference]: Without dead ends: 1201 [2022-11-25 15:34:48,124 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-11-25 15:34:48,125 INFO L413 NwaCegarLoop]: 982 mSDtfsCounter, 938 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:34:48,125 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.1s Time] [2022-11-25 15:34:48,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2022-11-25 15:34:48,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 1199. [2022-11-25 15:34:48,147 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-11-25 15:34:48,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1462 transitions. [2022-11-25 15:34:48,151 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1462 transitions. Word has length 21 [2022-11-25 15:34:48,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:34:48,152 INFO L495 AbstractCegarLoop]: Abstraction has 1199 states and 1462 transitions. [2022-11-25 15:34:48,152 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-11-25 15:34:48,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1462 transitions. [2022-11-25 15:34:48,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-25 15:34:48,153 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:34:48,153 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-11-25 15:34:48,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-25 15:34:48,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:48,370 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-11-25 15:34:48,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:34:48,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1673308372, now seen corresponding path program 1 times [2022-11-25 15:34:48,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:34:48,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [123088764] [2022-11-25 15:34:48,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:34:48,373 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-11-25 15:34:48,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:34:48,374 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:48,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:34:48,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 15:34:48,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:34:48,612 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-11-25 15:34:48,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:34:48,719 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:34:48,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:34:48,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [123088764] [2022-11-25 15:34:48,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [123088764] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:34:48,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:34:48,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:34:48,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523137885] [2022-11-25 15:34:48,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:34:48,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:34:48,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:34:48,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:34:48,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:34:48,722 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-11-25 15:34:53,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:34:53,164 INFO L93 Difference]: Finished difference Result 2183 states and 2663 transitions. [2022-11-25 15:34:53,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:34:53,165 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-11-25 15:34:53,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:34:53,171 INFO L225 Difference]: With dead ends: 2183 [2022-11-25 15:34:53,171 INFO L226 Difference]: Without dead ends: 2183 [2022-11-25 15:34:53,172 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-11-25 15:34:53,172 INFO L413 NwaCegarLoop]: 840 mSDtfsCounter, 2036 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 1841 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s 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, 4.3s IncrementalHoareTripleChecker+Time [2022-11-25 15:34:53,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2039 Valid, 2017 Invalid, 1859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1841 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-11-25 15:34:53,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2183 states. [2022-11-25 15:34:53,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2183 to 1195. [2022-11-25 15:34:53,196 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-11-25 15:34:53,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1454 transitions. [2022-11-25 15:34:53,200 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1454 transitions. Word has length 35 [2022-11-25 15:34:53,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:34:53,200 INFO L495 AbstractCegarLoop]: Abstraction has 1195 states and 1454 transitions. [2022-11-25 15:34:53,200 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-11-25 15:34:53,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1454 transitions. [2022-11-25 15:34:53,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-25 15:34:53,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:34:53,202 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-11-25 15:34:53,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-25 15:34:53,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:53,414 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-11-25 15:34:53,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:34:53,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1673308373, now seen corresponding path program 1 times [2022-11-25 15:34:53,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:34:53,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1979301661] [2022-11-25 15:34:53,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:34:53,415 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-11-25 15:34:53,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:34:53,417 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:53,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:34:53,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 15:34:53,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:34:53,675 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-11-25 15:34:53,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:34:53,937 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:34:53,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:34:53,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1979301661] [2022-11-25 15:34:53,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1979301661] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:34:53,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:34:53,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:34:53,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756854239] [2022-11-25 15:34:53,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:34:53,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:34:53,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:34:53,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:34:53,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:34:53,939 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-11-25 15:34:59,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:34:59,147 INFO L93 Difference]: Finished difference Result 1805 states and 2217 transitions. [2022-11-25 15:34:59,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:34:59,148 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-11-25 15:34:59,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:34:59,153 INFO L225 Difference]: With dead ends: 1805 [2022-11-25 15:34:59,153 INFO L226 Difference]: Without dead ends: 1805 [2022-11-25 15:34:59,154 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-11-25 15:34:59,154 INFO L413 NwaCegarLoop]: 1229 mSDtfsCounter, 1783 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 1614 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s 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, 5.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:34:59,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1783 Valid, 2579 Invalid, 1631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-11-25 15:34:59,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2022-11-25 15:34:59,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1191. [2022-11-25 15:34:59,181 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-11-25 15:34:59,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1446 transitions. [2022-11-25 15:34:59,184 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1446 transitions. Word has length 35 [2022-11-25 15:34:59,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:34:59,185 INFO L495 AbstractCegarLoop]: Abstraction has 1191 states and 1446 transitions. [2022-11-25 15:34:59,185 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-11-25 15:34:59,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1446 transitions. [2022-11-25 15:34:59,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-25 15:34:59,187 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:34:59,187 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-11-25 15:34:59,207 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:59,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:59,399 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-11-25 15:34:59,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:34:59,400 INFO L85 PathProgramCache]: Analyzing trace with hash -2063932984, now seen corresponding path program 1 times [2022-11-25 15:34:59,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:34:59,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431957290] [2022-11-25 15:34:59,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:34:59,401 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-11-25 15:34:59,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:34:59,402 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:59,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:34:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:34:59,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 15:34:59,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:34:59,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:34:59,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:34:59,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:34:59,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431957290] [2022-11-25 15:34:59,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [431957290] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:34:59,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:34:59,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:34:59,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670278143] [2022-11-25 15:34:59,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:34:59,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:34:59,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:34:59,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:34:59,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:34:59,759 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-11-25 15:34:59,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:34:59,817 INFO L93 Difference]: Finished difference Result 1179 states and 1426 transitions. [2022-11-25 15:34:59,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:34:59,818 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-11-25 15:34:59,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:34:59,822 INFO L225 Difference]: With dead ends: 1179 [2022-11-25 15:34:59,822 INFO L226 Difference]: Without dead ends: 1179 [2022-11-25 15:34:59,822 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-11-25 15:34:59,823 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-11-25 15:34:59,823 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-11-25 15:34:59,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2022-11-25 15:34:59,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1179. [2022-11-25 15:34:59,842 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-11-25 15:34:59,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1426 transitions. [2022-11-25 15:34:59,845 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1426 transitions. Word has length 54 [2022-11-25 15:34:59,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:34:59,845 INFO L495 AbstractCegarLoop]: Abstraction has 1179 states and 1426 transitions. [2022-11-25 15:34:59,845 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-11-25 15:34:59,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1426 transitions. [2022-11-25 15:34:59,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-25 15:34:59,846 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:34:59,847 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-11-25 15:34:59,861 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:00,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:00,061 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-11-25 15:35:00,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:00,061 INFO L85 PathProgramCache]: Analyzing trace with hash -203146628, now seen corresponding path program 1 times [2022-11-25 15:35:00,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:35:00,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926513418] [2022-11-25 15:35:00,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:00,063 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-11-25 15:35:00,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:35:00,065 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:00,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:00,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 15:35:00,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:35:00,538 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 15:35:00,538 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-11-25 15:35:00,619 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 15:35:00,619 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-11-25 15:35:01,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:01,110 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:35:01,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:35:01,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926513418] [2022-11-25 15:35:01,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [926513418] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:35:01,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:35:01,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:35:01,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438738894] [2022-11-25 15:35:01,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:35:01,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:35:01,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:35:01,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:35:01,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:35:01,113 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-11-25 15:35:05,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:35:05,557 INFO L93 Difference]: Finished difference Result 2639 states and 3164 transitions. [2022-11-25 15:35:05,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:35:05,560 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-11-25 15:35:05,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:35:05,568 INFO L225 Difference]: With dead ends: 2639 [2022-11-25 15:35:05,568 INFO L226 Difference]: Without dead ends: 2639 [2022-11-25 15:35:05,568 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-11-25 15:35:05,569 INFO L413 NwaCegarLoop]: 881 mSDtfsCounter, 3028 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 1457 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s 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, 4.3s IncrementalHoareTripleChecker+Time [2022-11-25 15:35:05,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3028 Valid, 1820 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1457 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-11-25 15:35:05,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2639 states. [2022-11-25 15:35:05,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2639 to 1615. [2022-11-25 15:35:05,603 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-11-25 15:35:05,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2235 transitions. [2022-11-25 15:35:05,607 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2235 transitions. Word has length 62 [2022-11-25 15:35:05,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:35:05,607 INFO L495 AbstractCegarLoop]: Abstraction has 1615 states and 2235 transitions. [2022-11-25 15:35:05,608 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-11-25 15:35:05,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2235 transitions. [2022-11-25 15:35:05,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-25 15:35:05,609 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:35:05,609 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-11-25 15:35:05,628 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-25 15:35:05,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:05,824 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-11-25 15:35:05,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:05,825 INFO L85 PathProgramCache]: Analyzing trace with hash -203146627, now seen corresponding path program 1 times [2022-11-25 15:35:05,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:35:05,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53681637] [2022-11-25 15:35:05,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:05,826 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-11-25 15:35:05,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:35:05,827 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:05,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:06,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 15:35:06,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:35:06,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:35:06,298 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-11-25 15:35:06,381 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:35:06,382 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-11-25 15:35:07,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:07,162 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:35:07,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:35:07,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [53681637] [2022-11-25 15:35:07,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [53681637] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:35:07,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:35:07,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:35:07,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440492916] [2022-11-25 15:35:07,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:35:07,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:35:07,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:35:07,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:35:07,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:35:07,165 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-11-25 15:35:12,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:35:12,034 INFO L93 Difference]: Finished difference Result 1621 states and 2242 transitions. [2022-11-25 15:35:12,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:35:12,034 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-11-25 15:35:12,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:35:12,040 INFO L225 Difference]: With dead ends: 1621 [2022-11-25 15:35:12,040 INFO L226 Difference]: Without dead ends: 1621 [2022-11-25 15:35:12,041 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-11-25 15:35:12,041 INFO L413 NwaCegarLoop]: 958 mSDtfsCounter, 111 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 1632 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s 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, 4.8s IncrementalHoareTripleChecker+Time [2022-11-25 15:35:12,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 2283 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1632 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-11-25 15:35:12,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2022-11-25 15:35:12,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1620. [2022-11-25 15:35:12,066 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-11-25 15:35:12,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2241 transitions. [2022-11-25 15:35:12,070 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2241 transitions. Word has length 62 [2022-11-25 15:35:12,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:35:12,071 INFO L495 AbstractCegarLoop]: Abstraction has 1620 states and 2241 transitions. [2022-11-25 15:35:12,071 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-11-25 15:35:12,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2241 transitions. [2022-11-25 15:35:12,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-25 15:35:12,072 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:35:12,072 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-11-25 15:35:12,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-25 15:35:12,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:12,288 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-11-25 15:35:12,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:12,289 INFO L85 PathProgramCache]: Analyzing trace with hash 389814229, now seen corresponding path program 1 times [2022-11-25 15:35:12,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:35:12,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1712980075] [2022-11-25 15:35:12,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:12,290 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-11-25 15:35:12,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:35:12,291 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:12,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:12,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 15:35:12,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:35:12,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:12,704 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:35:12,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:35:12,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1712980075] [2022-11-25 15:35:12,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1712980075] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:35:12,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:35:12,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:35:12,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286162485] [2022-11-25 15:35:12,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:35:12,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:35:12,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:35:12,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:35:12,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:35:12,707 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-11-25 15:35:12,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:35:12,845 INFO L93 Difference]: Finished difference Result 1646 states and 2268 transitions. [2022-11-25 15:35:12,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:35:12,845 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-11-25 15:35:12,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:35:12,852 INFO L225 Difference]: With dead ends: 1646 [2022-11-25 15:35:12,852 INFO L226 Difference]: Without dead ends: 1646 [2022-11-25 15:35:12,852 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-11-25 15:35:12,853 INFO L413 NwaCegarLoop]: 973 mSDtfsCounter, 19 mSDsluCounter, 3882 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-11-25 15:35:12,853 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-11-25 15:35:12,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2022-11-25 15:35:12,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1644. [2022-11-25 15:35:12,897 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-11-25 15:35:12,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 2268 transitions. [2022-11-25 15:35:12,917 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 2268 transitions. Word has length 68 [2022-11-25 15:35:12,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:35:12,919 INFO L495 AbstractCegarLoop]: Abstraction has 1644 states and 2268 transitions. [2022-11-25 15:35:12,920 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-11-25 15:35:12,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2268 transitions. [2022-11-25 15:35:12,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-25 15:35:12,921 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:35:12,921 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-11-25 15:35:12,941 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-25 15:35:13,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:13,136 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-11-25 15:35:13,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:13,137 INFO L85 PathProgramCache]: Analyzing trace with hash 341176989, now seen corresponding path program 1 times [2022-11-25 15:35:13,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:35:13,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [637790362] [2022-11-25 15:35:13,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:13,138 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-11-25 15:35:13,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:35:13,139 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:13,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:13,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 15:35:13,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:35:13,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:13,669 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:35:13,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:35:13,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [637790362] [2022-11-25 15:35:13,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [637790362] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:35:13,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:35:13,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:35:13,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267309180] [2022-11-25 15:35:13,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:35:13,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:35:13,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:35:13,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:35:13,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:35:13,672 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-11-25 15:35:13,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:35:13,930 INFO L93 Difference]: Finished difference Result 1656 states and 2282 transitions. [2022-11-25 15:35:13,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:35:13,931 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-11-25 15:35:13,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:35:13,937 INFO L225 Difference]: With dead ends: 1656 [2022-11-25 15:35:13,937 INFO L226 Difference]: Without dead ends: 1656 [2022-11-25 15:35:13,937 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-11-25 15:35:13,938 INFO L413 NwaCegarLoop]: 959 mSDtfsCounter, 20 mSDsluCounter, 2818 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-11-25 15:35:13,938 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.2s Time] [2022-11-25 15:35:13,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2022-11-25 15:35:13,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1647. [2022-11-25 15:35:13,965 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-11-25 15:35:13,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2271 transitions. [2022-11-25 15:35:13,985 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2271 transitions. Word has length 68 [2022-11-25 15:35:13,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:35:13,985 INFO L495 AbstractCegarLoop]: Abstraction has 1647 states and 2271 transitions. [2022-11-25 15:35:13,986 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-11-25 15:35:13,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2271 transitions. [2022-11-25 15:35:13,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-25 15:35:13,986 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:35:13,987 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-11-25 15:35:14,008 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-11-25 15:35:14,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:14,208 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-11-25 15:35:14,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:14,209 INFO L85 PathProgramCache]: Analyzing trace with hash -233122725, now seen corresponding path program 1 times [2022-11-25 15:35:14,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:35:14,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [920679504] [2022-11-25 15:35:14,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:14,209 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-11-25 15:35:14,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:35:14,211 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:14,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:14,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:14,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 15:35:14,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:35:14,717 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-11-25 15:35:14,914 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-11-25 15:35:14,952 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 15:35:14,952 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-11-25 15:35:14,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:14,967 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:35:14,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:35:14,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [920679504] [2022-11-25 15:35:14,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [920679504] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:35:14,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:35:14,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:35:14,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968704030] [2022-11-25 15:35:14,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:35:14,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:35:14,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:35:14,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:35:14,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2022-11-25 15:35:14,969 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-11-25 15:35:19,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:35:19,848 INFO L93 Difference]: Finished difference Result 2769 states and 3749 transitions. [2022-11-25 15:35:19,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:35:19,849 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-11-25 15:35:19,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:35:19,857 INFO L225 Difference]: With dead ends: 2769 [2022-11-25 15:35:19,857 INFO L226 Difference]: Without dead ends: 2769 [2022-11-25 15:35:19,857 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-11-25 15:35:19,858 INFO L413 NwaCegarLoop]: 794 mSDtfsCounter, 1428 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 2121 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s 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, 4.8s IncrementalHoareTripleChecker+Time [2022-11-25 15:35:19,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1434 Valid, 2219 Invalid, 4034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2121 Invalid, 0 Unknown, 1894 Unchecked, 4.8s Time] [2022-11-25 15:35:19,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2769 states. [2022-11-25 15:35:19,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2769 to 1646. [2022-11-25 15:35:19,889 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-11-25 15:35:19,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 2269 transitions. [2022-11-25 15:35:19,894 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 2269 transitions. Word has length 73 [2022-11-25 15:35:19,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:35:19,894 INFO L495 AbstractCegarLoop]: Abstraction has 1646 states and 2269 transitions. [2022-11-25 15:35:19,894 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-11-25 15:35:19,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2269 transitions. [2022-11-25 15:35:19,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-25 15:35:19,895 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:35:19,895 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-11-25 15:35:19,916 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-25 15:35:20,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:20,111 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-11-25 15:35:20,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:20,112 INFO L85 PathProgramCache]: Analyzing trace with hash -233122724, now seen corresponding path program 1 times [2022-11-25 15:35:20,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:35:20,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1109706353] [2022-11-25 15:35:20,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:20,113 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-11-25 15:35:20,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:35:20,115 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:20,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:20,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-25 15:35:20,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:35:20,604 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-11-25 15:35:20,612 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-11-25 15:35:21,221 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-11-25 15:35:21,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:35:21,246 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-11-25 15:35:21,258 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 15:35:21,258 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-11-25 15:35:21,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:21,284 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:35:21,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:35:21,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1109706353] [2022-11-25 15:35:21,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1109706353] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:35:21,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:35:21,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:35:21,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469131160] [2022-11-25 15:35:21,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:35:21,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:35:21,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:35:21,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:35:21,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2022-11-25 15:35:21,287 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-11-25 15:35:29,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:35:29,436 INFO L93 Difference]: Finished difference Result 2840 states and 3874 transitions. [2022-11-25 15:35:29,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:35:29,436 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-11-25 15:35:29,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:35:29,443 INFO L225 Difference]: With dead ends: 2840 [2022-11-25 15:35:29,444 INFO L226 Difference]: Without dead ends: 2840 [2022-11-25 15:35:29,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2022-11-25 15:35:29,445 INFO L413 NwaCegarLoop]: 1040 mSDtfsCounter, 2151 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 3092 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s 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, 8.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:35:29,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2157 Valid, 2397 Invalid, 5020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 3092 Invalid, 0 Unknown, 1900 Unchecked, 8.0s Time] [2022-11-25 15:35:29,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2840 states. [2022-11-25 15:35:29,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2840 to 1642. [2022-11-25 15:35:29,476 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-11-25 15:35:29,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 2257 transitions. [2022-11-25 15:35:29,480 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 2257 transitions. Word has length 73 [2022-11-25 15:35:29,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:35:29,481 INFO L495 AbstractCegarLoop]: Abstraction has 1642 states and 2257 transitions. [2022-11-25 15:35:29,481 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-11-25 15:35:29,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 2257 transitions. [2022-11-25 15:35:29,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-25 15:35:29,482 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:35:29,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, 1, 1, 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-11-25 15:35:29,504 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:29,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:29,695 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-11-25 15:35:29,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:29,696 INFO L85 PathProgramCache]: Analyzing trace with hash -159183299, now seen corresponding path program 1 times [2022-11-25 15:35:29,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:35:29,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238358836] [2022-11-25 15:35:29,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:29,696 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-11-25 15:35:29,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:35:29,697 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:29,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:30,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 15:35:30,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:35:30,064 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-11-25 15:35:30,091 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-11-25 15:35:30,127 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-11-25 15:35:30,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:30,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:35:30,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:35:30,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238358836] [2022-11-25 15:35:30,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [238358836] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:35:30,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:35:30,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 15:35:30,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229453014] [2022-11-25 15:35:30,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:35:30,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 15:35:30,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:35:30,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 15:35:30,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:35:30,177 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-11-25 15:35:35,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:35:35,305 INFO L93 Difference]: Finished difference Result 1657 states and 2273 transitions. [2022-11-25 15:35:35,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 15:35:35,307 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-11-25 15:35:35,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:35:35,311 INFO L225 Difference]: With dead ends: 1657 [2022-11-25 15:35:35,312 INFO L226 Difference]: Without dead ends: 1657 [2022-11-25 15:35:35,312 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-11-25 15:35:35,313 INFO L413 NwaCegarLoop]: 959 mSDtfsCounter, 23 mSDsluCounter, 3109 mSDsCounter, 0 mSdLazyCounter, 2696 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s 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, 5.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:35:35,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 4068 Invalid, 2698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2696 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-11-25 15:35:35,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2022-11-25 15:35:35,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1656. [2022-11-25 15:35:35,337 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-11-25 15:35:35,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2273 transitions. [2022-11-25 15:35:35,342 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2273 transitions. Word has length 80 [2022-11-25 15:35:35,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:35:35,342 INFO L495 AbstractCegarLoop]: Abstraction has 1656 states and 2273 transitions. [2022-11-25 15:35:35,342 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-11-25 15:35:35,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2273 transitions. [2022-11-25 15:35:35,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-25 15:35:35,343 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:35:35,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-25 15:35:35,358 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:35,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:35,558 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-11-25 15:35:35,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:35,559 INFO L85 PathProgramCache]: Analyzing trace with hash -639714905, now seen corresponding path program 1 times [2022-11-25 15:35:35,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:35:35,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [366164604] [2022-11-25 15:35:35,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:35,560 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-11-25 15:35:35,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:35:35,561 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:35,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:35,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-25 15:35:35,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:35:36,012 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-11-25 15:35:36,060 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-11-25 15:35:36,069 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-11-25 15:35:36,137 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-11-25 15:35:36,144 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-11-25 15:35:36,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:36,252 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:35:36,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:35:36,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [366164604] [2022-11-25 15:35:36,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [366164604] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:35:36,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:35:36,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 15:35:36,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553698246] [2022-11-25 15:35:36,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:35:36,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 15:35:36,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:35:36,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 15:35:36,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 15:35:36,255 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-11-25 15:35:43,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:35:43,385 INFO L93 Difference]: Finished difference Result 1656 states and 2271 transitions. [2022-11-25 15:35:43,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 15:35:43,385 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-11-25 15:35:43,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:35:43,388 INFO L225 Difference]: With dead ends: 1656 [2022-11-25 15:35:43,388 INFO L226 Difference]: Without dead ends: 1656 [2022-11-25 15:35:43,389 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-11-25 15:35:43,389 INFO L413 NwaCegarLoop]: 954 mSDtfsCounter, 19 mSDsluCounter, 3910 mSDsCounter, 0 mSdLazyCounter, 2866 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.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, 6.9s IncrementalHoareTripleChecker+Time [2022-11-25 15:35:43,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 4864 Invalid, 2867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2866 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2022-11-25 15:35:43,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2022-11-25 15:35:43,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1656. [2022-11-25 15:35:43,413 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-11-25 15:35:43,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2271 transitions. [2022-11-25 15:35:43,417 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2271 transitions. Word has length 81 [2022-11-25 15:35:43,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:35:43,417 INFO L495 AbstractCegarLoop]: Abstraction has 1656 states and 2271 transitions. [2022-11-25 15:35:43,418 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-11-25 15:35:43,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2271 transitions. [2022-11-25 15:35:43,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-25 15:35:43,419 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:35:43,419 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-11-25 15:35:43,435 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:43,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:43,634 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-11-25 15:35:43,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:43,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1094788593, now seen corresponding path program 1 times [2022-11-25 15:35:43,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:35:43,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1963895155] [2022-11-25 15:35:43,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:43,635 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-11-25 15:35:43,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:35:43,636 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:43,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:44,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 15:35:44,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:35:44,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:44,052 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:35:44,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:35:44,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1963895155] [2022-11-25 15:35:44,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1963895155] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:35:44,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:35:44,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:35:44,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963042501] [2022-11-25 15:35:44,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:35:44,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:35:44,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:35:44,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:35:44,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:35:44,055 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-11-25 15:35:44,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:35:44,138 INFO L93 Difference]: Finished difference Result 1672 states and 2289 transitions. [2022-11-25 15:35:44,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:35:44,139 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-11-25 15:35:44,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:35:44,143 INFO L225 Difference]: With dead ends: 1672 [2022-11-25 15:35:44,143 INFO L226 Difference]: Without dead ends: 1666 [2022-11-25 15:35:44,144 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-11-25 15:35:44,144 INFO L413 NwaCegarLoop]: 962 mSDtfsCounter, 13 mSDsluCounter, 1916 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:35:44,145 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.1s Time] [2022-11-25 15:35:44,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2022-11-25 15:35:44,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1666. [2022-11-25 15:35:44,168 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-11-25 15:35:44,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 2283 transitions. [2022-11-25 15:35:44,172 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 2283 transitions. Word has length 88 [2022-11-25 15:35:44,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:35:44,172 INFO L495 AbstractCegarLoop]: Abstraction has 1666 states and 2283 transitions. [2022-11-25 15:35:44,173 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-11-25 15:35:44,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 2283 transitions. [2022-11-25 15:35:44,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-25 15:35:44,174 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:35:44,174 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-11-25 15:35:44,193 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:44,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:44,389 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-11-25 15:35:44,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:44,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1402763991, now seen corresponding path program 1 times [2022-11-25 15:35:44,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:35:44,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880524475] [2022-11-25 15:35:44,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:44,390 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-11-25 15:35:44,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:35:44,391 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:44,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:44,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 15:35:44,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:35:44,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:44,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:35:45,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:45,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:35:45,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880524475] [2022-11-25 15:35:45,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [880524475] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:35:45,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:35:45,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-11-25 15:35:45,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96412498] [2022-11-25 15:35:45,022 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:35:45,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 15:35:45,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:35:45,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 15:35:45,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:35:45,024 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-11-25 15:35:45,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:35:45,322 INFO L93 Difference]: Finished difference Result 1692 states and 2313 transitions. [2022-11-25 15:35:45,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 15:35:45,323 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-11-25 15:35:45,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:35:45,328 INFO L225 Difference]: With dead ends: 1692 [2022-11-25 15:35:45,328 INFO L226 Difference]: Without dead ends: 1680 [2022-11-25 15:35:45,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2022-11-25 15:35:45,329 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-11-25 15:35:45,329 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-11-25 15:35:45,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2022-11-25 15:35:45,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1674. [2022-11-25 15:35:45,354 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-11-25 15:35:45,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2293 transitions. [2022-11-25 15:35:45,358 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2293 transitions. Word has length 89 [2022-11-25 15:35:45,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:35:45,359 INFO L495 AbstractCegarLoop]: Abstraction has 1674 states and 2293 transitions. [2022-11-25 15:35:45,359 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-11-25 15:35:45,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2293 transitions. [2022-11-25 15:35:45,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-25 15:35:45,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:35:45,361 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-11-25 15:35:45,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-25 15:35:45,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:45,575 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-11-25 15:35:45,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:45,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1478348943, now seen corresponding path program 2 times [2022-11-25 15:35:45,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:35:45,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [571941805] [2022-11-25 15:35:45,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:35:45,577 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-11-25 15:35:45,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:35:45,578 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:45,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:46,286 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 15:35:46,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:35:46,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 15:35:46,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:35:46,460 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:46,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:35:46,862 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:46,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:35:46,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [571941805] [2022-11-25 15:35:46,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [571941805] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:35:46,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:35:46,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-11-25 15:35:46,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436681649] [2022-11-25 15:35:46,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:35:46,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-25 15:35:46,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:35:46,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 15:35:46,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-25 15:35:46,864 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-11-25 15:35:47,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:35:47,907 INFO L93 Difference]: Finished difference Result 1728 states and 2361 transitions. [2022-11-25 15:35:47,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-25 15:35:47,908 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-11-25 15:35:47,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:35:47,913 INFO L225 Difference]: With dead ends: 1728 [2022-11-25 15:35:47,913 INFO L226 Difference]: Without dead ends: 1716 [2022-11-25 15:35:47,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=343, Invalid=649, Unknown=0, NotChecked=0, Total=992 [2022-11-25 15:35:47,914 INFO L413 NwaCegarLoop]: 971 mSDtfsCounter, 52 mSDsluCounter, 8660 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-11-25 15:35:47,914 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.5s Time] [2022-11-25 15:35:47,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2022-11-25 15:35:47,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1692. [2022-11-25 15:35:47,935 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-11-25 15:35:47,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1692 states and 2317 transitions. [2022-11-25 15:35:47,939 INFO L78 Accepts]: Start accepts. Automaton has 1692 states and 2317 transitions. Word has length 92 [2022-11-25 15:35:47,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:35:47,940 INFO L495 AbstractCegarLoop]: Abstraction has 1692 states and 2317 transitions. [2022-11-25 15:35:47,940 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-11-25 15:35:47,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 2317 transitions. [2022-11-25 15:35:47,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-25 15:35:47,941 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:35:47,941 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-11-25 15:35:47,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-25 15:35:48,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:48,151 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-11-25 15:35:48,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:48,152 INFO L85 PathProgramCache]: Analyzing trace with hash -2075896399, now seen corresponding path program 3 times [2022-11-25 15:35:48,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:35:48,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [406629609] [2022-11-25 15:35:48,152 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 15:35:48,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-11-25 15:35:48,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:35:48,153 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:48,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:49,243 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-25 15:35:49,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:35:49,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-25 15:35:49,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:35:49,610 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:49,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:35:50,814 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:50,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:35:50,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [406629609] [2022-11-25 15:35:50,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [406629609] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:35:50,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:35:50,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-11-25 15:35:50,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238676429] [2022-11-25 15:35:50,815 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:35:50,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-25 15:35:50,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:35:50,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-25 15:35:50,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2022-11-25 15:35:50,817 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-11-25 15:35:56,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:35:56,292 INFO L93 Difference]: Finished difference Result 1800 states and 2465 transitions. [2022-11-25 15:35:56,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-25 15:35:56,293 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-11-25 15:35:56,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:35:56,297 INFO L225 Difference]: With dead ends: 1800 [2022-11-25 15:35:56,298 INFO L226 Difference]: Without dead ends: 1782 [2022-11-25 15:35:56,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=924, Invalid=1832, Unknown=0, NotChecked=0, Total=2756 [2022-11-25 15:35:56,299 INFO L413 NwaCegarLoop]: 983 mSDtfsCounter, 148 mSDsluCounter, 13639 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.8s IncrementalHoareTripleChecker+Time [2022-11-25 15:35:56,300 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.8s Time] [2022-11-25 15:35:56,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2022-11-25 15:35:56,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1728. [2022-11-25 15:35:56,324 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-11-25 15:35:56,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1728 states and 2363 transitions. [2022-11-25 15:35:56,328 INFO L78 Accepts]: Start accepts. Automaton has 1728 states and 2363 transitions. Word has length 98 [2022-11-25 15:35:56,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:35:56,329 INFO L495 AbstractCegarLoop]: Abstraction has 1728 states and 2363 transitions. [2022-11-25 15:35:56,329 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-11-25 15:35:56,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2363 transitions. [2022-11-25 15:35:56,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-25 15:35:56,330 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:35:56,330 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-11-25 15:35:56,352 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:56,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:56,549 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-11-25 15:35:56,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:56,550 INFO L85 PathProgramCache]: Analyzing trace with hash -493120975, now seen corresponding path program 4 times [2022-11-25 15:35:56,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:35:56,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819918917] [2022-11-25 15:35:56,551 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 15:35:56,551 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-11-25 15:35:56,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:35:56,553 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:56,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:35:57,090 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 15:35:57,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:35:57,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-25 15:35:57,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:35:57,923 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:57,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:36:00,789 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:36:00,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:36:00,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [819918917] [2022-11-25 15:36:00,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [819918917] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:36:00,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:36:00,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2022-11-25 15:36:00,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753757607] [2022-11-25 15:36:00,791 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:36:00,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-25 15:36:00,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:36:00,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-25 15:36:00,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=1927, Unknown=0, NotChecked=0, Total=2652 [2022-11-25 15:36:00,794 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-11-25 15:36:15,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:36:15,459 INFO L93 Difference]: Finished difference Result 1934 states and 2633 transitions. [2022-11-25 15:36:15,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-11-25 15:36:15,461 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-11-25 15:36:15,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:36:15,465 INFO L225 Difference]: With dead ends: 1934 [2022-11-25 15:36:15,465 INFO L226 Difference]: Without dead ends: 1922 [2022-11-25 15:36:15,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1902 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=4121, Invalid=9921, Unknown=0, NotChecked=0, Total=14042 [2022-11-25 15:36:15,469 INFO L413 NwaCegarLoop]: 1005 mSDtfsCounter, 178 mSDsluCounter, 26849 mSDsCounter, 0 mSdLazyCounter, 2486 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 27854 SdHoareTripleChecker+Invalid, 2542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-25 15:36:15,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 27854 Invalid, 2542 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [56 Valid, 2486 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-11-25 15:36:15,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2022-11-25 15:36:15,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1796. [2022-11-25 15:36:15,493 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-11-25 15:36:15,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2455 transitions. [2022-11-25 15:36:15,497 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2455 transitions. Word has length 110 [2022-11-25 15:36:15,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:36:15,497 INFO L495 AbstractCegarLoop]: Abstraction has 1796 states and 2455 transitions. [2022-11-25 15:36:15,497 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-11-25 15:36:15,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2455 transitions. [2022-11-25 15:36:15,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-11-25 15:36:15,499 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:36:15,499 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-11-25 15:36:15,521 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:36:15,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:36:15,716 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-11-25 15:36:15,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:15,716 INFO L85 PathProgramCache]: Analyzing trace with hash 495144561, now seen corresponding path program 5 times [2022-11-25 15:36:15,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:36:15,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1600470015] [2022-11-25 15:36:15,717 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 15:36:15,717 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-11-25 15:36:15,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:36:15,719 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:36:15,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:36:17,492 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-11-25 15:36:17,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:36:17,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-25 15:36:17,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:36:17,545 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-11-25 15:36:17,775 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 15:36:17,776 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-11-25 15:36:17,814 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-11-25 15:36:17,959 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-11-25 15:36:20,753 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:36:20,754 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-11-25 15:36:20,807 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-11-25 15:36:20,857 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-25 15:36:20,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:36:23,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:36:23,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1600470015] [2022-11-25 15:36:23,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1600470015] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:36:23,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [20530959] [2022-11-25 15:36:23,368 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 15:36:23,368 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 15:36:23,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 15:36:23,370 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 15:36:23,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2022-11-25 15:37:33,813 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-11-25 15:37:33,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:37:34,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-25 15:37:34,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:37:34,071 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-11-25 15:37:34,287 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 15:37:34,288 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-11-25 15:37:34,306 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-11-25 15:37:34,379 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-11-25 15:37:37,283 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:37:37,283 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-11-25 15:37:37,351 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-11-25 15:37:37,361 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-25 15:37:37,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:37:37,756 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-11-25 15:37:37,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [20530959] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:37:37,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:37:37,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2022-11-25 15:37:37,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260997533] [2022-11-25 15:37:37,758 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:37:37,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 15:37:37,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:37:37,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 15:37:37,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=217, Unknown=16, NotChecked=30, Total=306 [2022-11-25 15:37:37,760 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-11-25 15:37:54,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:37:54,419 INFO L93 Difference]: Finished difference Result 2266 states and 3051 transitions. [2022-11-25 15:37:54,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 15:37:54,420 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-11-25 15:37:54,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:37:54,424 INFO L225 Difference]: With dead ends: 2266 [2022-11-25 15:37:54,424 INFO L226 Difference]: Without dead ends: 2266 [2022-11-25 15:37:54,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 166 SyntacticMatches, 89 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=113, Invalid=566, Unknown=27, NotChecked=50, Total=756 [2022-11-25 15:37:54,425 INFO L413 NwaCegarLoop]: 501 mSDtfsCounter, 1669 mSDsluCounter, 3782 mSDsCounter, 0 mSdLazyCounter, 4590 mSolverCounterSat, 33 mSolverCounterUnsat, 848 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1672 SdHoareTripleChecker+Valid, 4283 SdHoareTripleChecker+Invalid, 5471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 4590 IncrementalHoareTripleChecker+Invalid, 848 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:37:54,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1672 Valid, 4283 Invalid, 5471 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [33 Valid, 4590 Invalid, 848 Unknown, 0 Unchecked, 16.0s Time] [2022-11-25 15:37:54,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2022-11-25 15:37:54,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 1793. [2022-11-25 15:37:54,448 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-11-25 15:37:54,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2449 transitions. [2022-11-25 15:37:54,452 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2449 transitions. Word has length 132 [2022-11-25 15:37:54,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:37:54,452 INFO L495 AbstractCegarLoop]: Abstraction has 1793 states and 2449 transitions. [2022-11-25 15:37:54,453 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-11-25 15:37:54,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2449 transitions. [2022-11-25 15:37:54,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-11-25 15:37:54,454 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:37:54,454 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-11-25 15:37:54,476 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:37:54,712 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2022-11-25 15:37:54,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt [2022-11-25 15:37:54,876 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-11-25 15:37:54,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:37:54,877 INFO L85 PathProgramCache]: Analyzing trace with hash 495144562, now seen corresponding path program 1 times [2022-11-25 15:37:54,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:37:54,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896948811] [2022-11-25 15:37:54,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:37:54,878 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-11-25 15:37:54,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:37:54,879 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:37:54,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:37:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:37:55,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 120 conjunts are in the unsatisfiable core [2022-11-25 15:37:55,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:37:55,878 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-11-25 15:37:56,341 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-11-25 15:37:56,411 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 15:37:56,411 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-11-25 15:37:56,471 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-11-25 15:37:56,489 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-11-25 15:37:56,688 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-11-25 15:37:56,694 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-11-25 15:37:59,747 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:37:59,747 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-11-25 15:37:59,753 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-11-25 15:37:59,832 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-11-25 15:37:59,842 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-11-25 15:37:59,894 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-25 15:37:59,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:38:01,132 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-11-25 15:38:01,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:38:01,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [896948811] [2022-11-25 15:38:01,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [896948811] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:38:01,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [887345171] [2022-11-25 15:38:01,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:38:01,141 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 15:38:01,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 15:38:01,144 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 15:38:01,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2022-11-25 15:39:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:58,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 118 conjunts are in the unsatisfiable core [2022-11-25 15:39:58,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:39:58,088 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-11-25 15:39:58,413 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-11-25 15:39:58,449 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 15:39:58,450 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-11-25 15:39:58,533 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-11-25 15:39:58,544 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-11-25 15:39:58,789 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-11-25 15:39:58,796 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-11-25 15:40:01,634 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:40:01,634 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-11-25 15:40:01,641 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-11-25 15:40:01,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 31 treesize of output 13 [2022-11-25 15:40:01,755 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-11-25 15:40:01,763 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-25 15:40:01,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:40:02,842 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-11-25 15:40:02,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [887345171] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:40:02,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:40:02,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 19 [2022-11-25 15:40:02,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423860067] [2022-11-25 15:40:02,852 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:40:02,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-25 15:40:02,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:40:02,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-25 15:40:02,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=392, Unknown=17, NotChecked=82, Total=552 [2022-11-25 15:40:02,854 INFO L87 Difference]: Start difference. First operand 1793 states and 2449 transitions. Second operand has 20 states, 17 states have (on average 8.647058823529411) internal successors, (147), 16 states have internal predecessors, (147), 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-11-25 15:40:31,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:40:31,824 INFO L93 Difference]: Finished difference Result 2912 states and 3923 transitions. [2022-11-25 15:40:31,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 15:40:31,825 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.647058823529411) internal successors, (147), 16 states have internal predecessors, (147), 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 132 [2022-11-25 15:40:31,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:40:31,830 INFO L225 Difference]: With dead ends: 2912 [2022-11-25 15:40:31,831 INFO L226 Difference]: Without dead ends: 2912 [2022-11-25 15:40:31,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 160 SyntacticMatches, 89 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=125, Invalid=786, Unknown=27, NotChecked=118, Total=1056 [2022-11-25 15:40:31,832 INFO L413 NwaCegarLoop]: 790 mSDtfsCounter, 1995 mSDsluCounter, 6207 mSDsCounter, 0 mSdLazyCounter, 11432 mSolverCounterSat, 29 mSolverCounterUnsat, 792 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2000 SdHoareTripleChecker+Valid, 6997 SdHoareTripleChecker+Invalid, 12253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 11432 IncrementalHoareTripleChecker+Invalid, 792 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.2s IncrementalHoareTripleChecker+Time [2022-11-25 15:40:31,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2000 Valid, 6997 Invalid, 12253 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 11432 Invalid, 792 Unknown, 0 Unchecked, 28.2s Time] [2022-11-25 15:40:31,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2912 states. [2022-11-25 15:40:31,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2912 to 1792. [2022-11-25 15:40:31,856 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-11-25 15:40:31,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2447 transitions. [2022-11-25 15:40:31,860 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2447 transitions. Word has length 132 [2022-11-25 15:40:31,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:40:31,860 INFO L495 AbstractCegarLoop]: Abstraction has 1792 states and 2447 transitions. [2022-11-25 15:40:31,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.647058823529411) internal successors, (147), 16 states have internal predecessors, (147), 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-11-25 15:40:31,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2447 transitions. [2022-11-25 15:40:31,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-25 15:40:31,862 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:40:31,862 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-11-25 15:40:31,887 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-25 15:40:32,118 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2022-11-25 15:40:32,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt [2022-11-25 15:40:32,275 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-11-25 15:40:32,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:32,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1934250012, now seen corresponding path program 1 times [2022-11-25 15:40:32,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:40:32,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270014539] [2022-11-25 15:40:32,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:32,277 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-11-25 15:40:32,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:40:32,279 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:40:32,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:40:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:33,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-25 15:40:33,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:40:33,388 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-11-25 15:40:33,609 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 15:40:33,609 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-11-25 15:40:33,646 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-11-25 15:40:33,789 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-11-25 15:40:36,564 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:40:36,565 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-11-25 15:40:36,725 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:40:36,726 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-11-25 15:40:36,750 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-11-25 15:40:36,808 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-25 15:40:36,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:40:36,902 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4724 (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_4724) |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-11-25 15:40:36,914 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-11-25 15:40:37,286 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-11-25 15:40:37,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:40:37,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270014539] [2022-11-25 15:40:37,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270014539] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:40:37,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1420153009] [2022-11-25 15:40:37,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:37,292 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 15:40:37,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 15:40:37,293 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 15:40:37,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-11-25 15:40:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:42,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-25 15:40:42,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:40:42,617 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-11-25 15:40:42,838 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 15:40:42,838 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-11-25 15:40:42,859 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-11-25 15:40:42,928 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-11-25 15:40:45,572 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:40:45,572 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-11-25 15:40:45,678 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:40:45,679 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-11-25 15:40:45,706 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-11-25 15:40:45,717 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-25 15:40:45,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:40:45,738 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-11-25 15:40:45,750 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-11-25 15:40:46,130 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-11-25 15:40:46,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1420153009] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:40:46,134 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:40:46,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2022-11-25 15:40:46,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238848672] [2022-11-25 15:40:46,134 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:40:46,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 15:40:46,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:40:46,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 15:40:46,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=221, Unknown=20, NotChecked=210, Total=506 [2022-11-25 15:40:46,135 INFO L87 Difference]: Start difference. First operand 1792 states and 2447 transitions. Second operand has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 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-11-25 15:41:02,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:41:02,475 INFO L93 Difference]: Finished difference Result 2264 states and 3047 transitions. [2022-11-25 15:41:02,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 15:41:02,475 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 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 135 [2022-11-25 15:41:02,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:41:02,481 INFO L225 Difference]: With dead ends: 2264 [2022-11-25 15:41:02,481 INFO L226 Difference]: Without dead ends: 2264 [2022-11-25 15:41:02,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 173 SyntacticMatches, 89 SemanticMatches, 32 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=133, Invalid=615, Unknown=32, NotChecked=342, Total=1122 [2022-11-25 15:41:02,482 INFO L413 NwaCegarLoop]: 500 mSDtfsCounter, 1660 mSDsluCounter, 3811 mSDsCounter, 0 mSdLazyCounter, 4669 mSolverCounterSat, 31 mSolverCounterUnsat, 819 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1663 SdHoareTripleChecker+Valid, 4311 SdHoareTripleChecker+Invalid, 5519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 4669 IncrementalHoareTripleChecker+Invalid, 819 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time [2022-11-25 15:41:02,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1663 Valid, 4311 Invalid, 5519 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [31 Valid, 4669 Invalid, 819 Unknown, 0 Unchecked, 15.7s Time] [2022-11-25 15:41:02,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2022-11-25 15:41:02,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 1791. [2022-11-25 15:41:02,507 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-11-25 15:41:02,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2445 transitions. [2022-11-25 15:41:02,510 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2445 transitions. Word has length 135 [2022-11-25 15:41:02,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:41:02,511 INFO L495 AbstractCegarLoop]: Abstraction has 1791 states and 2445 transitions. [2022-11-25 15:41:02,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 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-11-25 15:41:02,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2445 transitions. [2022-11-25 15:41:02,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-25 15:41:02,513 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:41:02,513 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-11-25 15:41:02,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2022-11-25 15:41:02,758 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-25 15:41:02,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:41:02,931 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-11-25 15:41:02,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:41:02,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1934250013, now seen corresponding path program 1 times [2022-11-25 15:41:02,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:41:02,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [903467257] [2022-11-25 15:41:02,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:41:02,932 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-11-25 15:41:02,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:41:02,934 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:41:02,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:41:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:04,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 123 conjunts are in the unsatisfiable core [2022-11-25 15:41:04,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:41:04,187 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-11-25 15:41:04,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 5 [2022-11-25 15:41:04,621 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 15:41:04,621 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-11-25 15:41:04,669 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-11-25 15:41:04,685 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-11-25 15:41:04,852 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-11-25 15:41:04,857 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-11-25 15:41:07,581 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-11-25 15:41:07,642 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:41:07,642 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-11-25 15:41:07,649 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-11-25 15:41:07,826 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:41:07,826 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-11-25 15:41:07,838 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-11-25 15:41:07,882 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-11-25 15:41:07,894 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-11-25 15:41:07,945 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-25 15:41:07,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:41:08,225 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-11-25 15:41:08,279 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-11-25 15:41:09,423 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-11-25 15:41:09,435 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:41:09,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [903467257] [2022-11-25 15:41:09,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [903467257] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:41:09,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [365419323] [2022-11-25 15:41:09,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:41:09,436 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 15:41:09,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 15:41:09,440 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 15:41:09,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2022-11-25 15:41:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:14,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 87 conjunts are in the unsatisfiable core [2022-11-25 15:41:14,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:41:14,534 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-11-25 15:41:14,540 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-11-25 15:41:15,407 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 15:41:15,408 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-11-25 15:41:15,416 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-11-25 15:41:15,520 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-11-25 15:41:15,535 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-11-25 15:41:15,670 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-11-25 15:41:15,771 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-11-25 15:41:20,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:41:20,852 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-11-25 15:41:21,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:41:21,184 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-11-25 15:41:21,207 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-11-25 15:41:21,207 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-11-25 15:41:21,401 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-11-25 15:41:21,405 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-11-25 15:41:21,538 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-25 15:41:21,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:41:22,068 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-11-25 15:41:27,267 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-11-25 15:41:27,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [365419323] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:41:27,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:41:27,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 31 [2022-11-25 15:41:27,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259059899] [2022-11-25 15:41:27,294 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:41:27,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-25 15:41:27,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:41:27,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-25 15:41:27,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1062, Unknown=34, NotChecked=350, Total=1560 [2022-11-25 15:41:27,296 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-11-25 15:42:17,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:42:17,909 INFO L93 Difference]: Finished difference Result 2444 states and 3327 transitions. [2022-11-25 15:42:17,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 15:42:17,910 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-11-25 15:42:17,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:42:17,913 INFO L225 Difference]: With dead ends: 2444 [2022-11-25 15:42:17,913 INFO L226 Difference]: Without dead ends: 2444 [2022-11-25 15:42:17,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 160 SyntacticMatches, 86 SemanticMatches, 47 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1120 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=206, Invalid=1661, Unknown=45, NotChecked=440, Total=2352 [2022-11-25 15:42:17,915 INFO L413 NwaCegarLoop]: 1027 mSDtfsCounter, 1812 mSDsluCounter, 9983 mSDsCounter, 0 mSdLazyCounter, 14694 mSolverCounterSat, 43 mSolverCounterUnsat, 457 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1815 SdHoareTripleChecker+Valid, 11010 SdHoareTripleChecker+Invalid, 16663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 14694 IncrementalHoareTripleChecker+Invalid, 457 IncrementalHoareTripleChecker+Unknown, 1469 IncrementalHoareTripleChecker+Unchecked, 49.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:42:17,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1815 Valid, 11010 Invalid, 16663 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [43 Valid, 14694 Invalid, 457 Unknown, 1469 Unchecked, 49.0s Time] [2022-11-25 15:42:17,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2444 states. [2022-11-25 15:42:17,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2444 to 1790. [2022-11-25 15:42:17,938 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-11-25 15:42:17,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1790 states to 1790 states and 2443 transitions. [2022-11-25 15:42:17,942 INFO L78 Accepts]: Start accepts. Automaton has 1790 states and 2443 transitions. Word has length 135 [2022-11-25 15:42:17,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:42:17,943 INFO L495 AbstractCegarLoop]: Abstraction has 1790 states and 2443 transitions. [2022-11-25 15:42:17,943 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-11-25 15:42:17,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 2443 transitions. [2022-11-25 15:42:17,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-25 15:42:17,944 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:42:17,945 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-11-25 15:42:17,969 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (34)] Forceful destruction successful, exit code 0 [2022-11-25 15:42:18,187 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-25 15:42:18,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:42:18,364 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-11-25 15:42:18,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:42:18,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1961199032, now seen corresponding path program 1 times [2022-11-25 15:42:18,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:42:18,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1801121681] [2022-11-25 15:42:18,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:42:18,365 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-11-25 15:42:18,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:42:18,367 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:42:18,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:42:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:19,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-25 15:42:19,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:42:19,577 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-11-25 15:42:19,848 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 15:42:19,849 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-11-25 15:42:19,910 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-11-25 15:42:20,068 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-11-25 15:42:23,405 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:42:23,405 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-11-25 15:42:23,592 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:42:23,592 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-11-25 15:42:23,737 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:42:23,738 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-11-25 15:42:23,767 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-11-25 15:42:23,840 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-25 15:42:23,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:42:23,965 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-11-25 15:42:26,098 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-11-25 15:42:26,115 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-11-25 15:42:26,571 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-11-25 15:42:26,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:42:26,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1801121681] [2022-11-25 15:42:26,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1801121681] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:42:26,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [86249978] [2022-11-25 15:42:26,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:42:26,575 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 15:42:26,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 15:42:26,576 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 15:42:26,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2022-11-25 15:42:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:32,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-25 15:42:32,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:42:32,548 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-11-25 15:42:32,787 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 15:42:32,788 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-11-25 15:42:32,806 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-11-25 15:42:32,886 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-11-25 15:42:35,992 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:42:35,992 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-11-25 15:42:36,095 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:42:36,096 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-11-25 15:42:36,166 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:42:36,166 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-11-25 15:42:36,204 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-11-25 15:42:36,217 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-25 15:42:36,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:42:36,242 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-11-25 15:42:36,256 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-11-25 15:42:36,432 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-11-25 15:42:36,864 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-11-25 15:42:36,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [86249978] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:42:36,869 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:42:36,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2022-11-25 15:42:36,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699072647] [2022-11-25 15:42:36,869 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:42:36,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-25 15:42:36,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:42:36,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 15:42:36,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=308, Unknown=31, NotChecked=344, Total=756 [2022-11-25 15:42:36,871 INFO L87 Difference]: Start difference. First operand 1790 states and 2443 transitions. Second operand has 16 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 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-11-25 15:42:59,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:42:59,548 INFO L93 Difference]: Finished difference Result 2262 states and 3043 transitions. [2022-11-25 15:42:59,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 15:42:59,548 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 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 138 [2022-11-25 15:42:59,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:42:59,552 INFO L225 Difference]: With dead ends: 2262 [2022-11-25 15:42:59,552 INFO L226 Difference]: Without dead ends: 2262 [2022-11-25 15:42:59,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 180 SyntacticMatches, 89 SemanticMatches, 38 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=167, Invalid=813, Unknown=44, NotChecked=536, Total=1560 [2022-11-25 15:42:59,553 INFO L413 NwaCegarLoop]: 499 mSDtfsCounter, 1655 mSDsluCounter, 4660 mSDsCounter, 0 mSdLazyCounter, 5548 mSolverCounterSat, 33 mSolverCounterUnsat, 833 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1658 SdHoareTripleChecker+Valid, 5159 SdHoareTripleChecker+Invalid, 6414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 5548 IncrementalHoareTripleChecker+Invalid, 833 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.8s IncrementalHoareTripleChecker+Time [2022-11-25 15:42:59,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1658 Valid, 5159 Invalid, 6414 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [33 Valid, 5548 Invalid, 833 Unknown, 0 Unchecked, 21.8s Time] [2022-11-25 15:42:59,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2262 states. [2022-11-25 15:42:59,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2262 to 1789. [2022-11-25 15:42:59,575 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-11-25 15:42:59,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 2441 transitions. [2022-11-25 15:42:59,579 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 2441 transitions. Word has length 138 [2022-11-25 15:42:59,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:42:59,579 INFO L495 AbstractCegarLoop]: Abstraction has 1789 states and 2441 transitions. [2022-11-25 15:42:59,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 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-11-25 15:42:59,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2441 transitions. [2022-11-25 15:42:59,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-25 15:42:59,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:42:59,582 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-11-25 15:42:59,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (36)] Forceful destruction successful, exit code 0 [2022-11-25 15:42:59,811 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-25 15:42:59,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:42:59,995 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-11-25 15:42:59,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:42:59,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1961199033, now seen corresponding path program 1 times [2022-11-25 15:42:59,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:42:59,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176230737] [2022-11-25 15:42:59,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:42:59,997 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-11-25 15:42:59,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:42:59,998 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:42:59,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:43:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:01,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 126 conjunts are in the unsatisfiable core [2022-11-25 15:43:01,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:43:01,319 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-11-25 15:43:01,808 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-11-25 15:43:01,871 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 15:43:01,872 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-11-25 15:43:01,929 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-11-25 15:43:01,938 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-11-25 15:43:02,141 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-11-25 15:43:02,148 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-11-25 15:43:05,151 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_94 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_94) (_ bv44 32))) (exists ((v_ArrVal_7830 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_7830) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_7831)))) is different from true [2022-11-25 15:43:05,216 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:43:05,216 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-11-25 15:43:05,231 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-11-25 15:43:05,433 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:43:05,433 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-11-25 15:43:05,444 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-11-25 15:43:05,603 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:43:05,603 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-11-25 15:43:05,613 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-11-25 15:43:05,652 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-11-25 15:43:05,656 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-11-25 15:43:05,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-11-25 15:43:05,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:43:06,002 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-11-25 15:43:06,038 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-11-25 15:43:06,110 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-11-25 15:43:06,371 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_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 (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7833) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7832) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (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))) (v_ArrVal_7833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7832 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7832))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7833) .cse3 v_ArrVal_7834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7835) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2022-11-25 15:43:08,126 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-11-25 15:43:08,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:43:08,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176230737] [2022-11-25 15:43:08,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176230737] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:43:08,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1537366656] [2022-11-25 15:43:08,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:43:08,143 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 15:43:08,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 15:43:08,144 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 15:43:08,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2022-11-25 15:45:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:01,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 125 conjunts are in the unsatisfiable core [2022-11-25 15:45:01,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:45:01,517 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-11-25 15:45:02,011 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-11-25 15:45:02,065 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 15:45:02,065 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-11-25 15:45:02,194 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-11-25 15:45:02,209 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-11-25 15:45:02,630 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-11-25 15:45:02,637 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-11-25 15:45:06,711 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_94 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_94) (_ bv44 32))) (exists ((v_ArrVal_8426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_8426))) (exists ((v_ArrVal_8427 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_8427) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 15:45:06,803 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:45:06,804 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-11-25 15:45:06,825 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-11-25 15:45:07,172 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:45:07,172 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-11-25 15:45:07,193 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-11-25 15:45:07,423 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:45:07,423 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-11-25 15:45:07,432 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-11-25 15:45:07,481 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-11-25 15:45:07,486 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-11-25 15:45:07,499 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-25 15:45:07,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:45:07,589 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-11-25 15:45:07,635 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-11-25 15:45:07,798 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-11-25 15:45:07,928 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-11-25 15:45:09,653 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-11-25 15:45:09,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1537366656] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:45:09,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:45:09,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2022-11-25 15:45:09,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313082621] [2022-11-25 15:45:09,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:45:09,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-25 15:45:09,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:45:09,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-25 15:45:09,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=537, Unknown=13, NotChecked=684, Total=1332 [2022-11-25 15:45:09,670 INFO L87 Difference]: Start difference. First operand 1789 states and 2441 transitions. Second operand has 25 states, 22 states have (on average 7.409090909090909) internal successors, (163), 21 states have internal predecessors, (163), 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-11-25 15:45:58,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:45:58,226 INFO L93 Difference]: Finished difference Result 2908 states and 3915 transitions. [2022-11-25 15:45:58,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-25 15:45:58,227 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 7.409090909090909) internal successors, (163), 21 states have internal predecessors, (163), 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 138 [2022-11-25 15:45:58,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:45:58,231 INFO L225 Difference]: With dead ends: 2908 [2022-11-25 15:45:58,231 INFO L226 Difference]: Without dead ends: 2908 [2022-11-25 15:45:58,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 172 SyntacticMatches, 89 SemanticMatches, 47 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 867 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=188, Invalid=1177, Unknown=15, NotChecked=972, Total=2352 [2022-11-25 15:45:58,232 INFO L413 NwaCegarLoop]: 789 mSDtfsCounter, 1917 mSDsluCounter, 7122 mSDsCounter, 0 mSdLazyCounter, 12891 mSolverCounterSat, 28 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1922 SdHoareTripleChecker+Valid, 7911 SdHoareTripleChecker+Invalid, 15383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 12891 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 2460 IncrementalHoareTripleChecker+Unchecked, 47.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:45:58,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1922 Valid, 7911 Invalid, 15383 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 12891 Invalid, 4 Unknown, 2460 Unchecked, 47.0s Time] [2022-11-25 15:45:58,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2022-11-25 15:45:58,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1788. [2022-11-25 15:45:58,258 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-11-25 15:45:58,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 2439 transitions. [2022-11-25 15:45:58,262 INFO L78 Accepts]: Start accepts. Automaton has 1788 states and 2439 transitions. Word has length 138 [2022-11-25 15:45:58,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:45:58,262 INFO L495 AbstractCegarLoop]: Abstraction has 1788 states and 2439 transitions. [2022-11-25 15:45:58,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 7.409090909090909) internal successors, (163), 21 states have internal predecessors, (163), 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-11-25 15:45:58,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 2439 transitions. [2022-11-25 15:45:58,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-25 15:45:58,264 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:45:58,264 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-11-25 15:45:58,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-25 15:45:58,540 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2022-11-25 15:45:58,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt [2022-11-25 15:45:58,687 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-11-25 15:45:58,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:58,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1640576451, now seen corresponding path program 1 times [2022-11-25 15:45:58,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:45:58,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2123498641] [2022-11-25 15:45:58,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:58,689 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-11-25 15:45:58,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:45:58,691 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:45:58,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:46:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:00,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-25 15:46:00,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:46:00,118 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-11-25 15:46:00,568 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 15:46:00,569 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-11-25 15:46:00,636 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-11-25 15:46:00,874 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-11-25 15:46:05,177 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:46:05,178 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-11-25 15:46:05,442 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:46:05,443 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-11-25 15:46:05,652 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:46:05,653 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-11-25 15:46:05,866 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:46:05,866 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-11-25 15:46:05,906 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-11-25 15:46:06,016 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-25 15:46:06,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:46:06,201 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8995 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_8995) |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-11-25 15:46:08,396 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-11-25 15:46:08,420 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-11-25 15:46:08,456 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-11-25 15:46:08,485 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-11-25 15:46:09,048 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-11-25 15:46:09,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:46:09,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2123498641] [2022-11-25 15:46:09,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2123498641] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:46:09,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1368913307] [2022-11-25 15:46:09,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:09,056 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 15:46:09,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 15:46:09,057 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 15:46:09,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2022-11-25 15:46:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:18,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-25 15:46:18,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:46:18,750 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-11-25 15:46:19,139 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 15:46:19,140 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-11-25 15:46:19,169 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-11-25 15:46:19,296 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-11-25 15:46:23,589 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:46:23,589 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-11-25 15:46:23,759 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:46:23,759 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-11-25 15:46:23,861 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:46:23,862 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-11-25 15:46:23,965 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:46:23,966 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-11-25 15:46:24,012 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-11-25 15:46:24,030 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-25 15:46:24,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:46:26,226 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-11-25 15:46:26,256 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-11-25 15:46:26,279 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-11-25 15:46:26,322 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-11-25 15:46:26,356 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-11-25 15:46:26,910 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-11-25 15:46:26,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1368913307] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:46:26,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:46:26,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2022-11-25 15:46:26,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756766428] [2022-11-25 15:46:26,917 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:46:26,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-25 15:46:26,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:46:26,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 15:46:26,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=347, Unknown=34, NotChecked=588, Total=1056 [2022-11-25 15:46:26,918 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-11-25 15:46:53,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:46:53,602 INFO L93 Difference]: Finished difference Result 2260 states and 3039 transitions. [2022-11-25 15:46:53,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 15:46:53,603 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-11-25 15:46:53,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:46:53,606 INFO L225 Difference]: With dead ends: 2260 [2022-11-25 15:46:53,607 INFO L226 Difference]: Without dead ends: 2260 [2022-11-25 15:46:53,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 187 SyntacticMatches, 89 SemanticMatches, 44 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 796 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=191, Invalid=931, Unknown=48, NotChecked=900, Total=2070 [2022-11-25 15:46:53,608 INFO L413 NwaCegarLoop]: 498 mSDtfsCounter, 1648 mSDsluCounter, 4200 mSDsCounter, 0 mSdLazyCounter, 5046 mSolverCounterSat, 34 mSolverCounterUnsat, 827 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1651 SdHoareTripleChecker+Valid, 4698 SdHoareTripleChecker+Invalid, 5907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 5046 IncrementalHoareTripleChecker+Invalid, 827 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.4s IncrementalHoareTripleChecker+Time [2022-11-25 15:46:53,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1651 Valid, 4698 Invalid, 5907 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [34 Valid, 5046 Invalid, 827 Unknown, 0 Unchecked, 25.4s Time] [2022-11-25 15:46:53,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2260 states. [2022-11-25 15:46:53,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2260 to 1787. [2022-11-25 15:46:53,630 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-11-25 15:46:53,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1787 states and 2437 transitions. [2022-11-25 15:46:53,632 INFO L78 Accepts]: Start accepts. Automaton has 1787 states and 2437 transitions. Word has length 141 [2022-11-25 15:46:53,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:46:53,633 INFO L495 AbstractCegarLoop]: Abstraction has 1787 states and 2437 transitions. [2022-11-25 15:46:53,633 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-11-25 15:46:53,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2437 transitions. [2022-11-25 15:46:53,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-25 15:46:53,634 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:46:53,634 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-11-25 15:46:53,655 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:46:53,853 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (40)] Forceful destruction successful, exit code 0 [2022-11-25 15:46:54,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt [2022-11-25 15:46:54,035 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-11-25 15:46:54,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:46:54,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1640576452, now seen corresponding path program 1 times [2022-11-25 15:46:54,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:46:54,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967491267] [2022-11-25 15:46:54,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:54,037 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-11-25 15:46:54,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:46:54,038 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:46:54,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/mathsat -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-11-25 15:46:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:55,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 127 conjunts are in the unsatisfiable core [2022-11-25 15:46:55,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:46:55,620 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-11-25 15:46:55,996 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-11-25 15:46:56,091 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 15:46:56,091 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-11-25 15:46:56,159 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-11-25 15:46:56,180 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-11-25 15:46:56,423 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-11-25 15:46:56,431 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-11-25 15:47:00,726 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-11-25 15:47:00,818 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:47:00,818 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-11-25 15:47:00,840 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-11-25 15:47:01,098 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:47:01,099 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-11-25 15:47:01,127 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-11-25 15:47:01,333 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:47:01,334 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-11-25 15:47:01,349 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-11-25 15:47:01,569 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:47:01,569 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-11-25 15:47:01,591 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-11-25 15:47:01,627 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-11-25 15:47:01,635 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-11-25 15:47:01,730 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-25 15:47:01,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:47:02,102 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-11-25 15:47:02,170 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-11-25 15:47:02,347 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-11-25 15:47:02,479 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-11-25 15:47:03,311 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-11-25 15:47:04,805 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-11-25 15:47:07,195 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-11-25 15:47:07,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:47:07,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967491267] [2022-11-25 15:47:07,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1967491267] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:47:07,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1303474341] [2022-11-25 15:47:07,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:07,222 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 15:47:07,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 15:47:07,223 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 15:47:07,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_110825ad-96be-4b1a-89e2-5de8b04f82e4/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (42)] Waiting until timeout for monitored process