./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/verifythis/tree_del_iter.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/verifythis/tree_del_iter.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cce1bb7a06b9dd56fbf663e182ffe801720ee05ee19a126a08070f1616bc4afe --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 19:09:02,925 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 19:09:02,928 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 19:09:02,950 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 19:09:02,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 19:09:02,952 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 19:09:02,954 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 19:09:02,957 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 19:09:02,959 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 19:09:02,960 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 19:09:02,962 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 19:09:02,963 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 19:09:02,964 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 19:09:02,966 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 19:09:02,967 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 19:09:02,969 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 19:09:02,970 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 19:09:02,971 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 19:09:02,973 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 19:09:02,976 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 19:09:02,978 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 19:09:02,979 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 19:09:02,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 19:09:02,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 19:09:02,982 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 19:09:02,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 19:09:02,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 19:09:02,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 19:09:02,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 19:09:02,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 19:09:02,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 19:09:02,984 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 19:09:02,985 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 19:09:02,985 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 19:09:02,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 19:09:02,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 19:09:02,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 19:09:02,986 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 19:09:02,986 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 19:09:02,987 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 19:09:02,987 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 19:09:02,988 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-12-13 19:09:03,013 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 19:09:03,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 19:09:03,013 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 19:09:03,014 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 19:09:03,014 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 19:09:03,014 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 19:09:03,015 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 19:09:03,015 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 19:09:03,015 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 19:09:03,015 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 19:09:03,021 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 19:09:03,021 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 19:09:03,021 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 19:09:03,021 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 19:09:03,021 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 19:09:03,021 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 19:09:03,021 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 19:09:03,021 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 19:09:03,022 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 19:09:03,022 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 19:09:03,022 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 19:09:03,022 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 19:09:03,022 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 19:09:03,022 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 19:09:03,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:09:03,022 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 19:09:03,022 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 19:09:03,022 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 19:09:03,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 19:09:03,023 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 19:09:03,023 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 19:09:03,023 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 19:09:03,023 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 19:09:03,023 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_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) 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 -> cce1bb7a06b9dd56fbf663e182ffe801720ee05ee19a126a08070f1616bc4afe [2022-12-13 19:09:03,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 19:09:03,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 19:09:03,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 19:09:03,232 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 19:09:03,232 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 19:09:03,233 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/verifythis/tree_del_iter.c [2022-12-13 19:09:05,875 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 19:09:06,043 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 19:09:06,044 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/sv-benchmarks/c/verifythis/tree_del_iter.c [2022-12-13 19:09:06,050 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/data/acefb3ee5/4694f7ad96614eb89e4791013531690a/FLAGe17b713ec [2022-12-13 19:09:06,065 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/data/acefb3ee5/4694f7ad96614eb89e4791013531690a [2022-12-13 19:09:06,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 19:09:06,069 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 19:09:06,070 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 19:09:06,070 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 19:09:06,075 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 19:09:06,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:09:06" (1/1) ... [2022-12-13 19:09:06,077 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33457422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:09:06, skipping insertion in model container [2022-12-13 19:09:06,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:09:06" (1/1) ... [2022-12-13 19:09:06,083 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 19:09:06,095 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 19:09:06,195 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_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/sv-benchmarks/c/verifythis/tree_del_iter.c[586,599] [2022-12-13 19:09:06,209 WARN L1576 CHandler]: Possible shadowing of function min [2022-12-13 19:09:06,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:09:06,229 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-12-13 19:09:06,229 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5a78b5ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:09:06, skipping insertion in model container [2022-12-13 19:09:06,229 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 19:09:06,229 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-12-13 19:09:06,231 INFO L158 Benchmark]: Toolchain (without parser) took 161.58ms. Allocated memory is still 148.9MB. Free memory was 115.8MB in the beginning and 105.9MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 19:09:06,231 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 148.9MB. Free memory is still 114.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 19:09:06,231 INFO L158 Benchmark]: CACSL2BoogieTranslator took 159.41ms. Allocated memory is still 148.9MB. Free memory was 115.3MB in the beginning and 105.9MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-13 19:09:06,232 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 148.9MB. Free memory is still 114.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 159.41ms. Allocated memory is still 148.9MB. Free memory was 115.3MB in the beginning and 105.9MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 28]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/verifythis/tree_del_iter.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cce1bb7a06b9dd56fbf663e182ffe801720ee05ee19a126a08070f1616bc4afe --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 19:09:07,672 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 19:09:07,674 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 19:09:07,688 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 19:09:07,689 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 19:09:07,690 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 19:09:07,691 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 19:09:07,692 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 19:09:07,693 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 19:09:07,694 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 19:09:07,695 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 19:09:07,696 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 19:09:07,696 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 19:09:07,697 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 19:09:07,697 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 19:09:07,698 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 19:09:07,699 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 19:09:07,700 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 19:09:07,701 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 19:09:07,702 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 19:09:07,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 19:09:07,705 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 19:09:07,706 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 19:09:07,707 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 19:09:07,711 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 19:09:07,711 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 19:09:07,712 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 19:09:07,713 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 19:09:07,713 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 19:09:07,714 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 19:09:07,715 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 19:09:07,715 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 19:09:07,716 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 19:09:07,717 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 19:09:07,718 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 19:09:07,718 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 19:09:07,719 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 19:09:07,719 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 19:09:07,719 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 19:09:07,720 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 19:09:07,721 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 19:09:07,721 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2022-12-13 19:09:07,743 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 19:09:07,743 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 19:09:07,744 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 19:09:07,744 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 19:09:07,744 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 19:09:07,744 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 19:09:07,745 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 19:09:07,745 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 19:09:07,745 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 19:09:07,745 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 19:09:07,745 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 19:09:07,746 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 19:09:07,746 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 19:09:07,746 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 19:09:07,746 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 19:09:07,746 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 19:09:07,746 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 19:09:07,747 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 19:09:07,747 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 19:09:07,747 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 19:09:07,747 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 19:09:07,747 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 19:09:07,747 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 19:09:07,748 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 19:09:07,748 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 19:09:07,748 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 19:09:07,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:09:07,748 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 19:09:07,749 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 19:09:07,749 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 19:09:07,749 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 19:09:07,749 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 19:09:07,749 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 19:09:07,749 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 19:09:07,749 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 19:09:07,750 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 19:09:07,750 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_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) 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 -> cce1bb7a06b9dd56fbf663e182ffe801720ee05ee19a126a08070f1616bc4afe [2022-12-13 19:09:07,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 19:09:08,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 19:09:08,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 19:09:08,016 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 19:09:08,017 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 19:09:08,017 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/verifythis/tree_del_iter.c [2022-12-13 19:09:10,592 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 19:09:10,759 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 19:09:10,759 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/sv-benchmarks/c/verifythis/tree_del_iter.c [2022-12-13 19:09:10,764 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/data/eefee210f/bd30bed10cf74f1a9255964e084ec9ce/FLAG6b1cdc9b0 [2022-12-13 19:09:10,777 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/data/eefee210f/bd30bed10cf74f1a9255964e084ec9ce [2022-12-13 19:09:10,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 19:09:10,781 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 19:09:10,783 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 19:09:10,783 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 19:09:10,786 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 19:09:10,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:09:10" (1/1) ... [2022-12-13 19:09:10,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4481a620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:09:10, skipping insertion in model container [2022-12-13 19:09:10,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:09:10" (1/1) ... [2022-12-13 19:09:10,795 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 19:09:10,813 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 19:09:10,939 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_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/sv-benchmarks/c/verifythis/tree_del_iter.c[586,599] [2022-12-13 19:09:10,959 WARN L1576 CHandler]: Possible shadowing of function min [2022-12-13 19:09:10,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:09:10,993 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-12-13 19:09:10,997 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 19:09:11,001 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_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/sv-benchmarks/c/verifythis/tree_del_iter.c[586,599] [2022-12-13 19:09:11,011 WARN L1576 CHandler]: Possible shadowing of function min [2022-12-13 19:09:11,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:09:11,028 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 19:09:11,039 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_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/sv-benchmarks/c/verifythis/tree_del_iter.c[586,599] [2022-12-13 19:09:11,047 WARN L1576 CHandler]: Possible shadowing of function min [2022-12-13 19:09:11,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:09:11,071 INFO L208 MainTranslator]: Completed translation [2022-12-13 19:09:11,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:09:11 WrapperNode [2022-12-13 19:09:11,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 19:09:11,073 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 19:09:11,073 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 19:09:11,073 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 19:09:11,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:09:11" (1/1) ... [2022-12-13 19:09:11,092 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:09:11" (1/1) ... [2022-12-13 19:09:11,116 INFO L138 Inliner]: procedures = 31, calls = 64, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 122 [2022-12-13 19:09:11,116 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 19:09:11,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 19:09:11,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 19:09:11,117 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 19:09:11,126 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:09:11" (1/1) ... [2022-12-13 19:09:11,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:09:11" (1/1) ... [2022-12-13 19:09:11,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:09:11" (1/1) ... [2022-12-13 19:09:11,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:09:11" (1/1) ... [2022-12-13 19:09:11,144 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:09:11" (1/1) ... [2022-12-13 19:09:11,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:09:11" (1/1) ... [2022-12-13 19:09:11,150 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:09:11" (1/1) ... [2022-12-13 19:09:11,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:09:11" (1/1) ... [2022-12-13 19:09:11,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 19:09:11,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 19:09:11,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 19:09:11,161 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 19:09:11,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:09:11" (1/1) ... [2022-12-13 19:09:11,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:09:11,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:09:11,193 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 19:09:11,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 19:09:11,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 19:09:11,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 19:09:11,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 19:09:11,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 19:09:11,228 INFO L130 BoogieDeclarations]: Found specification of procedure min [2022-12-13 19:09:11,228 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2022-12-13 19:09:11,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-13 19:09:11,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-12-13 19:09:11,228 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-12-13 19:09:11,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 19:09:11,229 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-12-13 19:09:11,229 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-12-13 19:09:11,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 19:09:11,229 INFO L130 BoogieDeclarations]: Found specification of procedure size [2022-12-13 19:09:11,229 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2022-12-13 19:09:11,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 19:09:11,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 19:09:11,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-13 19:09:11,229 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-13 19:09:11,230 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2022-12-13 19:09:11,230 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2022-12-13 19:09:11,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 19:09:11,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 19:09:11,328 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 19:09:11,329 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 19:09:11,890 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 19:09:11,898 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 19:09:11,899 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 19:09:11,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:09:11 BoogieIcfgContainer [2022-12-13 19:09:11,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 19:09:11,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 19:09:11,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 19:09:11,906 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 19:09:11,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:09:10" (1/3) ... [2022-12-13 19:09:11,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@262d020e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:09:11, skipping insertion in model container [2022-12-13 19:09:11,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:09:11" (2/3) ... [2022-12-13 19:09:11,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@262d020e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:09:11, skipping insertion in model container [2022-12-13 19:09:11,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:09:11" (3/3) ... [2022-12-13 19:09:11,909 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_iter.c [2022-12-13 19:09:11,925 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 19:09:11,926 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2022-12-13 19:09:11,972 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 19:09:11,978 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;@3291c066, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 19:09:11,978 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2022-12-13 19:09:11,982 INFO L276 IsEmpty]: Start isEmpty. Operand has 190 states, 99 states have (on average 1.797979797979798) internal successors, (178), 163 states have internal predecessors, (178), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-12-13 19:09:11,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-13 19:09:11,988 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:09:11,988 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 19:09:11,989 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 19:09:11,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:09:11,993 INFO L85 PathProgramCache]: Analyzing trace with hash 88048840, now seen corresponding path program 1 times [2022-12-13 19:09:12,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:09:12,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561603119] [2022-12-13 19:09:12,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:09:12,005 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:09:12,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:09:12,006 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:09:12,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-13 19:09:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:09:12,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 19:09:12,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:09:12,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 19:09:12,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:09:12,143 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:09:12,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:09:12,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561603119] [2022-12-13 19:09:12,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [561603119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:09:12,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:09:12,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:09:12,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002189654] [2022-12-13 19:09:12,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:09:12,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:09:12,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:09:12,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:09:12,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:09:12,178 INFO L87 Difference]: Start difference. First operand has 190 states, 99 states have (on average 1.797979797979798) internal successors, (178), 163 states have internal predecessors, (178), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:09:12,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:09:12,418 INFO L93 Difference]: Finished difference Result 191 states and 216 transitions. [2022-12-13 19:09:12,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:09:12,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2022-12-13 19:09:12,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:09:12,430 INFO L225 Difference]: With dead ends: 191 [2022-12-13 19:09:12,430 INFO L226 Difference]: Without dead ends: 188 [2022-12-13 19:09:12,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:09:12,435 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 6 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 19:09:12,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 350 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 19:09:12,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-12-13 19:09:12,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2022-12-13 19:09:12,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 97 states have (on average 1.731958762886598) internal successors, (168), 159 states have internal predecessors, (168), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-12-13 19:09:12,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 208 transitions. [2022-12-13 19:09:12,479 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 208 transitions. Word has length 5 [2022-12-13 19:09:12,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:09:12,479 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 208 transitions. [2022-12-13 19:09:12,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:09:12,480 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 208 transitions. [2022-12-13 19:09:12,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-13 19:09:12,480 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:09:12,480 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 19:09:12,488 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-13 19:09:12,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:09:12,683 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 19:09:12,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:09:12,685 INFO L85 PathProgramCache]: Analyzing trace with hash 88048841, now seen corresponding path program 1 times [2022-12-13 19:09:12,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:09:12,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1185760413] [2022-12-13 19:09:12,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:09:12,688 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:09:12,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:09:12,691 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:09:12,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-13 19:09:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:09:12,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 19:09:12,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:09:12,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 19:09:12,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:09:12,887 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:09:12,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:09:12,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1185760413] [2022-12-13 19:09:12,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1185760413] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:09:12,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:09:12,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:09:12,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367663898] [2022-12-13 19:09:12,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:09:12,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:09:12,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:09:12,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:09:12,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:09:12,891 INFO L87 Difference]: Start difference. First operand 186 states and 208 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:09:13,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:09:13,148 INFO L93 Difference]: Finished difference Result 185 states and 207 transitions. [2022-12-13 19:09:13,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:09:13,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2022-12-13 19:09:13,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:09:13,150 INFO L225 Difference]: With dead ends: 185 [2022-12-13 19:09:13,150 INFO L226 Difference]: Without dead ends: 185 [2022-12-13 19:09:13,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:09:13,151 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 2 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 19:09:13,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 353 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 19:09:13,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-12-13 19:09:13,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2022-12-13 19:09:13,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 97 states have (on average 1.7216494845360826) internal successors, (167), 158 states have internal predecessors, (167), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-12-13 19:09:13,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 207 transitions. [2022-12-13 19:09:13,159 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 207 transitions. Word has length 5 [2022-12-13 19:09:13,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:09:13,159 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 207 transitions. [2022-12-13 19:09:13,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:09:13,160 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 207 transitions. [2022-12-13 19:09:13,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-13 19:09:13,160 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:09:13,160 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:09:13,171 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-13 19:09:13,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:09:13,361 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting minErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 19:09:13,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:09:13,362 INFO L85 PathProgramCache]: Analyzing trace with hash -163614216, now seen corresponding path program 1 times [2022-12-13 19:09:13,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:09:13,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2117675222] [2022-12-13 19:09:13,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:09:13,362 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:09:13,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:09:13,363 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:09:13,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-13 19:09:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:09:13,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 19:09:13,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:09:13,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:09:13,479 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:09:13,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:09:13,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2117675222] [2022-12-13 19:09:13,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2117675222] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:09:13,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:09:13,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 19:09:13,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426114377] [2022-12-13 19:09:13,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:09:13,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 19:09:13,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:09:13,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 19:09:13,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 19:09:13,482 INFO L87 Difference]: Start difference. First operand 185 states and 207 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 19:09:13,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:09:13,655 INFO L93 Difference]: Finished difference Result 297 states and 335 transitions. [2022-12-13 19:09:13,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 19:09:13,656 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-12-13 19:09:13,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:09:13,658 INFO L225 Difference]: With dead ends: 297 [2022-12-13 19:09:13,658 INFO L226 Difference]: Without dead ends: 297 [2022-12-13 19:09:13,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 19:09:13,659 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 193 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:09:13,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1221 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:09:13,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-12-13 19:09:13,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 193. [2022-12-13 19:09:13,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 102 states have (on average 1.6862745098039216) internal successors, (172), 164 states have internal predecessors, (172), 21 states have call successors, (21), 7 states have call predecessors, (21), 8 states have return successors, (24), 21 states have call predecessors, (24), 21 states have call successors, (24) [2022-12-13 19:09:13,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 217 transitions. [2022-12-13 19:09:13,674 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 217 transitions. Word has length 11 [2022-12-13 19:09:13,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:09:13,675 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 217 transitions. [2022-12-13 19:09:13,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 19:09:13,675 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 217 transitions. [2022-12-13 19:09:13,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-13 19:09:13,675 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:09:13,675 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:09:13,682 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-12-13 19:09:13,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:09:13,877 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 19:09:13,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:09:13,878 INFO L85 PathProgramCache]: Analyzing trace with hash -916126343, now seen corresponding path program 1 times [2022-12-13 19:09:13,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:09:13,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [484349290] [2022-12-13 19:09:13,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:09:13,879 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:09:13,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:09:13,880 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:09:13,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-12-13 19:09:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:09:13,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 19:09:13,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:09:13,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 19:09:13,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:09:13,993 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:09:13,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:09:13,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [484349290] [2022-12-13 19:09:13,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [484349290] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:09:13,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:09:13,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:09:13,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454401515] [2022-12-13 19:09:13,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:09:13,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:09:13,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:09:13,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:09:13,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:09:13,995 INFO L87 Difference]: Start difference. First operand 193 states and 217 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 19:09:14,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:09:14,417 INFO L93 Difference]: Finished difference Result 197 states and 221 transitions. [2022-12-13 19:09:14,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:09:14,418 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-12-13 19:09:14,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:09:14,419 INFO L225 Difference]: With dead ends: 197 [2022-12-13 19:09:14,419 INFO L226 Difference]: Without dead ends: 197 [2022-12-13 19:09:14,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:09:14,419 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 70 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 19:09:14,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 264 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 19:09:14,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-12-13 19:09:14,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2022-12-13 19:09:14,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 104 states have (on average 1.6923076923076923) internal successors, (176), 164 states have internal predecessors, (176), 21 states have call successors, (21), 7 states have call predecessors, (21), 8 states have return successors, (24), 23 states have call predecessors, (24), 21 states have call successors, (24) [2022-12-13 19:09:14,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 221 transitions. [2022-12-13 19:09:14,427 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 221 transitions. Word has length 11 [2022-12-13 19:09:14,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:09:14,427 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 221 transitions. [2022-12-13 19:09:14,427 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 19:09:14,427 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 221 transitions. [2022-12-13 19:09:14,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-13 19:09:14,427 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:09:14,427 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:09:14,434 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-12-13 19:09:14,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:09:14,630 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting nondet_treeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 19:09:14,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:09:14,632 INFO L85 PathProgramCache]: Analyzing trace with hash -916126342, now seen corresponding path program 1 times [2022-12-13 19:09:14,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:09:14,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [564569316] [2022-12-13 19:09:14,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:09:14,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-12-13 19:09:14,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:09:14,651 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:09:14,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-12-13 19:09:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:09:14,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 19:09:14,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:09:14,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 19:09:14,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:09:14,794 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:09:14,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:09:14,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [564569316] [2022-12-13 19:09:14,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [564569316] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:09:14,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:09:14,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:09:14,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663404613] [2022-12-13 19:09:14,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:09:14,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:09:14,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:09:14,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:09:14,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:09:14,796 INFO L87 Difference]: Start difference. First operand 195 states and 221 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 19:09:15,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:09:15,265 INFO L93 Difference]: Finished difference Result 201 states and 231 transitions. [2022-12-13 19:09:15,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:09:15,266 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-12-13 19:09:15,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:09:15,267 INFO L225 Difference]: With dead ends: 201 [2022-12-13 19:09:15,267 INFO L226 Difference]: Without dead ends: 201 [2022-12-13 19:09:15,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:09:15,268 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 68 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 19:09:15,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 291 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 19:09:15,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-12-13 19:09:15,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2022-12-13 19:09:15,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 106 states have (on average 1.669811320754717) internal successors, (177), 166 states have internal predecessors, (177), 22 states have call successors, (22), 7 states have call predecessors, (22), 8 states have return successors, (26), 24 states have call predecessors, (26), 22 states have call successors, (26) [2022-12-13 19:09:15,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 225 transitions. [2022-12-13 19:09:15,281 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 225 transitions. Word has length 11 [2022-12-13 19:09:15,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:09:15,281 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 225 transitions. [2022-12-13 19:09:15,281 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 19:09:15,281 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 225 transitions. [2022-12-13 19:09:15,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-13 19:09:15,282 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:09:15,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:09:15,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-12-13 19:09:15,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:09:15,484 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting sizeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 19:09:15,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:09:15,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1497511222, now seen corresponding path program 1 times [2022-12-13 19:09:15,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:09:15,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1366795243] [2022-12-13 19:09:15,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:09:15,487 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:09:15,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:09:15,489 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:09:15,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-12-13 19:09:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:09:15,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 19:09:15,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:09:15,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:09:15,638 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:09:15,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:09:15,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1366795243] [2022-12-13 19:09:15,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1366795243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:09:15,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:09:15,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 19:09:15,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963607741] [2022-12-13 19:09:15,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:09:15,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 19:09:15,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:09:15,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 19:09:15,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 19:09:15,640 INFO L87 Difference]: Start difference. First operand 198 states and 225 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 19:09:15,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:09:15,779 INFO L93 Difference]: Finished difference Result 306 states and 347 transitions. [2022-12-13 19:09:15,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 19:09:15,779 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 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 17 [2022-12-13 19:09:15,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:09:15,780 INFO L225 Difference]: With dead ends: 306 [2022-12-13 19:09:15,781 INFO L226 Difference]: Without dead ends: 306 [2022-12-13 19:09:15,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 19:09:15,781 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 192 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:09:15,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 1220 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:09:15,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-12-13 19:09:15,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 244. [2022-12-13 19:09:15,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 145 states have (on average 1.696551724137931) internal successors, (246), 205 states have internal predecessors, (246), 28 states have call successors, (28), 8 states have call predecessors, (28), 9 states have return successors, (32), 30 states have call predecessors, (32), 28 states have call successors, (32) [2022-12-13 19:09:15,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 306 transitions. [2022-12-13 19:09:15,789 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 306 transitions. Word has length 17 [2022-12-13 19:09:15,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:09:15,789 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 306 transitions. [2022-12-13 19:09:15,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 19:09:15,789 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 306 transitions. [2022-12-13 19:09:15,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-13 19:09:15,790 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:09:15,790 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:09:15,800 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-12-13 19:09:15,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:09:15,990 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 19:09:15,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:09:15,991 INFO L85 PathProgramCache]: Analyzing trace with hash -2030552348, now seen corresponding path program 1 times [2022-12-13 19:09:15,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:09:15,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1614579729] [2022-12-13 19:09:15,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:09:15,991 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:09:15,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:09:15,992 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:09:15,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-12-13 19:09:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:09:16,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 19:09:16,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:09:16,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 19:09:16,169 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (exists ((v_ArrVal_109 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_109))))) is different from true [2022-12-13 19:09:16,203 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_109 (_ BitVec 1))) (and (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_109)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:09:16,271 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 19:09:16,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-13 19:09:16,278 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 8 not checked. [2022-12-13 19:09:16,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:09:16,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:09:16,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1614579729] [2022-12-13 19:09:16,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1614579729] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:09:16,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [534056153] [2022-12-13 19:09:16,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:09:16,398 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 19:09:16,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 19:09:16,399 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 19:09:16,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-12-13 19:09:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:09:16,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 19:09:16,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:09:16,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 19:09:16,607 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |c_#valid|)) is different from true [2022-12-13 19:09:16,652 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 19:09:16,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-13 19:09:16,660 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 8 not checked. [2022-12-13 19:09:16,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:09:16,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [534056153] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:09:16,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:09:16,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2022-12-13 19:09:16,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383428530] [2022-12-13 19:09:16,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:09:16,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 19:09:16,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:09:16,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 19:09:16,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=15, Unknown=3, NotChecked=24, Total=56 [2022-12-13 19:09:16,755 INFO L87 Difference]: Start difference. First operand 244 states and 306 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 19:09:19,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:09:19,176 INFO L93 Difference]: Finished difference Result 251 states and 316 transitions. [2022-12-13 19:09:19,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 19:09:19,177 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 29 [2022-12-13 19:09:19,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:09:19,179 INFO L225 Difference]: With dead ends: 251 [2022-12-13 19:09:19,179 INFO L226 Difference]: Without dead ends: 251 [2022-12-13 19:09:19,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=18, Invalid=20, Unknown=4, NotChecked=30, Total=72 [2022-12-13 19:09:19,180 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 75 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 644 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 19:09:19,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 263 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 282 Invalid, 0 Unknown, 644 Unchecked, 0.4s Time] [2022-12-13 19:09:19,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-12-13 19:09:19,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 248. [2022-12-13 19:09:19,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 148 states have (on average 1.6891891891891893) internal successors, (250), 208 states have internal predecessors, (250), 28 states have call successors, (28), 8 states have call predecessors, (28), 10 states have return successors, (36), 31 states have call predecessors, (36), 28 states have call successors, (36) [2022-12-13 19:09:19,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 314 transitions. [2022-12-13 19:09:19,187 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 314 transitions. Word has length 29 [2022-12-13 19:09:19,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:09:19,187 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 314 transitions. [2022-12-13 19:09:19,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 19:09:19,187 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 314 transitions. [2022-12-13 19:09:19,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-13 19:09:19,188 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:09:19,188 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:09:19,200 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-12-13 19:09:19,395 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2022-12-13 19:09:19,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt [2022-12-13 19:09:19,591 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting nondet_treeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 19:09:19,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:09:19,592 INFO L85 PathProgramCache]: Analyzing trace with hash 2020472179, now seen corresponding path program 1 times [2022-12-13 19:09:19,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:09:19,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [250527630] [2022-12-13 19:09:19,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:09:19,594 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:09:19,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:09:19,597 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:09:19,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-12-13 19:09:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:09:19,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 19:09:19,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:09:19,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 19:09:19,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 19:09:19,845 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_250 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_250) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:09:19,886 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_250 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_250) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:09:19,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:09:19,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 19:09:19,951 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:09:19,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-13 19:09:19,964 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 8 not checked. [2022-12-13 19:09:19,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:09:20,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:09:20,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [250527630] [2022-12-13 19:09:20,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [250527630] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:09:20,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1373176027] [2022-12-13 19:09:20,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:09:20,165 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 19:09:20,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 19:09:20,165 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 19:09:20,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-12-13 19:09:20,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:09:20,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 19:09:20,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:09:20,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 19:09:20,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 19:09:20,471 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_325 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_325) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:09:20,499 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_325 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_325) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:09:20,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:09:20,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 19:09:20,568 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:09:20,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-13 19:09:20,572 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 8 not checked. [2022-12-13 19:09:20,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:09:20,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1373176027] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:09:20,725 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:09:20,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-12-13 19:09:20,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596468117] [2022-12-13 19:09:20,726 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:09:20,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 19:09:20,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:09:20,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 19:09:20,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=42, Unknown=4, NotChecked=60, Total=132 [2022-12-13 19:09:20,727 INFO L87 Difference]: Start difference. First operand 248 states and 314 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 6 states have call successors, (7) [2022-12-13 19:09:21,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:09:21,541 INFO L93 Difference]: Finished difference Result 255 states and 327 transitions. [2022-12-13 19:09:21,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 19:09:21,542 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 6 states have call successors, (7) Word has length 35 [2022-12-13 19:09:21,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:09:21,543 INFO L225 Difference]: With dead ends: 255 [2022-12-13 19:09:21,543 INFO L226 Difference]: Without dead ends: 255 [2022-12-13 19:09:21,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=52, Unknown=4, NotChecked=68, Total=156 [2022-12-13 19:09:21,544 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 73 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 876 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 19:09:21,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 396 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 502 Invalid, 0 Unknown, 876 Unchecked, 0.7s Time] [2022-12-13 19:09:21,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-12-13 19:09:21,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 251. [2022-12-13 19:09:21,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 150 states have (on average 1.6733333333333333) internal successors, (251), 210 states have internal predecessors, (251), 29 states have call successors, (29), 8 states have call predecessors, (29), 10 states have return successors, (39), 32 states have call predecessors, (39), 29 states have call successors, (39) [2022-12-13 19:09:21,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 319 transitions. [2022-12-13 19:09:21,550 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 319 transitions. Word has length 35 [2022-12-13 19:09:21,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:09:21,550 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 319 transitions. [2022-12-13 19:09:21,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 6 states have call successors, (7) [2022-12-13 19:09:21,550 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 319 transitions. [2022-12-13 19:09:21,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 19:09:21,551 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:09:21,551 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:09:21,564 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-12-13 19:09:21,756 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2022-12-13 19:09:21,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt [2022-12-13 19:09:21,954 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting minErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 19:09:21,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:09:21,955 INFO L85 PathProgramCache]: Analyzing trace with hash -599064084, now seen corresponding path program 1 times [2022-12-13 19:09:21,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:09:21,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [911890074] [2022-12-13 19:09:21,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:09:21,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:09:21,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:09:21,958 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:09:21,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-12-13 19:09:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:09:22,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 19:09:22,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:09:22,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 19:09:22,128 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 19:09:22,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:09:22,262 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 19:09:22,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:09:22,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [911890074] [2022-12-13 19:09:22,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [911890074] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:09:22,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:09:22,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-12-13 19:09:22,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479403809] [2022-12-13 19:09:22,263 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:09:22,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 19:09:22,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:09:22,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 19:09:22,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 19:09:22,264 INFO L87 Difference]: Start difference. First operand 251 states and 319 transitions. Second operand has 10 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 19:09:23,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:09:23,629 INFO L93 Difference]: Finished difference Result 288 states and 341 transitions. [2022-12-13 19:09:23,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 19:09:23,629 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 25 [2022-12-13 19:09:23,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:09:23,630 INFO L225 Difference]: With dead ends: 288 [2022-12-13 19:09:23,630 INFO L226 Difference]: Without dead ends: 288 [2022-12-13 19:09:23,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-12-13 19:09:23,630 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 230 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-13 19:09:23,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 898 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-13 19:09:23,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-12-13 19:09:23,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 260. [2022-12-13 19:09:23,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 160 states have (on average 1.6375) internal successors, (262), 217 states have internal predecessors, (262), 31 states have call successors, (31), 9 states have call predecessors, (31), 11 states have return successors, (41), 33 states have call predecessors, (41), 31 states have call successors, (41) [2022-12-13 19:09:23,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 334 transitions. [2022-12-13 19:09:23,637 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 334 transitions. Word has length 25 [2022-12-13 19:09:23,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:09:23,637 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 334 transitions. [2022-12-13 19:09:23,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 19:09:23,640 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 334 transitions. [2022-12-13 19:09:23,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 19:09:23,641 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:09:23,641 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:09:23,652 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-12-13 19:09:23,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:09:23,843 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting minErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 19:09:23,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:09:23,845 INFO L85 PathProgramCache]: Analyzing trace with hash -599064083, now seen corresponding path program 1 times [2022-12-13 19:09:23,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:09:23,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1046643068] [2022-12-13 19:09:23,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:09:23,847 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:09:23,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:09:23,849 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:09:23,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-12-13 19:09:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:09:23,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 19:09:23,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:09:23,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-12-13 19:09:24,107 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 19:09:24,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:09:25,359 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 19:09:25,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:09:25,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1046643068] [2022-12-13 19:09:25,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1046643068] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:09:25,360 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:09:25,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2022-12-13 19:09:25,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347077851] [2022-12-13 19:09:25,360 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:09:25,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 19:09:25,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:09:25,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 19:09:25,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-12-13 19:09:25,361 INFO L87 Difference]: Start difference. First operand 260 states and 334 transitions. Second operand has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 19:09:28,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:09:28,778 INFO L93 Difference]: Finished difference Result 285 states and 370 transitions. [2022-12-13 19:09:28,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 19:09:28,779 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 25 [2022-12-13 19:09:28,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:09:28,780 INFO L225 Difference]: With dead ends: 285 [2022-12-13 19:09:28,780 INFO L226 Difference]: Without dead ends: 285 [2022-12-13 19:09:28,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2022-12-13 19:09:28,780 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 196 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:09:28,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 884 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1248 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-12-13 19:09:28,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-12-13 19:09:28,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 276. [2022-12-13 19:09:28,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 172 states have (on average 1.6104651162790697) internal successors, (277), 229 states have internal predecessors, (277), 34 states have call successors, (34), 10 states have call predecessors, (34), 12 states have return successors, (44), 36 states have call predecessors, (44), 34 states have call successors, (44) [2022-12-13 19:09:28,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 355 transitions. [2022-12-13 19:09:28,787 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 355 transitions. Word has length 25 [2022-12-13 19:09:28,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:09:28,787 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 355 transitions. [2022-12-13 19:09:28,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 19:09:28,787 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 355 transitions. [2022-12-13 19:09:28,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-13 19:09:28,788 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:09:28,788 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] [2022-12-13 19:09:28,797 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-12-13 19:09:28,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:09:28,989 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting tree_inorderErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 19:09:28,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:09:28,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1805510171, now seen corresponding path program 1 times [2022-12-13 19:09:28,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:09:28,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148965312] [2022-12-13 19:09:28,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:09:28,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:09:28,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:09:28,995 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:09:28,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-12-13 19:09:29,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:09:29,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 19:09:29,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:09:29,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:09:29,113 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:09:29,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:09:29,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148965312] [2022-12-13 19:09:29,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1148965312] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:09:29,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:09:29,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 19:09:29,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781832139] [2022-12-13 19:09:29,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:09:29,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 19:09:29,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:09:29,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 19:09:29,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 19:09:29,115 INFO L87 Difference]: Start difference. First operand 276 states and 355 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 19:09:29,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:09:29,133 INFO L93 Difference]: Finished difference Result 242 states and 287 transitions. [2022-12-13 19:09:29,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 19:09:29,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-12-13 19:09:29,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:09:29,135 INFO L225 Difference]: With dead ends: 242 [2022-12-13 19:09:29,135 INFO L226 Difference]: Without dead ends: 226 [2022-12-13 19:09:29,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 19:09:29,135 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 0 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:09:29,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 800 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:09:29,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-12-13 19:09:29,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2022-12-13 19:09:29,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 130 states have (on average 1.5769230769230769) internal successors, (205), 188 states have internal predecessors, (205), 27 states have call successors, (27), 8 states have call predecessors, (27), 11 states have return successors, (39), 29 states have call predecessors, (39), 27 states have call successors, (39) [2022-12-13 19:09:29,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 271 transitions. [2022-12-13 19:09:29,141 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 271 transitions. Word has length 30 [2022-12-13 19:09:29,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:09:29,141 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 271 transitions. [2022-12-13 19:09:29,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 19:09:29,141 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 271 transitions. [2022-12-13 19:09:29,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-13 19:09:29,142 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:09:29,142 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:09:29,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-12-13 19:09:29,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:09:29,343 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting sizeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 19:09:29,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:09:29,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1626172482, now seen corresponding path program 1 times [2022-12-13 19:09:29,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:09:29,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1917332483] [2022-12-13 19:09:29,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:09:29,346 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:09:29,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:09:29,349 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:09:29,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-12-13 19:09:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:09:29,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 19:09:29,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:09:29,494 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 19:09:29,494 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:09:29,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:09:29,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1917332483] [2022-12-13 19:09:29,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1917332483] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:09:29,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:09:29,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 19:09:29,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323401480] [2022-12-13 19:09:29,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:09:29,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 19:09:29,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:09:29,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 19:09:29,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 19:09:29,495 INFO L87 Difference]: Start difference. First operand 226 states and 271 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 19:09:29,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:09:29,701 INFO L93 Difference]: Finished difference Result 232 states and 280 transitions. [2022-12-13 19:09:29,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 19:09:29,701 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2022-12-13 19:09:29,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:09:29,702 INFO L225 Difference]: With dead ends: 232 [2022-12-13 19:09:29,702 INFO L226 Difference]: Without dead ends: 228 [2022-12-13 19:09:29,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-13 19:09:29,703 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 209 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 19:09:29,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 1036 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 19:09:29,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-12-13 19:09:29,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 226. [2022-12-13 19:09:29,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 130 states have (on average 1.5615384615384615) internal successors, (203), 188 states have internal predecessors, (203), 27 states have call successors, (27), 8 states have call predecessors, (27), 11 states have return successors, (39), 29 states have call predecessors, (39), 27 states have call successors, (39) [2022-12-13 19:09:29,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 269 transitions. [2022-12-13 19:09:29,711 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 269 transitions. Word has length 31 [2022-12-13 19:09:29,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:09:29,711 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 269 transitions. [2022-12-13 19:09:29,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 19:09:29,711 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 269 transitions. [2022-12-13 19:09:29,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-13 19:09:29,712 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:09:29,712 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:09:29,720 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-12-13 19:09:29,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:09:29,913 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting minErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 19:09:29,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:09:29,914 INFO L85 PathProgramCache]: Analyzing trace with hash -575590880, now seen corresponding path program 1 times [2022-12-13 19:09:29,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:09:29,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1572983495] [2022-12-13 19:09:29,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:09:29,917 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:09:29,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:09:29,920 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:09:29,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-12-13 19:09:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:09:30,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-13 19:09:30,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:09:30,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 19:09:30,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 13 treesize of output 9 [2022-12-13 19:09:30,120 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 19:09:30,126 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 23 treesize of output 22 [2022-12-13 19:09:30,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 19:09:30,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 19:09:30,365 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:09:30,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:09:31,146 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:09:31,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:09:31,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1572983495] [2022-12-13 19:09:31,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1572983495] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:09:31,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:09:31,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2022-12-13 19:09:31,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888137840] [2022-12-13 19:09:31,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:09:31,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 19:09:31,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:09:31,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 19:09:31,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2022-12-13 19:09:31,148 INFO L87 Difference]: Start difference. First operand 226 states and 269 transitions. Second operand has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 19:09:33,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:09:33,010 INFO L93 Difference]: Finished difference Result 303 states and 359 transitions. [2022-12-13 19:09:33,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 19:09:33,012 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-12-13 19:09:33,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:09:33,013 INFO L225 Difference]: With dead ends: 303 [2022-12-13 19:09:33,013 INFO L226 Difference]: Without dead ends: 303 [2022-12-13 19:09:33,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2022-12-13 19:09:33,014 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 286 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-13 19:09:33,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 1634 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-12-13 19:09:33,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-12-13 19:09:33,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 230. [2022-12-13 19:09:33,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 133 states have (on average 1.5488721804511278) internal successors, (206), 191 states have internal predecessors, (206), 27 states have call successors, (27), 9 states have call predecessors, (27), 12 states have return successors, (39), 29 states have call predecessors, (39), 27 states have call successors, (39) [2022-12-13 19:09:33,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 272 transitions. [2022-12-13 19:09:33,022 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 272 transitions. Word has length 31 [2022-12-13 19:09:33,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:09:33,022 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 272 transitions. [2022-12-13 19:09:33,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 19:09:33,022 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 272 transitions. [2022-12-13 19:09:33,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-13 19:09:33,022 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:09:33,023 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-12-13 19:09:33,030 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-12-13 19:09:33,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:09:33,223 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting nondet_treeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 19:09:33,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:09:33,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1969763806, now seen corresponding path program 2 times [2022-12-13 19:09:33,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:09:33,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [471396959] [2022-12-13 19:09:33,224 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 19:09:33,224 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:09:33,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:09:33,225 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:09:33,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-12-13 19:09:33,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 19:09:33,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:09:33,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-13 19:09:33,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:09:33,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 19:09:33,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 7 [2022-12-13 19:09:33,447 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_553 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_553) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:09:33,470 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_553 (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_553) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:09:33,485 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) |c_#length|)) is different from true [2022-12-13 19:09:33,521 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_39 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_553 (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_553) v_nondet_tree_~n~0.base_39 (_ bv12 32))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:09:33,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:09:33,570 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-12-13 19:09:33,570 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 2 case distinctions, treesize of input 15 treesize of output 23 [2022-12-13 19:09:33,587 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:09:33,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-13 19:09:33,611 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 30 not checked. [2022-12-13 19:09:33,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:09:35,866 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:09:35,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [471396959] [2022-12-13 19:09:35,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [471396959] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:09:35,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [791665796] [2022-12-13 19:09:35,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 19:09:35,866 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 19:09:35,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 19:09:35,867 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 19:09:35,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2022-12-13 19:09:36,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 19:09:36,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:09:36,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-13 19:09:36,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:09:36,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 19:09:36,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 19:09:36,105 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_636 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_636) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:09:36,127 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_636 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_636) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:09:36,183 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_636 (_ BitVec 32)) (v_nondet_tree_~n~0.base_50 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_636) v_nondet_tree_~n~0.base_50 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:09:36,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:09:36,225 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-12-13 19:09:36,226 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 2 case distinctions, treesize of input 15 treesize of output 23 [2022-12-13 19:09:36,235 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:09:36,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-13 19:09:36,255 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 30 not checked. [2022-12-13 19:09:36,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:09:37,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [791665796] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:09:37,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:09:37,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-12-13 19:09:37,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62272848] [2022-12-13 19:09:37,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:09:37,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 19:09:37,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:09:37,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 19:09:37,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=45, Unknown=7, NotChecked=126, Total=210 [2022-12-13 19:09:37,026 INFO L87 Difference]: Start difference. First operand 230 states and 272 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 7 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-12-13 19:09:45,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:09:45,887 INFO L93 Difference]: Finished difference Result 243 states and 298 transitions. [2022-12-13 19:09:45,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 19:09:45,888 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 7 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 39 [2022-12-13 19:09:45,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:09:45,889 INFO L225 Difference]: With dead ends: 243 [2022-12-13 19:09:45,889 INFO L226 Difference]: Without dead ends: 243 [2022-12-13 19:09:45,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=56, Invalid=92, Unknown=12, NotChecked=182, Total=342 [2022-12-13 19:09:45,890 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 86 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 1993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1595 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 19:09:45,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 338 Invalid, 1993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 368 Invalid, 0 Unknown, 1595 Unchecked, 0.7s Time] [2022-12-13 19:09:45,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-12-13 19:09:45,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 234. [2022-12-13 19:09:45,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 136 states have (on average 1.536764705882353) internal successors, (209), 194 states have internal predecessors, (209), 27 states have call successors, (27), 9 states have call predecessors, (27), 13 states have return successors, (44), 30 states have call predecessors, (44), 27 states have call successors, (44) [2022-12-13 19:09:45,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 280 transitions. [2022-12-13 19:09:45,897 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 280 transitions. Word has length 39 [2022-12-13 19:09:45,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:09:45,897 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 280 transitions. [2022-12-13 19:09:45,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 7 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-12-13 19:09:45,897 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 280 transitions. [2022-12-13 19:09:45,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-13 19:09:45,898 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:09:45,898 INFO L195 NwaCegarLoop]: trace histogram [8, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1] [2022-12-13 19:09:45,921 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-12-13 19:09:46,101 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2022-12-13 19:09:46,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt [2022-12-13 19:09:46,299 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting nondet_treeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 19:09:46,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:09:46,300 INFO L85 PathProgramCache]: Analyzing trace with hash -261369893, now seen corresponding path program 3 times [2022-12-13 19:09:46,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:09:46,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1297180960] [2022-12-13 19:09:46,302 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 19:09:46,302 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:09:46,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:09:46,305 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:09:46,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-12-13 19:09:46,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-13 19:09:46,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:09:46,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 19:09:46,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:09:46,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 19:09:46,692 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) |c_#length|)) is different from true [2022-12-13 19:09:46,772 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_61 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_770 (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_770) v_nondet_tree_~n~0.base_61 (_ bv12 32)) |c_#length|) (bvule (_ bv8 32) (select |c_#length| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:09:46,869 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-13 19:09:46,870 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 2 case distinctions, treesize of input 15 treesize of output 27 [2022-12-13 19:09:46,908 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 91 proven. 3 refuted. 1 times theorem prover too weak. 38 trivial. 26 not checked. [2022-12-13 19:09:46,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:09:47,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:09:47,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1297180960] [2022-12-13 19:09:47,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1297180960] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:09:47,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [328633835] [2022-12-13 19:09:47,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 19:09:47,325 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 19:09:47,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 19:09:47,326 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 19:09:47,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-12-13 19:09:47,764 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-13 19:09:47,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:09:47,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 19:09:47,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:09:47,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 19:09:47,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 19:09:47,992 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_907 (_ BitVec 32)) (v_ArrVal_905 (_ BitVec 32))) (and (= (select (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |c_nondet_tree_#t~ret8.base|) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_905) |c_nondet_tree_#t~ret8.base| v_ArrVal_907)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:09:48,006 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_907 (_ BitVec 32)) (|nondet_tree_#t~ret8.base| (_ BitVec 32)) (v_ArrVal_905 (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |nondet_tree_#t~ret8.base|)) (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_905) |nondet_tree_#t~ret8.base| v_ArrVal_907) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:09:48,043 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_907 (_ BitVec 32)) (v_ArrVal_905 (_ BitVec 32)) (|nondet_tree_#t~ret8.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |nondet_tree_#t~ret8.base|)) (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_905) |nondet_tree_#t~ret8.base| v_ArrVal_907) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:09:48,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:09:48,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:09:48,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:09:48,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-12-13 19:09:48,109 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2022-12-13 19:09:48,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 19:09:48,113 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 91 proven. 22 refuted. 0 times theorem prover too weak. 32 trivial. 14 not checked. [2022-12-13 19:09:48,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:09:48,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [328633835] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:09:48,421 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:09:48,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 16 [2022-12-13 19:09:48,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222601208] [2022-12-13 19:09:48,422 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:09:48,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 19:09:48,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:09:48,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 19:09:48,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=169, Unknown=12, NotChecked=150, Total=380 [2022-12-13 19:09:48,423 INFO L87 Difference]: Start difference. First operand 234 states and 280 transitions. Second operand has 17 states, 16 states have (on average 3.3125) internal successors, (53), 13 states have internal predecessors, (53), 9 states have call successors, (13), 3 states have call predecessors, (13), 6 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-12-13 19:10:02,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:10:02,848 INFO L93 Difference]: Finished difference Result 250 states and 316 transitions. [2022-12-13 19:10:02,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 19:10:02,848 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.3125) internal successors, (53), 13 states have internal predecessors, (53), 9 states have call successors, (13), 3 states have call predecessors, (13), 6 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) Word has length 63 [2022-12-13 19:10:02,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:10:02,850 INFO L225 Difference]: With dead ends: 250 [2022-12-13 19:10:02,850 INFO L226 Difference]: Without dead ends: 250 [2022-12-13 19:10:02,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=107, Invalid=277, Unknown=16, NotChecked=200, Total=600 [2022-12-13 19:10:02,851 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 170 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 79 mSolverCounterUnsat, 30 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 2276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 30 IncrementalHoareTripleChecker+Unknown, 1142 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-12-13 19:10:02,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 629 Invalid, 2276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1025 Invalid, 30 Unknown, 1142 Unchecked, 2.5s Time] [2022-12-13 19:10:02,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-12-13 19:10:02,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 237. [2022-12-13 19:10:02,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 138 states have (on average 1.5289855072463767) internal successors, (211), 196 states have internal predecessors, (211), 28 states have call successors, (28), 9 states have call predecessors, (28), 13 states have return successors, (48), 31 states have call predecessors, (48), 28 states have call successors, (48) [2022-12-13 19:10:02,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 287 transitions. [2022-12-13 19:10:02,857 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 287 transitions. Word has length 63 [2022-12-13 19:10:02,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:10:02,857 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 287 transitions. [2022-12-13 19:10:02,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.3125) internal successors, (53), 13 states have internal predecessors, (53), 9 states have call successors, (13), 3 states have call predecessors, (13), 6 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-12-13 19:10:02,857 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 287 transitions. [2022-12-13 19:10:02,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-13 19:10:02,858 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:10:02,858 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:10:02,867 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-12-13 19:10:03,071 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2022-12-13 19:10:03,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt [2022-12-13 19:10:03,259 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting minErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 19:10:03,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:10:03,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1591520033, now seen corresponding path program 2 times [2022-12-13 19:10:03,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:10:03,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556101740] [2022-12-13 19:10:03,262 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 19:10:03,262 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:10:03,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:10:03,265 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:10:03,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-12-13 19:10:03,383 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 19:10:03,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:10:03,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 19:10:03,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:10:03,544 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-13 19:10:03,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:10:04,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-12-13 19:10:04,235 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-13 19:10:04,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:10:04,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556101740] [2022-12-13 19:10:04,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556101740] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:10:04,236 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:10:04,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2022-12-13 19:10:04,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278406437] [2022-12-13 19:10:04,236 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:10:04,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 19:10:04,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:10:04,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 19:10:04,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2022-12-13 19:10:04,237 INFO L87 Difference]: Start difference. First operand 237 states and 287 transitions. Second operand has 16 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 19:10:06,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:10:06,630 INFO L93 Difference]: Finished difference Result 239 states and 290 transitions. [2022-12-13 19:10:06,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 19:10:06,631 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 39 [2022-12-13 19:10:06,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:10:06,632 INFO L225 Difference]: With dead ends: 239 [2022-12-13 19:10:06,632 INFO L226 Difference]: Without dead ends: 239 [2022-12-13 19:10:06,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2022-12-13 19:10:06,632 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 79 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1627 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:10:06,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1627 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-12-13 19:10:06,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-12-13 19:10:06,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 237. [2022-12-13 19:10:06,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 138 states have (on average 1.5072463768115942) internal successors, (208), 196 states have internal predecessors, (208), 28 states have call successors, (28), 9 states have call predecessors, (28), 13 states have return successors, (48), 31 states have call predecessors, (48), 28 states have call successors, (48) [2022-12-13 19:10:06,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 284 transitions. [2022-12-13 19:10:06,637 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 284 transitions. Word has length 39 [2022-12-13 19:10:06,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:10:06,637 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 284 transitions. [2022-12-13 19:10:06,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 19:10:06,637 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 284 transitions. [2022-12-13 19:10:06,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 19:10:06,638 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:10:06,638 INFO L195 NwaCegarLoop]: trace histogram [7, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2022-12-13 19:10:06,646 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2022-12-13 19:10:06,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:10:06,838 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting nondet_treeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 19:10:06,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:10:06,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1851251085, now seen corresponding path program 4 times [2022-12-13 19:10:06,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:10:06,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282786901] [2022-12-13 19:10:06,839 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 19:10:06,839 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:10:06,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:10:06,840 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:10:06,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-12-13 19:10:07,137 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 19:10:07,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:10:07,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 19:10:07,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:10:07,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 19:10:07,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 19:10:07,201 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1101 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1101) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:10:07,233 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_1101 (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1101) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:10:07,294 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) |c_#length|)) is different from true [2022-12-13 19:10:07,370 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1102 (_ BitVec 32)) (v_nondet_tree_~n~0.base_92 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (bvule (_ bv12 32) (select |c_#length| nondet_tree_~n~0.base)) (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1102) v_nondet_tree_~n~0.base_92 (_ bv12 32)) |c_#length|))) is different from true [2022-12-13 19:10:07,405 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1102 (_ BitVec 32)) (v_nondet_tree_~n~0.base_92 (_ BitVec 32)) (v_nondet_tree_~n~0.base_93 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_1101 (_ BitVec 32))) (and (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_93) (_ bv0 1)) (bvule (_ bv12 32) (select |c_#length| nondet_tree_~n~0.base)) (= (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_93 v_ArrVal_1101) nondet_tree_~n~0.base v_ArrVal_1102) v_nondet_tree_~n~0.base_92 (_ bv12 32)) |c_#length|))) is different from true [2022-12-13 19:10:07,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:10:07,544 INFO L321 Elim1Store]: treesize reduction 59, result has 34.4 percent of original size [2022-12-13 19:10:07,544 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 3 case distinctions, treesize of input 18 treesize of output 39 [2022-12-13 19:10:07,565 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:10:07,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-13 19:10:07,637 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 26 proven. 9 refuted. 1 times theorem prover too weak. 28 trivial. 62 not checked. [2022-12-13 19:10:07,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:10:08,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:10:08,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282786901] [2022-12-13 19:10:08,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [282786901] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:10:08,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [943456852] [2022-12-13 19:10:08,140 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 19:10:08,140 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 19:10:08,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 19:10:08,141 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 19:10:08,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2022-12-13 19:10:08,511 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 19:10:08,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:10:08,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-13 19:10:08,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:10:08,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 19:10:08,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 19:10:08,569 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1238 (_ BitVec 1))) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_1238) |c_#valid|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (exists ((v_ArrVal_1237 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1237))))) is different from true [2022-12-13 19:10:08,611 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1237 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_1238 (_ BitVec 1))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1237)) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_1238) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:10:08,645 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1239 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1239) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:10:08,673 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1239 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1239) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:10:08,742 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1239 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_113 (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1239) v_nondet_tree_~n~0.base_113 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:10:08,784 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1237 (_ BitVec 32)) (v_ArrVal_1239 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_113 (_ BitVec 32)) (v_nondet_tree_~n~0.base_114 (_ BitVec 32)) (v_ArrVal_1238 (_ BitVec 1))) (and (= (store (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1237) v_nondet_tree_~n~0.base_114 v_ArrVal_1239) v_nondet_tree_~n~0.base_113 (_ bv12 32)) |c_#length|) (= (select (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_1238) v_nondet_tree_~n~0.base_114) (_ bv0 1)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:10:08,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:10:08,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:10:08,897 INFO L321 Elim1Store]: treesize reduction 47, result has 36.5 percent of original size [2022-12-13 19:10:08,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 35 [2022-12-13 19:10:08,951 INFO L321 Elim1Store]: treesize reduction 17, result has 45.2 percent of original size [2022-12-13 19:10:08,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 38 [2022-12-13 19:10:09,013 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 26 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 66 not checked. [2022-12-13 19:10:09,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:10:11,288 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) c_nondet_tree_~n~0.offset))) (and (forall ((v_nondet_tree_~n~0.base_132 (_ BitVec 32))) (or (not (= (select |c_#valid| v_nondet_tree_~n~0.base_132) (_ bv0 1))) (forall ((v_ArrVal_1251 (_ BitVec 1)) (v_nondet_tree_~n~0.base_133 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_nondet_tree_~n~0.base_132 v_ArrVal_1251) v_nondet_tree_~n~0.base_133))) (forall ((v_nondet_tree_~n~0.base_131 (_ BitVec 32)) (v_ArrVal_1253 (_ BitVec 32)) (v_ArrVal_1252 (_ BitVec 32))) (bvule .cse0 (select (store (store (store |c_#length| v_nondet_tree_~n~0.base_132 v_ArrVal_1252) v_nondet_tree_~n~0.base_133 v_ArrVal_1253) v_nondet_tree_~n~0.base_131 (_ bv12 32)) c_nondet_tree_~n~0.base))))))) (or (forall ((v_ArrVal_1251 (_ BitVec 1)) (v_nondet_tree_~n~0.base_133 (_ BitVec 32)) (v_nondet_tree_~n~0.base_132 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_nondet_tree_~n~0.base_132 v_ArrVal_1251) v_nondet_tree_~n~0.base_133))) (not (= (select |c_#valid| v_nondet_tree_~n~0.base_132) (_ bv0 1))))) (bvule (bvadd (_ bv4 32) c_nondet_tree_~n~0.offset) .cse0)))) is different from false [2022-12-13 19:10:11,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [943456852] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:10:11,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:10:11,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-12-13 19:10:11,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277070925] [2022-12-13 19:10:11,293 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:10:11,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 19:10:11,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:10:11,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 19:10:11,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=89, Unknown=18, NotChecked=348, Total=506 [2022-12-13 19:10:11,294 INFO L87 Difference]: Start difference. First operand 237 states and 284 transitions. Second operand has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 17 states have internal predecessors, (54), 10 states have call successors, (13), 3 states have call predecessors, (13), 7 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2022-12-13 19:10:38,811 WARN L233 SmtUtils]: Spent 8.13s on a formula simplification. DAG size of input: 45 DAG size of output: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:11:14,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:11:14,161 INFO L93 Difference]: Finished difference Result 265 states and 355 transitions. [2022-12-13 19:11:14,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 19:11:14,162 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 17 states have internal predecessors, (54), 10 states have call successors, (13), 3 states have call predecessors, (13), 7 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) Word has length 57 [2022-12-13 19:11:14,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:11:14,163 INFO L225 Difference]: With dead ends: 265 [2022-12-13 19:11:14,163 INFO L226 Difference]: Without dead ends: 265 [2022-12-13 19:11:14,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 95 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 62.7s TimeCoverageRelationStatistics Valid=139, Invalid=286, Unknown=43, NotChecked=588, Total=1056 [2022-12-13 19:11:14,163 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 170 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 85 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 3477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 2609 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-12-13 19:11:14,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 522 Invalid, 3477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 760 Invalid, 23 Unknown, 2609 Unchecked, 2.5s Time] [2022-12-13 19:11:14,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-12-13 19:11:14,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 252. [2022-12-13 19:11:14,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 149 states have (on average 1.4697986577181208) internal successors, (219), 207 states have internal predecessors, (219), 29 states have call successors, (29), 9 states have call predecessors, (29), 16 states have return successors, (73), 35 states have call predecessors, (73), 29 states have call successors, (73) [2022-12-13 19:11:14,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 321 transitions. [2022-12-13 19:11:14,169 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 321 transitions. Word has length 57 [2022-12-13 19:11:14,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:11:14,169 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 321 transitions. [2022-12-13 19:11:14,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 17 states have internal predecessors, (54), 10 states have call successors, (13), 3 states have call predecessors, (13), 7 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2022-12-13 19:11:14,169 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 321 transitions. [2022-12-13 19:11:14,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-13 19:11:14,170 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:11:14,170 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:11:14,180 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-12-13 19:11:14,383 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2022-12-13 19:11:14,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt [2022-12-13 19:11:14,572 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting minErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 19:11:14,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:11:14,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1971504767, now seen corresponding path program 1 times [2022-12-13 19:11:14,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:11:14,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800254907] [2022-12-13 19:11:14,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:11:14,575 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:11:14,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:11:14,578 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:11:14,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-12-13 19:11:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:11:14,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 19:11:14,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:11:14,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 19:11:14,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 19:11:15,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 19:11:15,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 19:11:15,264 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 19:11:15,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:11:15,536 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 19:11:15,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:11:15,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800254907] [2022-12-13 19:11:15,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [800254907] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:11:15,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:11:15,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 14 [2022-12-13 19:11:15,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952552669] [2022-12-13 19:11:15,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:11:15,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 19:11:15,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:11:15,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 19:11:15,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-12-13 19:11:15,538 INFO L87 Difference]: Start difference. First operand 252 states and 321 transitions. Second operand has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 19:11:17,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:11:19,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:11:22,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:11:24,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:11:26,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:11:28,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:11:30,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:11:32,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:11:35,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:11:38,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:11:38,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:11:38,025 INFO L93 Difference]: Finished difference Result 407 states and 504 transitions. [2022-12-13 19:11:38,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 19:11:38,033 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2022-12-13 19:11:38,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:11:38,035 INFO L225 Difference]: With dead ends: 407 [2022-12-13 19:11:38,035 INFO L226 Difference]: Without dead ends: 407 [2022-12-13 19:11:38,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-12-13 19:11:38,035 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 154 mSDsluCounter, 2229 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 19 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 2432 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.2s IncrementalHoareTripleChecker+Time [2022-12-13 19:11:38,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 2432 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 536 Invalid, 10 Unknown, 0 Unchecked, 22.2s Time] [2022-12-13 19:11:38,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-12-13 19:11:38,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 326. [2022-12-13 19:11:38,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 202 states have (on average 1.4504950495049505) internal successors, (293), 261 states have internal predecessors, (293), 41 states have call successors, (41), 16 states have call predecessors, (41), 25 states have return successors, (96), 48 states have call predecessors, (96), 41 states have call successors, (96) [2022-12-13 19:11:38,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 430 transitions. [2022-12-13 19:11:38,042 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 430 transitions. Word has length 38 [2022-12-13 19:11:38,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:11:38,043 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 430 transitions. [2022-12-13 19:11:38,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 19:11:38,043 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 430 transitions. [2022-12-13 19:11:38,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 19:11:38,043 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:11:38,044 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:11:38,051 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2022-12-13 19:11:38,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:11:38,244 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting minErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 19:11:38,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:11:38,245 INFO L85 PathProgramCache]: Analyzing trace with hash 727982164, now seen corresponding path program 2 times [2022-12-13 19:11:38,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:11:38,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588571041] [2022-12-13 19:11:38,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 19:11:38,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:11:38,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:11:38,247 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:11:38,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-12-13 19:11:38,504 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 19:11:38,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:11:38,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-13 19:11:38,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:11:38,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 19:11:38,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 19:11:38,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 19:11:38,781 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1358 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| nondet_tree_~n~0.base v_ArrVal_1358))) (exists ((v_ArrVal_1359 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| nondet_tree_~n~0.base v_ArrVal_1359) |c_#memory_$Pointer$.base|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:11:38,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:11:38,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 19:11:38,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:11:38,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 19:11:38,827 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:11:38,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-13 19:11:38,873 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 23 treesize of output 22 [2022-12-13 19:11:38,879 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 23 treesize of output 22 [2022-12-13 19:11:39,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 19:11:39,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 19:11:39,235 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 9 not checked. [2022-12-13 19:11:39,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:11:41,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:11:41,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588571041] [2022-12-13 19:11:41,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588571041] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:11:41,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1295770611] [2022-12-13 19:11:41,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 19:11:41,025 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 19:11:41,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 19:11:41,026 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 19:11:41,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-12-13 19:11:41,263 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 19:11:41,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:11:41,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-13 19:11:41,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:11:41,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 19:11:41,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 19:11:41,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 19:11:41,484 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1470 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| nondet_tree_~n~0.base v_ArrVal_1470))) (exists ((v_ArrVal_1471 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| nondet_tree_~n~0.base v_ArrVal_1471) |c_#memory_$Pointer$.offset|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:11:41,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:11:41,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 19:11:41,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:11:41,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 19:11:41,530 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:11:41,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-13 19:11:41,541 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 23 treesize of output 22 [2022-12-13 19:11:41,547 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 23 treesize of output 22 [2022-12-13 19:11:41,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 19:11:41,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 19:11:41,635 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 9 not checked. [2022-12-13 19:11:41,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:11:43,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1295770611] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:11:43,301 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:11:43,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2022-12-13 19:11:43,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153534033] [2022-12-13 19:11:43,301 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:11:43,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 19:11:43,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:11:43,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 19:11:43,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=634, Unknown=6, NotChecked=102, Total=812 [2022-12-13 19:11:43,302 INFO L87 Difference]: Start difference. First operand 326 states and 430 transitions. Second operand has 22 states, 20 states have (on average 1.7) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 19:11:47,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:11:47,006 INFO L93 Difference]: Finished difference Result 432 states and 562 transitions. [2022-12-13 19:11:47,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 19:11:47,007 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 1.7) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 45 [2022-12-13 19:11:47,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:11:47,008 INFO L225 Difference]: With dead ends: 432 [2022-12-13 19:11:47,008 INFO L226 Difference]: Without dead ends: 432 [2022-12-13 19:11:47,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 91 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=197, Invalid=1609, Unknown=8, NotChecked=166, Total=1980 [2022-12-13 19:11:47,009 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 308 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 1700 mSolverCounterSat, 87 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 2302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1700 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 491 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-12-13 19:11:47,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1468 Invalid, 2302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1700 Invalid, 24 Unknown, 491 Unchecked, 2.8s Time] [2022-12-13 19:11:47,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2022-12-13 19:11:47,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 348. [2022-12-13 19:11:47,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 218 states have (on average 1.426605504587156) internal successors, (311), 278 states have internal predecessors, (311), 44 states have call successors, (44), 18 states have call predecessors, (44), 28 states have return successors, (103), 51 states have call predecessors, (103), 44 states have call successors, (103) [2022-12-13 19:11:47,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 458 transitions. [2022-12-13 19:11:47,016 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 458 transitions. Word has length 45 [2022-12-13 19:11:47,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:11:47,017 INFO L495 AbstractCegarLoop]: Abstraction has 348 states and 458 transitions. [2022-12-13 19:11:47,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 1.7) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 19:11:47,017 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 458 transitions. [2022-12-13 19:11:47,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-12-13 19:11:47,018 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:11:47,018 INFO L195 NwaCegarLoop]: trace histogram [18, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 7, 7, 1, 1, 1, 1] [2022-12-13 19:11:47,032 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2022-12-13 19:11:47,227 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2022-12-13 19:11:47,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt [2022-12-13 19:11:47,419 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting nondet_treeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 19:11:47,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:11:47,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1633780479, now seen corresponding path program 1 times [2022-12-13 19:11:47,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:11:47,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1392486282] [2022-12-13 19:11:47,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:11:47,420 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:11:47,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:11:47,420 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:11:47,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-12-13 19:11:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:11:48,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 899 conjuncts, 74 conjunts are in the unsatisfiable core [2022-12-13 19:11:48,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:11:48,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 19:11:48,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 19:11:48,524 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1789 (_ BitVec 1))) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_1789) |c_#valid|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (exists ((v_ArrVal_1790 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1790) |c_#length|)))) is different from true [2022-12-13 19:11:48,570 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_1790 (_ BitVec 32)) (v_ArrVal_1789 (_ BitVec 1))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1790) |c_#length|) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_1789) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:11:48,665 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 19:11:48,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-13 19:11:48,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 19:11:48,707 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1792 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_1792))) (exists ((v_ArrVal_1791 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1791))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:11:48,739 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1793 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1793))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:11:48,776 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_1793 (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1793)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:11:48,835 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_164 (_ BitVec 32)) (v_ArrVal_1792 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_1791 (_ BitVec 32)) (v_ArrVal_1793 (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1791) v_nondet_tree_~n~0.base_164 v_ArrVal_1793) |c_#length|) (= (_ bv0 1) (select (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_1792) v_nondet_tree_~n~0.base_164)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:11:48,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 19:11:49,013 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:11:49,190 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2022-12-13 19:11:49,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 19:11:49,213 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_166 (_ BitVec 32)) (v_nondet_tree_~n~0.base_165 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (not (= v_nondet_tree_~n~0.base_165 nondet_tree_~n~0.base)) (not (= v_nondet_tree_~n~0.base_166 nondet_tree_~n~0.base)) (= (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_166 (_ bv12 32)) nondet_tree_~n~0.base (_ bv12 32)) v_nondet_tree_~n~0.base_165 (_ bv12 32)) |c_#length|) (not (= v_nondet_tree_~n~0.base_165 v_nondet_tree_~n~0.base_166)))) is different from true [2022-12-13 19:11:49,353 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_166 (_ BitVec 32)) (v_nondet_tree_~n~0.base_167 (_ BitVec 32)) (v_nondet_tree_~n~0.base_164 (_ BitVec 32)) (v_ArrVal_1792 (_ BitVec 1)) (v_nondet_tree_~n~0.base_165 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_1791 (_ BitVec 32)) (v_ArrVal_1793 (_ BitVec 32))) (and (not (= v_nondet_tree_~n~0.base_166 v_nondet_tree_~n~0.base_167)) (= (store (store (store (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1791) v_nondet_tree_~n~0.base_164 v_ArrVal_1793) v_nondet_tree_~n~0.base_166 (_ bv12 32)) v_nondet_tree_~n~0.base_167 (_ bv12 32)) v_nondet_tree_~n~0.base_165 (_ bv12 32)) |c_#length|) (not (= v_nondet_tree_~n~0.base_165 v_nondet_tree_~n~0.base_167)) (= (_ bv0 1) (select (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_1792) v_nondet_tree_~n~0.base_164)) (not (= v_nondet_tree_~n~0.base_165 v_nondet_tree_~n~0.base_166)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:11:49,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:11:49,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:11:49,743 INFO L321 Elim1Store]: treesize reduction 146, result has 21.1 percent of original size [2022-12-13 19:11:49,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 57 [2022-12-13 19:11:49,799 INFO L321 Elim1Store]: treesize reduction 17, result has 45.2 percent of original size [2022-12-13 19:11:49,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 38 [2022-12-13 19:11:49,904 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 375 proven. 86 refuted. 0 times theorem prover too weak. 121 trivial. 253 not checked. [2022-12-13 19:11:49,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:11:50,500 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 19:11:50,500 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 22 treesize of output 18 [2022-12-13 19:11:57,031 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:11:57,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1392486282] [2022-12-13 19:11:57,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1392486282] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:11:57,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [950125415] [2022-12-13 19:11:57,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:11:57,032 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 19:11:57,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 19:11:57,032 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 19:11:57,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2022-12-13 19:11:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:11:58,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 899 conjuncts, 74 conjunts are in the unsatisfiable core [2022-12-13 19:11:58,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:11:58,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 19:11:58,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 19:11:58,910 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2091 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2091))) (exists ((v_ArrVal_2090 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_2090))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:11:58,950 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2091 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2090 (_ BitVec 1))) (and (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_2090)) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2091)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:11:59,043 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 19:11:59,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-13 19:11:59,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 19:11:59,219 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2094 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |c_#valid|) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2094) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:11:59,579 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2098 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2098) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:11:59,606 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2098 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2098) |c_#length|))) is different from true [2022-12-13 19:11:59,624 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) |c_#length|)) is different from true [2022-12-13 19:11:59,669 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2098 (_ BitVec 32)) (v_nondet_tree_~n~0.base_207 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_207)) (= (store (store |c_old(#length)| v_nondet_tree_~n~0.base_207 v_ArrVal_2098) nondet_tree_~n~0.base (_ bv12 32)) |c_#length|))) is different from true [2022-12-13 19:11:59,702 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2094 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2098 (_ BitVec 32)) (v_nondet_tree_~n~0.base_207 (_ BitVec 32)) (v_nondet_tree_~n~0.base_208 (_ BitVec 32))) (and (= (select (store |c_old(#valid)| v_nondet_tree_~n~0.base_208 (_ bv1 1)) v_nondet_tree_~n~0.base_207) (_ bv0 1)) (= (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_208 v_ArrVal_2094) v_nondet_tree_~n~0.base_207 v_ArrVal_2098) nondet_tree_~n~0.base (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_208)))) is different from true [2022-12-13 19:12:06,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:12:06,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:12:06,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:12:06,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:12:06,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:12:06,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:12:06,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:12:06,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:12:06,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:12:06,219 INFO L321 Elim1Store]: treesize reduction 67, result has 40.2 percent of original size [2022-12-13 19:12:06,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 53 [2022-12-13 19:12:06,345 INFO L321 Elim1Store]: treesize reduction 79, result has 21.8 percent of original size [2022-12-13 19:12:06,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 164 treesize of output 173 [2022-12-13 19:12:07,184 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 349 proven. 105 refuted. 0 times theorem prover too weak. 134 trivial. 247 not checked. [2022-12-13 19:12:07,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:12:27,583 WARN L233 SmtUtils]: Spent 5.28s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:12:27,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [950125415] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:12:27,584 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:12:27,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 31 [2022-12-13 19:12:27,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891635845] [2022-12-13 19:12:27,585 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:12:27,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 19:12:27,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:12:27,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 19:12:27,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=267, Unknown=28, NotChecked=816, Total=1190 [2022-12-13 19:12:27,586 INFO L87 Difference]: Start difference. First operand 348 states and 458 transitions. Second operand has 32 states, 31 states have (on average 3.6451612903225805) internal successors, (113), 29 states have internal predecessors, (113), 20 states have call successors, (27), 3 states have call predecessors, (27), 15 states have return successors, (29), 21 states have call predecessors, (29), 20 states have call successors, (29) [2022-12-13 19:12:29,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:12:33,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:12:35,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:12:37,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:12:44,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:12:46,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:12:48,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:12:50,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:12:54,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:12:56,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:12:58,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:13:00,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:13:04,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:13:06,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:13:08,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:13:11,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:13:13,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:13:17,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:13:19,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:13:21,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:13:24,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:13:29,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:13:31,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:13:33,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:13:35,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:13:37,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:13:42,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:13:44,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:13:46,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:13:48,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:13:56,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:13:57,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:14:00,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:14:05,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:14:22,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:14:26,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:14:26,686 INFO L93 Difference]: Finished difference Result 377 states and 530 transitions. [2022-12-13 19:14:26,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 19:14:26,687 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.6451612903225805) internal successors, (113), 29 states have internal predecessors, (113), 20 states have call successors, (27), 3 states have call predecessors, (27), 15 states have return successors, (29), 21 states have call predecessors, (29), 20 states have call successors, (29) Word has length 135 [2022-12-13 19:14:26,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:14:26,688 INFO L225 Difference]: With dead ends: 377 [2022-12-13 19:14:26,688 INFO L226 Difference]: Without dead ends: 377 [2022-12-13 19:14:26,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 238 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 68.3s TimeCoverageRelationStatistics Valid=161, Invalid=570, Unknown=39, NotChecked=1122, Total=1892 [2022-12-13 19:14:26,689 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 141 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 80 mSolverCounterUnsat, 97 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 83.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 5952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 97 IncrementalHoareTripleChecker+Unknown, 4299 IncrementalHoareTripleChecker+Unchecked, 84.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:14:26,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 727 Invalid, 5952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1476 Invalid, 97 Unknown, 4299 Unchecked, 84.0s Time] [2022-12-13 19:14:26,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-12-13 19:14:26,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 348. [2022-12-13 19:14:26,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 218 states have (on average 1.4311926605504588) internal successors, (312), 278 states have internal predecessors, (312), 43 states have call successors, (43), 19 states have call predecessors, (43), 29 states have return successors, (95), 50 states have call predecessors, (95), 43 states have call successors, (95) [2022-12-13 19:14:26,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 450 transitions. [2022-12-13 19:14:26,697 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 450 transitions. Word has length 135 [2022-12-13 19:14:26,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:14:26,698 INFO L495 AbstractCegarLoop]: Abstraction has 348 states and 450 transitions. [2022-12-13 19:14:26,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.6451612903225805) internal successors, (113), 29 states have internal predecessors, (113), 20 states have call successors, (27), 3 states have call predecessors, (27), 15 states have return successors, (29), 21 states have call predecessors, (29), 20 states have call successors, (29) [2022-12-13 19:14:26,698 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 450 transitions. [2022-12-13 19:14:26,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 19:14:26,698 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:14:26,699 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:14:26,717 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2022-12-13 19:14:26,925 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2022-12-13 19:14:27,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt [2022-12-13 19:14:27,101 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting minErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 19:14:27,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:14:27,102 INFO L85 PathProgramCache]: Analyzing trace with hash -626976300, now seen corresponding path program 3 times [2022-12-13 19:14:27,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:14:27,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40779103] [2022-12-13 19:14:27,104 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 19:14:27,105 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:14:27,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:14:27,108 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:14:27,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-12-13 19:14:27,442 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 19:14:27,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:14:27,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 19:14:27,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:14:27,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 19:14:27,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-12-13 19:14:27,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-13 19:14:27,794 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 14 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 19:14:27,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:14:28,297 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 19:14:28,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:14:28,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40779103] [2022-12-13 19:14:28,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40779103] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:14:28,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:14:28,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2022-12-13 19:14:28,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452900489] [2022-12-13 19:14:28,297 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:14:28,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 19:14:28,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:14:28,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 19:14:28,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2022-12-13 19:14:28,298 INFO L87 Difference]: Start difference. First operand 348 states and 450 transitions. Second operand has 18 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 19:14:33,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:14:33,786 INFO L93 Difference]: Finished difference Result 433 states and 552 transitions. [2022-12-13 19:14:33,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 19:14:33,787 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 45 [2022-12-13 19:14:33,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:14:33,788 INFO L225 Difference]: With dead ends: 433 [2022-12-13 19:14:33,788 INFO L226 Difference]: Without dead ends: 433 [2022-12-13 19:14:33,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=154, Invalid=902, Unknown=0, NotChecked=0, Total=1056 [2022-12-13 19:14:33,789 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 238 mSDsluCounter, 1565 mSDsCounter, 0 mSdLazyCounter, 3013 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1733 SdHoareTripleChecker+Invalid, 3077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-12-13 19:14:33,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 1733 Invalid, 3077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3013 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-12-13 19:14:33,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-12-13 19:14:33,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 362. [2022-12-13 19:14:33,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 229 states have (on average 1.4366812227074235) internal successors, (329), 289 states have internal predecessors, (329), 45 states have call successors, (45), 20 states have call predecessors, (45), 30 states have return successors, (97), 52 states have call predecessors, (97), 45 states have call successors, (97) [2022-12-13 19:14:33,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 471 transitions. [2022-12-13 19:14:33,796 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 471 transitions. Word has length 45 [2022-12-13 19:14:33,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:14:33,796 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 471 transitions. [2022-12-13 19:14:33,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 19:14:33,797 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 471 transitions. [2022-12-13 19:14:33,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 19:14:33,797 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:14:33,797 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:14:33,806 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2022-12-13 19:14:33,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:14:33,998 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting minErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 19:14:33,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:14:33,998 INFO L85 PathProgramCache]: Analyzing trace with hash -626976299, now seen corresponding path program 1 times [2022-12-13 19:14:33,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:14:33,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1486769313] [2022-12-13 19:14:33,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:14:33,999 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:14:33,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:14:33,999 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:14:34,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-12-13 19:14:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:14:34,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-13 19:14:34,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:14:34,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 19:14:34,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 19:14:34,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 19:14:34,427 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-13 19:14:34,436 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 23 treesize of output 22 [2022-12-13 19:14:34,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 19:14:34,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-12-13 19:14:34,806 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 19:14:34,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:14:39,169 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 19:14:39,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:14:39,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1486769313] [2022-12-13 19:14:39,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1486769313] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:14:39,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:14:39,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2022-12-13 19:14:39,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408456587] [2022-12-13 19:14:39,170 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:14:39,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-13 19:14:39,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:14:39,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-13 19:14:39,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=797, Unknown=0, NotChecked=0, Total=870 [2022-12-13 19:14:39,171 INFO L87 Difference]: Start difference. First operand 362 states and 471 transitions. Second operand has 30 states, 25 states have (on average 2.28) internal successors, (57), 22 states have internal predecessors, (57), 9 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2022-12-13 19:14:52,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:14:52,247 INFO L93 Difference]: Finished difference Result 410 states and 537 transitions. [2022-12-13 19:14:52,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 19:14:52,249 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 2.28) internal successors, (57), 22 states have internal predecessors, (57), 9 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) Word has length 45 [2022-12-13 19:14:52,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:14:52,250 INFO L225 Difference]: With dead ends: 410 [2022-12-13 19:14:52,250 INFO L226 Difference]: Without dead ends: 410 [2022-12-13 19:14:52,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=179, Invalid=1543, Unknown=0, NotChecked=0, Total=1722 [2022-12-13 19:14:52,251 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 256 mSDsluCounter, 2031 mSDsCounter, 0 mSdLazyCounter, 4020 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 2178 SdHoareTripleChecker+Invalid, 4131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 4020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2022-12-13 19:14:52,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 2178 Invalid, 4131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 4020 Invalid, 0 Unknown, 0 Unchecked, 11.7s Time] [2022-12-13 19:14:52,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-12-13 19:14:52,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 392. [2022-12-13 19:14:52,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 252 states have (on average 1.4166666666666667) internal successors, (357), 312 states have internal predecessors, (357), 50 states have call successors, (50), 22 states have call predecessors, (50), 32 states have return successors, (102), 57 states have call predecessors, (102), 50 states have call successors, (102) [2022-12-13 19:14:52,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 509 transitions. [2022-12-13 19:14:52,259 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 509 transitions. Word has length 45 [2022-12-13 19:14:52,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:14:52,259 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 509 transitions. [2022-12-13 19:14:52,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 2.28) internal successors, (57), 22 states have internal predecessors, (57), 9 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2022-12-13 19:14:52,260 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 509 transitions. [2022-12-13 19:14:52,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-13 19:14:52,261 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:14:52,261 INFO L195 NwaCegarLoop]: trace histogram [9, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2022-12-13 19:14:52,274 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-12-13 19:14:52,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:14:52,462 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting nondet_treeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 19:14:52,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:14:52,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1487347391, now seen corresponding path program 5 times [2022-12-13 19:14:52,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:14:52,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593185035] [2022-12-13 19:14:52,465 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 19:14:52,466 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:14:52,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:14:52,468 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:14:52,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-12-13 19:14:53,509 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-12-13 19:14:53,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:14:53,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-13 19:14:53,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:14:53,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 7 [2022-12-13 19:14:53,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 19:14:53,638 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2436 (_ BitVec 1))) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_2436) |c_#valid|)) (exists ((v_ArrVal_2437 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2437) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:14:53,679 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2437 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2436 (_ BitVec 1))) (and (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_2436) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2437) |c_#length|))) is different from true [2022-12-13 19:14:55,846 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2438 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2438) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:14:55,882 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) |c_#length|)) is different from true [2022-12-13 19:14:55,925 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2438 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_269 (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2438) v_nondet_tree_~n~0.base_269 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:14:56,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:14:56,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:14:56,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:14:56,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:14:56,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:14:56,252 INFO L321 Elim1Store]: treesize reduction 57, result has 38.7 percent of original size [2022-12-13 19:14:56,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 44 [2022-12-13 19:14:56,340 INFO L321 Elim1Store]: treesize reduction 43, result has 29.5 percent of original size [2022-12-13 19:14:56,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 102 treesize of output 109 [2022-12-13 19:14:56,385 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 33 proven. 46 refuted. 0 times theorem prover too weak. 25 trivial. 102 not checked. [2022-12-13 19:14:56,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:14:59,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:14:59,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593185035] [2022-12-13 19:14:59,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [593185035] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:14:59,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1265567777] [2022-12-13 19:14:59,050 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 19:14:59,050 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 19:14:59,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 19:14:59,051 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 19:14:59,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-12-13 19:14:59,498 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 19:14:59,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580093438] [2022-12-13 19:14:59,498 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 19:14:59,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:14:59,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:14:59,500 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:14:59,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-13 19:14:59,501 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 1 [2022-12-13 19:15:31,404 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-12-13 19:15:31,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:15:31,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-13 19:15:31,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:15:31,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 19:15:31,726 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2434 (_ BitVec 32)) (v_nondet_tree_~n~0.base_296 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2771 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)))) (and (= |c_#valid| (store .cse0 v_nondet_tree_~n~0.base_296 (_ bv1 1))) (= (select .cse0 v_nondet_tree_~n~0.base_296) (_ bv0 1)) (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2434) v_nondet_tree_~n~0.base_296 v_ArrVal_2771) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-12-13 19:15:31,789 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2768 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2768))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (exists ((v_ArrVal_2769 (_ BitVec 1))) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_2769) |c_#valid|)))) is different from true [2022-12-13 19:15:31,821 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2770 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2770) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:15:31,848 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2770 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2770) |c_#length|))) is different from true [2022-12-13 19:15:31,904 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2768 (_ BitVec 32)) (v_nondet_tree_~n~0.base_297 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2770 (_ BitVec 32)) (v_ArrVal_2769 (_ BitVec 1))) (and (= |c_#length| (store (store |c_old(#length)| v_nondet_tree_~n~0.base_297 v_ArrVal_2768) nondet_tree_~n~0.base v_ArrVal_2770)) (= (select (store |c_old(#valid)| v_nondet_tree_~n~0.base_297 v_ArrVal_2769) nondet_tree_~n~0.base) (_ bv0 1)) (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_297)))) is different from true [2022-12-13 19:15:42,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:15:42,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:15:42,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:15:42,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:15:42,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:15:42,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:15:42,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:15:42,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:15:42,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:15:42,332 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 19:15:42,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 33 [2022-12-13 19:15:42,415 INFO L321 Elim1Store]: treesize reduction 79, result has 21.8 percent of original size [2022-12-13 19:15:42,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 161 treesize of output 170 [2022-12-13 19:15:42,466 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 33 proven. 64 refuted. 0 times theorem prover too weak. 27 trivial. 82 not checked. [2022-12-13 19:15:42,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:15:49,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580093438] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:15:49,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:15:49,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2022-12-13 19:15:49,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733077631] [2022-12-13 19:15:49,507 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:15:49,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 19:15:49,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:15:49,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 19:15:49,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=153, Unknown=18, NotChecked=330, Total=552 [2022-12-13 19:15:49,508 INFO L87 Difference]: Start difference. First operand 392 states and 509 transitions. Second operand has 21 states, 20 states have (on average 3.7) internal successors, (74), 21 states have internal predecessors, (74), 15 states have call successors, (18), 3 states have call predecessors, (18), 10 states have return successors, (18), 11 states have call predecessors, (18), 14 states have call successors, (18) [2022-12-13 19:15:51,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:15:53,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:15:55,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:15:57,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:16:05,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:16:07,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:16:09,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:16:11,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:16:13,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:16:15,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:16:17,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:16:19,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:16:21,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:16:23,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:16:25,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:16:27,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:16:35,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:16:37,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:16:39,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:16:41,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:16:43,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:16:45,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:16:47,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:16:49,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:16:51,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:16:53,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:16:55,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:16:57,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:16:59,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:17:01,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:17:03,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:17:05,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:17:07,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:17:09,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:17:11,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:17:13,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:17:16,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:17:18,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:17:20,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:17:22,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:17:24,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:17:26,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:17:28,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:17:30,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:17:32,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:17:34,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:17:36,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:17:38,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:17:40,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:17:42,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:17:44,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:17:46,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:17:48,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:17:50,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:17:52,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:17:54,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:17:56,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:17:58,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:18:00,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:18:02,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:18:04,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:18:06,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:18:13,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:18:15,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:18:17,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:18:19,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:18:21,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:18:23,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:18:25,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:18:27,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:18:29,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:18:31,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:18:33,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:18:35,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:18:37,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:18:39,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:18:41,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:18:43,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:18:45,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:18:47,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:18:49,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:18:51,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:18:53,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:18:56,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:18:58,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:19:06,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:19:08,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:19:10,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:19:12,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:19:14,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:19:16,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:19:18,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:19:20,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:19:22,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:19:24,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:19:26,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:19:28,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:19:30,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:19:32,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:19:41,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:19:43,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:19:45,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:19:47,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:19:49,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:19:51,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:19:53,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:19:55,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:19:57,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:19:59,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:20:01,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:20:02,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:20:05,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:20:16,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:20:19,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:20:22,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:20:24,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:20:26,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:20:41,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:20:42,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:20:42,183 INFO L93 Difference]: Finished difference Result 417 states and 578 transitions. [2022-12-13 19:20:42,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 19:20:42,184 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.7) internal successors, (74), 21 states have internal predecessors, (74), 15 states have call successors, (18), 3 states have call predecessors, (18), 10 states have return successors, (18), 11 states have call predecessors, (18), 14 states have call successors, (18) Word has length 71 [2022-12-13 19:20:42,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:20:42,186 INFO L225 Difference]: With dead ends: 417 [2022-12-13 19:20:42,186 INFO L226 Difference]: Without dead ends: 417 [2022-12-13 19:20:42,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 119 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 68.4s TimeCoverageRelationStatistics Valid=105, Invalid=278, Unknown=37, NotChecked=450, Total=870 [2022-12-13 19:20:42,186 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 156 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 78 mSolverCounterUnsat, 165 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 244.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 3652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 165 IncrementalHoareTripleChecker+Unknown, 2337 IncrementalHoareTripleChecker+Unchecked, 244.9s IncrementalHoareTripleChecker+Time [2022-12-13 19:20:42,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 597 Invalid, 3652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1072 Invalid, 165 Unknown, 2337 Unchecked, 244.9s Time] [2022-12-13 19:20:42,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-12-13 19:20:42,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 402. [2022-12-13 19:20:42,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 259 states have (on average 1.4054054054054055) internal successors, (364), 319 states have internal predecessors, (364), 52 states have call successors, (52), 22 states have call predecessors, (52), 33 states have return successors, (126), 60 states have call predecessors, (126), 52 states have call successors, (126) [2022-12-13 19:20:42,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 542 transitions. [2022-12-13 19:20:42,194 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 542 transitions. Word has length 71 [2022-12-13 19:20:42,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:20:42,194 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 542 transitions. [2022-12-13 19:20:42,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.7) internal successors, (74), 21 states have internal predecessors, (74), 15 states have call successors, (18), 3 states have call predecessors, (18), 10 states have return successors, (18), 11 states have call predecessors, (18), 14 states have call successors, (18) [2022-12-13 19:20:42,194 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 542 transitions. [2022-12-13 19:20:42,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-12-13 19:20:42,196 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:20:42,196 INFO L195 NwaCegarLoop]: trace histogram [14, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 5, 5, 1, 1, 1, 1] [2022-12-13 19:20:42,223 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-12-13 19:20:42,408 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Ended with exit code 0 [2022-12-13 19:20:42,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:20:42,597 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting nondet_treeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 19:20:42,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:20:42,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1585739431, now seen corresponding path program 2 times [2022-12-13 19:20:42,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:20:42,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [809806532] [2022-12-13 19:20:42,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 19:20:42,600 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:20:42,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:20:42,603 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:20:42,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-12-13 19:20:43,284 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 19:20:43,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:20:43,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 19:20:43,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:20:43,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 19:20:43,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 19:20:43,374 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_3023 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3023) |c_#length|)) (exists ((v_ArrVal_3024 (_ BitVec 1))) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_3024) |c_#valid|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:20:43,410 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3023 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_3024 (_ BitVec 1))) (and (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_3024) |c_#valid|) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3023) |c_#length|))) is different from true [2022-12-13 19:20:43,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:20:43,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 19:20:43,520 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 19:20:43,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-13 19:20:43,561 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_3026 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_3026))) (exists ((v_ArrVal_3025 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3025) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:20:43,595 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_3027 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3027) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:20:43,633 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_3027 (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3027) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:20:43,705 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3025 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_325 (_ BitVec 32)) (v_ArrVal_3026 (_ BitVec 1)) (v_ArrVal_3027 (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3025) v_nondet_tree_~n~0.base_325 v_ArrVal_3027)) (= (_ bv0 1) (select (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_3026) v_nondet_tree_~n~0.base_325)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:20:43,746 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) |c_#length|)) is different from true [2022-12-13 19:20:43,822 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3025 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_325 (_ BitVec 32)) (v_ArrVal_3026 (_ BitVec 1)) (v_ArrVal_3027 (_ BitVec 32)) (v_nondet_tree_~n~0.base_326 (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_3026) v_nondet_tree_~n~0.base_325)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= |c_#length| (store (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3025) v_nondet_tree_~n~0.base_325 v_ArrVal_3027) v_nondet_tree_~n~0.base_326 (_ bv12 32))))) is different from true [2022-12-13 19:20:43,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:20:43,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:20:43,937 INFO L321 Elim1Store]: treesize reduction 47, result has 36.5 percent of original size [2022-12-13 19:20:43,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 35 [2022-12-13 19:20:43,971 INFO L321 Elim1Store]: treesize reduction 17, result has 45.2 percent of original size [2022-12-13 19:20:43,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 38 [2022-12-13 19:20:44,009 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 249 proven. 41 refuted. 0 times theorem prover too weak. 85 trivial. 136 not checked. [2022-12-13 19:20:44,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:20:50,729 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:20:50,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:20:50,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [809806532] [2022-12-13 19:20:50,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [809806532] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:20:50,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1735660788] [2022-12-13 19:20:50,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 19:20:50,730 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 19:20:50,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 19:20:50,730 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 19:20:50,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2022-12-13 19:20:52,202 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 19:20:52,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:20:52,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 19:20:52,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:20:52,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 19:20:52,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 19:20:52,307 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_3258 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3258) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:20:52,344 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_3258 (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3258) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:20:52,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:20:52,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 19:20:52,408 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:20:52,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-13 19:20:52,484 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_3261 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3261) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:20:52,509 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3261 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3261) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:20:52,567 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3261 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_344 (_ BitVec 32)) (v_ArrVal_3259 (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) v_nondet_tree_~n~0.base_344)) (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3259) v_nondet_tree_~n~0.base_344 v_ArrVal_3261) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:20:52,668 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3261 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_344 (_ BitVec 32)) (v_nondet_tree_~n~0.base_345 (_ BitVec 32)) (v_ArrVal_3259 (_ BitVec 32))) (and (= (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_345 v_ArrVal_3259) v_nondet_tree_~n~0.base_344 v_ArrVal_3261) nondet_tree_~n~0.base (_ bv12 32)) |c_#length|) (= (select (store |c_old(#valid)| v_nondet_tree_~n~0.base_345 (_ bv1 1)) v_nondet_tree_~n~0.base_344) (_ bv0 1)) (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_345) (_ bv0 1)))) is different from true [2022-12-13 19:20:52,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:20:52,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:20:52,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:20:52,790 INFO L321 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-12-13 19:20:52,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 32 [2022-12-13 19:20:52,825 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2022-12-13 19:20:52,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 19:20:52,844 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 249 proven. 44 refuted. 0 times theorem prover too weak. 85 trivial. 133 not checked. [2022-12-13 19:20:52,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:20:55,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1735660788] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:20:55,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:20:55,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2022-12-13 19:20:55,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064952206] [2022-12-13 19:20:55,456 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:20:55,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 19:20:55,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:20:55,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 19:20:55,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=79, Unknown=15, NotChecked=406, Total=552 [2022-12-13 19:20:55,457 INFO L87 Difference]: Start difference. First operand 402 states and 542 transitions. Second operand has 21 states, 20 states have (on average 3.9) internal successors, (78), 20 states have internal predecessors, (78), 15 states have call successors, (19), 3 states have call predecessors, (19), 10 states have return successors, (20), 12 states have call predecessors, (20), 15 states have call successors, (20) [2022-12-13 19:21:07,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:21:07,282 INFO L93 Difference]: Finished difference Result 418 states and 591 transitions. [2022-12-13 19:21:07,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 19:21:07,283 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.9) internal successors, (78), 20 states have internal predecessors, (78), 15 states have call successors, (19), 3 states have call predecessors, (19), 10 states have return successors, (20), 12 states have call predecessors, (20), 15 states have call successors, (20) Word has length 107 [2022-12-13 19:21:07,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:21:07,286 INFO L225 Difference]: With dead ends: 418 [2022-12-13 19:21:07,286 INFO L226 Difference]: Without dead ends: 418 [2022-12-13 19:21:07,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 193 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=74, Invalid=119, Unknown=19, NotChecked=490, Total=702 [2022-12-13 19:21:07,287 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 79 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 32 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 3754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 3172 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-13 19:21:07,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 391 Invalid, 3754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 544 Invalid, 6 Unknown, 3172 Unchecked, 1.5s Time] [2022-12-13 19:21:07,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2022-12-13 19:21:07,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 409. [2022-12-13 19:21:07,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 264 states have (on average 1.3977272727272727) internal successors, (369), 324 states have internal predecessors, (369), 53 states have call successors, (53), 22 states have call predecessors, (53), 34 states have return successors, (144), 62 states have call predecessors, (144), 53 states have call successors, (144) [2022-12-13 19:21:07,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 566 transitions. [2022-12-13 19:21:07,294 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 566 transitions. Word has length 107 [2022-12-13 19:21:07,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:21:07,294 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 566 transitions. [2022-12-13 19:21:07,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.9) internal successors, (78), 20 states have internal predecessors, (78), 15 states have call successors, (19), 3 states have call predecessors, (19), 10 states have return successors, (20), 12 states have call predecessors, (20), 15 states have call successors, (20) [2022-12-13 19:21:07,294 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 566 transitions. [2022-12-13 19:21:07,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-13 19:21:07,295 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:21:07,295 INFO L195 NwaCegarLoop]: trace histogram [7, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2022-12-13 19:21:07,307 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Ended with exit code 0 [2022-12-13 19:21:07,503 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2022-12-13 19:21:07,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt [2022-12-13 19:21:07,696 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting nondet_treeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 19:21:07,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:21:07,697 INFO L85 PathProgramCache]: Analyzing trace with hash 980909398, now seen corresponding path program 6 times [2022-12-13 19:21:07,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:21:07,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1075226190] [2022-12-13 19:21:07,698 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 19:21:07,698 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:21:07,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:21:07,700 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:21:07,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-12-13 19:21:08,142 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-12-13 19:21:08,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:21:08,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 19:21:08,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:21:08,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 19:21:08,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 19:21:08,261 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_3382 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3382) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:21:08,304 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3382 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3382) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:21:08,328 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) |c_#length|)) is different from true [2022-12-13 19:21:08,388 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3382 (_ BitVec 32)) (v_nondet_tree_~n~0.base_362 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3382) v_nondet_tree_~n~0.base_362 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:21:08,429 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3382 (_ BitVec 32)) (v_nondet_tree_~n~0.base_362 (_ BitVec 32)) (v_nondet_tree_~n~0.base_363 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_3381 (_ BitVec 32))) (and (= (store (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3381) v_nondet_tree_~n~0.base_363 v_ArrVal_3382) v_nondet_tree_~n~0.base_362 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= (_ bv0 1) (select (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) v_nondet_tree_~n~0.base_363)))) is different from true [2022-12-13 19:21:08,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:21:08,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:21:08,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:21:08,593 INFO L321 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-12-13 19:21:08,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 32 [2022-12-13 19:21:08,633 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2022-12-13 19:21:08,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 19:21:08,694 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 23 trivial. 63 not checked. [2022-12-13 19:21:08,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:21:11,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:21:11,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1075226190] [2022-12-13 19:21:11,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1075226190] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:21:11,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2033060650] [2022-12-13 19:21:11,174 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 19:21:11,174 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 19:21:11,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 19:21:11,175 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 19:21:11,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2022-12-13 19:21:11,583 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 19:21:11,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250916150] [2022-12-13 19:21:11,583 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 19:21:11,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:21:11,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:21:11,584 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:21:11,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-13 19:21:11,588 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 1 [2022-12-13 19:21:14,520 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-12-13 19:21:14,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:21:14,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-13 19:21:14,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:21: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 5 [2022-12-13 19:21:14,564 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (exists ((v_ArrVal_3604 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3604))))) is different from true [2022-12-13 19:21:14,675 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:21:14,748 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:21:14,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-13 19:21:14,758 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_383 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store (store |c_old(#length)| v_nondet_tree_~n~0.base_383 (_ bv12 32)) nondet_tree_~n~0.base (_ bv12 32)) |c_#length|) (not (= v_nondet_tree_~n~0.base_383 nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:21:14,794 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_383 (_ BitVec 32)) (v_nondet_tree_~n~0.base_384 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_3604 (_ BitVec 32))) (and (not (= v_nondet_tree_~n~0.base_383 nondet_tree_~n~0.base)) (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_384) (_ bv0 1)) (= |c_#length| (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_384 v_ArrVal_3604) v_nondet_tree_~n~0.base_383 (_ bv12 32)) nondet_tree_~n~0.base (_ bv12 32))))) is different from true [2022-12-13 19:21:14,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:21:14,966 INFO L321 Elim1Store]: treesize reduction 53, result has 25.4 percent of original size [2022-12-13 19:21:14,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 31 [2022-12-13 19:21:14,981 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:21:14,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-13 19:21:15,049 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 23 trivial. 62 not checked. [2022-12-13 19:21:15,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:21:15,346 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-12-13 19:21:15,346 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 15 treesize of output 14 [2022-12-13 19:21:22,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250916150] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:21:22,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:21:22,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 18 [2022-12-13 19:21:22,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495207920] [2022-12-13 19:21:22,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:21:22,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 19:21:22,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:21:22,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 19:21:22,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=131, Unknown=11, NotChecked=270, Total=462 [2022-12-13 19:21:22,654 INFO L87 Difference]: Start difference. First operand 409 states and 566 transitions. Second operand has 19 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 17 states have internal predecessors, (59), 12 states have call successors, (14), 3 states have call predecessors, (14), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-12-13 19:21:44,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:21:44,537 INFO L93 Difference]: Finished difference Result 454 states and 710 transitions. [2022-12-13 19:21:44,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 19:21:44,540 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 17 states have internal predecessors, (59), 12 states have call successors, (14), 3 states have call predecessors, (14), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 53 [2022-12-13 19:21:44,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:21:44,541 INFO L225 Difference]: With dead ends: 454 [2022-12-13 19:21:44,542 INFO L226 Difference]: Without dead ends: 454 [2022-12-13 19:21:44,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 88 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 26.0s TimeCoverageRelationStatistics Valid=111, Invalid=289, Unknown=16, NotChecked=396, Total=812 [2022-12-13 19:21:44,542 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 165 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 93 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 3282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 2204 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-12-13 19:21:44,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 574 Invalid, 3282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 984 Invalid, 1 Unknown, 2204 Unchecked, 5.5s Time] [2022-12-13 19:21:44,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-12-13 19:21:44,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 435. [2022-12-13 19:21:44,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 282 states have (on average 1.3794326241134751) internal successors, (389), 343 states have internal predecessors, (389), 57 states have call successors, (57), 24 states have call predecessors, (57), 38 states have return successors, (197), 67 states have call predecessors, (197), 57 states have call successors, (197) [2022-12-13 19:21:44,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 643 transitions. [2022-12-13 19:21:44,551 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 643 transitions. Word has length 53 [2022-12-13 19:21:44,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:21:44,552 INFO L495 AbstractCegarLoop]: Abstraction has 435 states and 643 transitions. [2022-12-13 19:21:44,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 17 states have internal predecessors, (59), 12 states have call successors, (14), 3 states have call predecessors, (14), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-12-13 19:21:44,552 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 643 transitions. [2022-12-13 19:21:44,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-13 19:21:44,553 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:21:44,553 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:21:44,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-12-13 19:21:44,763 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Ended with exit code 0 [2022-12-13 19:21:44,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:21:44,954 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting minErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 19:21:44,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:21:44,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1313295925, now seen corresponding path program 2 times [2022-12-13 19:21:44,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:21:44,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756774538] [2022-12-13 19:21:44,956 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 19:21:44,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:21:44,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:21:44,959 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:21:44,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2022-12-13 19:21:45,169 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 19:21:45,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:21:45,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 19:21:45,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:21:45,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 19:21:45,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 19:21:45,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-13 19:21:45,610 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 19:21:45,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:21:45,966 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 22 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 19:21:45,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:21:45,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [756774538] [2022-12-13 19:21:45,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [756774538] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:21:45,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:21:45,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 16 [2022-12-13 19:21:45,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941131039] [2022-12-13 19:21:45,967 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:21:45,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 19:21:45,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:21:45,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 19:21:45,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2022-12-13 19:21:45,969 INFO L87 Difference]: Start difference. First operand 435 states and 643 transitions. Second operand has 17 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 13 states have internal predecessors, (41), 5 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-13 19:21:48,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 19:21:50,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 19:21:52,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 19:21:57,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:22:00,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 19:22:03,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:22:03,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:22:03,973 INFO L93 Difference]: Finished difference Result 559 states and 781 transitions. [2022-12-13 19:22:03,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 19:22:03,974 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 13 states have internal predecessors, (41), 5 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 52 [2022-12-13 19:22:03,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:22:03,976 INFO L225 Difference]: With dead ends: 559 [2022-12-13 19:22:03,976 INFO L226 Difference]: Without dead ends: 559 [2022-12-13 19:22:03,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=176, Invalid=946, Unknown=0, NotChecked=0, Total=1122 [2022-12-13 19:22:03,977 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 252 mSDsluCounter, 1365 mSDsCounter, 0 mSdLazyCounter, 3230 mSolverCounterSat, 77 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1532 SdHoareTripleChecker+Invalid, 3313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 3230 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2022-12-13 19:22:03,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 1532 Invalid, 3313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 3230 Invalid, 6 Unknown, 0 Unchecked, 17.2s Time] [2022-12-13 19:22:03,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2022-12-13 19:22:03,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 439. [2022-12-13 19:22:03,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 287 states have (on average 1.3937282229965158) internal successors, (400), 347 states have internal predecessors, (400), 56 states have call successors, (56), 25 states have call predecessors, (56), 38 states have return successors, (192), 66 states have call predecessors, (192), 56 states have call successors, (192) [2022-12-13 19:22:03,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 648 transitions. [2022-12-13 19:22:03,986 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 648 transitions. Word has length 52 [2022-12-13 19:22:03,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:22:03,986 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 648 transitions. [2022-12-13 19:22:03,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 13 states have internal predecessors, (41), 5 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-13 19:22:03,986 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 648 transitions. [2022-12-13 19:22:03,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-13 19:22:03,987 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:22:03,987 INFO L195 NwaCegarLoop]: trace histogram [7, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2022-12-13 19:22:04,001 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Ended with exit code 0 [2022-12-13 19:22:04,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:22:04,188 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting nondet_treeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 19:22:04,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:22:04,189 INFO L85 PathProgramCache]: Analyzing trace with hash -374049066, now seen corresponding path program 7 times [2022-12-13 19:22:04,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:22:04,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389166422] [2022-12-13 19:22:04,190 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 19:22:04,190 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:22:04,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:22:04,191 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:22:04,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-12-13 19:22:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:22:04,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 19:22:04,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:22:04,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 19:22:04,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 19:22:04,737 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_3783 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3783))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:22:04,771 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) |c_#length|)) is different from true [2022-12-13 19:22:04,833 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_417 (_ BitVec 32))) (= (store (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) v_nondet_tree_~n~0.base_417 (_ bv12 32)) |c_#length|)) is different from true [2022-12-13 19:22:04,868 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_418 (_ BitVec 32)) (v_ArrVal_3783 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_417 (_ BitVec 32))) (and (= |c_#length| (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_418 v_ArrVal_3783) nondet_tree_~n~0.base (_ bv12 32)) v_nondet_tree_~n~0.base_417 (_ bv12 32))) (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_418)))) is different from true [2022-12-13 19:22:04,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:22:05,002 INFO L321 Elim1Store]: treesize reduction 67, result has 25.6 percent of original size [2022-12-13 19:22:05,002 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 3 case distinctions, treesize of input 18 treesize of output 31 [2022-12-13 19:22:05,018 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:22:05,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-13 19:22:05,059 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 63 not checked. [2022-12-13 19:22:05,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:22:05,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:22:05,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1389166422] [2022-12-13 19:22:05,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1389166422] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:22:05,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2009617654] [2022-12-13 19:22:05,430 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 19:22:05,430 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 19:22:05,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 19:22:05,431 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 19:22:05,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2022-12-13 19:22:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:22:06,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-13 19:22:06,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:22:06,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 19:22:06,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 19:22:06,089 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_3897 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3897) |c_#length|)) (exists ((v_ArrVal_3898 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_3898))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:22:06,116 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_3899 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3899))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:22:06,174 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_438 (_ BitVec 32)) (v_ArrVal_3899 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_438)) (= (store (store |c_old(#length)| v_nondet_tree_~n~0.base_438 v_ArrVal_3899) nondet_tree_~n~0.base (_ bv12 32)) |c_#length|))) is different from true [2022-12-13 19:22:06,240 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3898 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_438 (_ BitVec 32)) (v_ArrVal_3899 (_ BitVec 32)) (v_nondet_tree_~n~0.base_439 (_ BitVec 32)) (v_ArrVal_3897 (_ BitVec 32))) (and (= (store (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3897) v_nondet_tree_~n~0.base_438 v_ArrVal_3899) v_nondet_tree_~n~0.base_439 (_ bv12 32)) |c_#length|) (= (select (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_3898) v_nondet_tree_~n~0.base_438) (_ bv0 1)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:22:06,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:22:06,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:22:06,390 INFO L321 Elim1Store]: treesize reduction 47, result has 36.5 percent of original size [2022-12-13 19:22:06,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 35 [2022-12-13 19:22:06,425 INFO L321 Elim1Store]: treesize reduction 17, result has 45.2 percent of original size [2022-12-13 19:22:06,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 38 [2022-12-13 19:22:06,451 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 23 trivial. 66 not checked. [2022-12-13 19:22:06,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:22:12,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2009617654] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:22:12,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:22:12,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2022-12-13 19:22:12,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460411438] [2022-12-13 19:22:12,978 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:22:12,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 19:22:12,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:22:12,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 19:22:12,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=57, Unknown=9, NotChecked=168, Total=272 [2022-12-13 19:22:12,978 INFO L87 Difference]: Start difference. First operand 439 states and 648 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 10 states have call successors, (11), 3 states have call predecessors, (11), 6 states have return successors, (12), 6 states have call predecessors, (12), 9 states have call successors, (12) [2022-12-13 19:22:39,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:22:39,740 INFO L93 Difference]: Finished difference Result 463 states and 748 transitions. [2022-12-13 19:22:39,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 19:22:39,741 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 10 states have call successors, (11), 3 states have call predecessors, (11), 6 states have return successors, (12), 6 states have call predecessors, (12), 9 states have call successors, (12) Word has length 53 [2022-12-13 19:22:39,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:22:39,742 INFO L225 Difference]: With dead ends: 463 [2022-12-13 19:22:39,742 INFO L226 Difference]: Without dead ends: 463 [2022-12-13 19:22:39,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 31.7s TimeCoverageRelationStatistics Valid=78, Invalid=140, Unknown=24, NotChecked=264, Total=506 [2022-12-13 19:22:39,743 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 131 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 2462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1921 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-13 19:22:39,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 360 Invalid, 2462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 477 Invalid, 0 Unknown, 1921 Unchecked, 1.5s Time] [2022-12-13 19:22:39,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2022-12-13 19:22:39,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 446. [2022-12-13 19:22:39,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 292 states have (on average 1.3869863013698631) internal successors, (405), 352 states have internal predecessors, (405), 57 states have call successors, (57), 25 states have call predecessors, (57), 39 states have return successors, (217), 68 states have call predecessors, (217), 57 states have call successors, (217) [2022-12-13 19:22:39,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 679 transitions. [2022-12-13 19:22:39,759 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 679 transitions. Word has length 53 [2022-12-13 19:22:39,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:22:39,759 INFO L495 AbstractCegarLoop]: Abstraction has 446 states and 679 transitions. [2022-12-13 19:22:39,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 10 states have call successors, (11), 3 states have call predecessors, (11), 6 states have return successors, (12), 6 states have call predecessors, (12), 9 states have call successors, (12) [2022-12-13 19:22:39,759 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 679 transitions. [2022-12-13 19:22:39,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-13 19:22:39,760 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:22:39,760 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:22:39,774 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2022-12-13 19:22:39,975 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (41)] Ended with exit code 0 [2022-12-13 19:22:40,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt [2022-12-13 19:22:40,162 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting minErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 19:22:40,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:22:40,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1313295924, now seen corresponding path program 1 times [2022-12-13 19:22:40,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:22:40,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1626502191] [2022-12-13 19:22:40,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:22:40,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:22:40,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:22:40,165 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:22:40,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2022-12-13 19:22:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:22:40,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-13 19:22:40,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:22:40,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 19:22:40,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 19:22:40,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-12-13 19:22:40,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-12-13 19:22:40,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 19:22:41,056 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 19:22:41,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:22:44,003 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 22 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 19:22:44,003 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:22:44,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1626502191] [2022-12-13 19:22:44,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1626502191] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:22:44,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:22:44,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2022-12-13 19:22:44,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751034476] [2022-12-13 19:22:44,004 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:22:44,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-13 19:22:44,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:22:44,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-13 19:22:44,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2022-12-13 19:22:44,005 INFO L87 Difference]: Start difference. First operand 446 states and 679 transitions. Second operand has 29 states, 24 states have (on average 2.625) internal successors, (63), 21 states have internal predecessors, (63), 9 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2022-12-13 19:22:46,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:22:48,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:23:01,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:23:02,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:23:02,149 INFO L93 Difference]: Finished difference Result 524 states and 796 transitions. [2022-12-13 19:23:02,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 19:23:02,151 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 24 states have (on average 2.625) internal successors, (63), 21 states have internal predecessors, (63), 9 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) Word has length 52 [2022-12-13 19:23:02,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:23:02,153 INFO L225 Difference]: With dead ends: 524 [2022-12-13 19:23:02,153 INFO L226 Difference]: Without dead ends: 524 [2022-12-13 19:23:02,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=197, Invalid=1609, Unknown=0, NotChecked=0, Total=1806 [2022-12-13 19:23:02,154 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 230 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 3377 mSolverCounterSat, 96 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1671 SdHoareTripleChecker+Invalid, 3476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 3377 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2022-12-13 19:23:02,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 1671 Invalid, 3476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 3377 Invalid, 3 Unknown, 0 Unchecked, 16.5s Time] [2022-12-13 19:23:02,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-12-13 19:23:02,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 495. [2022-12-13 19:23:02,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 330 states have (on average 1.3818181818181818) internal successors, (456), 389 states have internal predecessors, (456), 64 states have call successors, (64), 28 states have call predecessors, (64), 43 states have return successors, (238), 77 states have call predecessors, (238), 64 states have call successors, (238) [2022-12-13 19:23:02,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 758 transitions. [2022-12-13 19:23:02,170 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 758 transitions. Word has length 52 [2022-12-13 19:23:02,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:23:02,171 INFO L495 AbstractCegarLoop]: Abstraction has 495 states and 758 transitions. [2022-12-13 19:23:02,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 24 states have (on average 2.625) internal successors, (63), 21 states have internal predecessors, (63), 9 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2022-12-13 19:23:02,171 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 758 transitions. [2022-12-13 19:23:02,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-13 19:23:02,172 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:23:02,173 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:23:02,182 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Ended with exit code 0 [2022-12-13 19:23:02,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:23:02,373 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting sizeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 19:23:02,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:23:02,373 INFO L85 PathProgramCache]: Analyzing trace with hash -60976456, now seen corresponding path program 1 times [2022-12-13 19:23:02,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:23:02,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [261036370] [2022-12-13 19:23:02,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:02,374 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:23:02,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:23:02,375 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:23:02,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2022-12-13 19:23:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:02,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 19:23:02,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:23:02,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 19:23:02,769 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 19:23:02,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-13 19:23:02,808 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 19:23:02,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:23:03,048 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 19:23:03,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:23:03,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [261036370] [2022-12-13 19:23:03,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [261036370] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:23:03,048 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:23:03,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2022-12-13 19:23:03,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652063426] [2022-12-13 19:23:03,049 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:23:03,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 19:23:03,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:23:03,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 19:23:03,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-13 19:23:03,050 INFO L87 Difference]: Start difference. First operand 495 states and 758 transitions. Second operand has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 4 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-12-13 19:23:04,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:23:04,825 INFO L93 Difference]: Finished difference Result 512 states and 779 transitions. [2022-12-13 19:23:04,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 19:23:04,826 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 4 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Word has length 48 [2022-12-13 19:23:04,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:23:04,827 INFO L225 Difference]: With dead ends: 512 [2022-12-13 19:23:04,827 INFO L226 Difference]: Without dead ends: 510 [2022-12-13 19:23:04,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-12-13 19:23:04,828 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 338 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-13 19:23:04,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 440 Invalid, 1149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-12-13 19:23:04,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-12-13 19:23:04,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 501. [2022-12-13 19:23:04,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 335 states have (on average 1.3761194029850747) internal successors, (461), 392 states have internal predecessors, (461), 66 states have call successors, (66), 29 states have call predecessors, (66), 43 states have return successors, (238), 79 states have call predecessors, (238), 66 states have call successors, (238) [2022-12-13 19:23:04,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 765 transitions. [2022-12-13 19:23:04,837 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 765 transitions. Word has length 48 [2022-12-13 19:23:04,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:23:04,838 INFO L495 AbstractCegarLoop]: Abstraction has 501 states and 765 transitions. [2022-12-13 19:23:04,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 4 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-12-13 19:23:04,838 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 765 transitions. [2022-12-13 19:23:04,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-13 19:23:04,839 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:23:04,840 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:23:04,852 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Ended with exit code 0 [2022-12-13 19:23:05,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:23:05,041 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting sizeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 19:23:05,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:23:05,042 INFO L85 PathProgramCache]: Analyzing trace with hash -60976455, now seen corresponding path program 1 times [2022-12-13 19:23:05,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:23:05,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977991737] [2022-12-13 19:23:05,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:05,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:23:05,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:23:05,045 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:23:05,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2022-12-13 19:23:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:05,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 19:23:05,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:23:05,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 19:23:05,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 19:23:05,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:23:05,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 19:23:05,887 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 19:23:05,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-13 19:23:05,966 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 19:23:05,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:23:08,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:23:08,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977991737] [2022-12-13 19:23:08,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1977991737] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:23:08,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [326895834] [2022-12-13 19:23:08,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:08,356 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 19:23:08,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 19:23:08,357 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 19:23:08,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (45)] Waiting until timeout for monitored process [2022-12-13 19:23:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:08,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 19:23:08,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:23:08,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 19:23:08,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 19:23:08,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 19:23:09,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:23:09,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 19:23:09,801 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 19:23:09,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:23:11,874 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_task_~t#1.offset|))) (and (or (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)) (bvule (bvadd (_ bv4 32) |c_ULTIMATE.start_task_~t#1.offset|) .cse0)) (forall ((|v_ULTIMATE.start_task_~#b~1#1.base_23| (_ BitVec 32))) (or (forall ((v_ArrVal_4085 (_ BitVec 32))) (bvule .cse0 (select (store |c_#length| |v_ULTIMATE.start_task_~#b~1#1.base_23| v_ArrVal_4085) |c_ULTIMATE.start_task_~t#1.base|))) (not (bvult |c_#StackHeapBarrier| |v_ULTIMATE.start_task_~#b~1#1.base_23|)))))) is different from false [2022-12-13 19:23:11,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [326895834] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:23:11,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:23:11,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2022-12-13 19:23:11,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218330873] [2022-12-13 19:23:11,908 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:23:11,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 19:23:11,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:23:11,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 19:23:11,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=486, Unknown=1, NotChecked=44, Total=600 [2022-12-13 19:23:11,908 INFO L87 Difference]: Start difference. First operand 501 states and 765 transitions. Second operand has 20 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 9 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) [2022-12-13 19:23:22,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:23:24,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:23:26,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:23:29,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:23:29,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:23:29,805 INFO L93 Difference]: Finished difference Result 714 states and 1006 transitions. [2022-12-13 19:23:29,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 19:23:29,806 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 9 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) Word has length 48 [2022-12-13 19:23:29,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:23:29,808 INFO L225 Difference]: With dead ends: 714 [2022-12-13 19:23:29,808 INFO L226 Difference]: Without dead ends: 712 [2022-12-13 19:23:29,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=219, Invalid=1266, Unknown=1, NotChecked=74, Total=1560 [2022-12-13 19:23:29,808 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 800 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 2366 mSolverCounterSat, 201 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 2584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 2366 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2022-12-13 19:23:29,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 845 Invalid, 2584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 2366 Invalid, 17 Unknown, 0 Unchecked, 12.9s Time] [2022-12-13 19:23:29,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2022-12-13 19:23:29,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 638. [2022-12-13 19:23:29,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 438 states have (on average 1.4360730593607305) internal successors, (629), 496 states have internal predecessors, (629), 87 states have call successors, (87), 41 states have call predecessors, (87), 56 states have return successors, (264), 100 states have call predecessors, (264), 87 states have call successors, (264) [2022-12-13 19:23:29,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 980 transitions. [2022-12-13 19:23:29,819 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 980 transitions. Word has length 48 [2022-12-13 19:23:29,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:23:29,819 INFO L495 AbstractCegarLoop]: Abstraction has 638 states and 980 transitions. [2022-12-13 19:23:29,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 9 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) [2022-12-13 19:23:29,819 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 980 transitions. [2022-12-13 19:23:29,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 19:23:29,820 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:23:29,820 INFO L195 NwaCegarLoop]: trace histogram [7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:23:29,829 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Ended with exit code 0 [2022-12-13 19:23:30,025 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (45)] Forceful destruction successful, exit code 0 [2022-12-13 19:23:30,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt [2022-12-13 19:23:30,222 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting minErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 19:23:30,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:23:30,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1874334776, now seen corresponding path program 4 times [2022-12-13 19:23:30,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:23:30,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [158688696] [2022-12-13 19:23:30,224 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 19:23:30,225 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:23:30,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:23:30,227 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:23:30,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2022-12-13 19:23:30,623 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 19:23:30,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:23:30,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 79 conjunts are in the unsatisfiable core [2022-12-13 19:23:30,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:23:30,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 19:23:30,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 19:23:30,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 19:23:31,250 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_4187 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| nondet_tree_~n~0.base v_ArrVal_4187))) (exists ((v_ArrVal_4188 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| nondet_tree_~n~0.base v_ArrVal_4188))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:23:31,375 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_nondet_tree_~n~0.base_474 (_ BitVec 32)) (v_ArrVal_4180 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4190 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4178 (_ BitVec 1)) (v_ArrVal_4189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4188 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4187 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store (store (store |c_old(#memory_$Pointer$.base)| nondet_tree_~n~0.base v_ArrVal_4180) v_nondet_tree_~n~0.base_474 v_ArrVal_4188) nondet_tree_~n~0.base v_ArrVal_4189) |c_#memory_$Pointer$.base|) (= (select (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_4178) v_nondet_tree_~n~0.base_474) (_ bv0 1)) (= |c_#memory_$Pointer$.offset| (store (store (store |c_old(#memory_$Pointer$.offset)| nondet_tree_~n~0.base v_ArrVal_4179) v_nondet_tree_~n~0.base_474 v_ArrVal_4187) nondet_tree_~n~0.base v_ArrVal_4190)))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:23:31,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:23:31,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:23:31,454 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 19:23:31,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 27 [2022-12-13 19:23:31,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:23:31,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:23:31,491 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 19:23:31,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 27 [2022-12-13 19:23:31,538 INFO L321 Elim1Store]: treesize reduction 17, result has 45.2 percent of original size [2022-12-13 19:23:31,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 38 [2022-12-13 19:23:31,600 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 23 treesize of output 22 [2022-12-13 19:23:31,606 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 23 treesize of output 22 [2022-12-13 19:23:31,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 19:23:31,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 19:23:32,128 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 10 proven. 42 refuted. 7 times theorem prover too weak. 6 trivial. 25 not checked. [2022-12-13 19:23:32,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:23:36,377 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) c_nondet_tree_~n~0.offset))) (and (forall ((v_nondet_tree_~n~0.base_502 (_ BitVec 32))) (or (forall ((v_ArrVal_4288 (_ BitVec 1)) (v_nondet_tree_~n~0.base_501 (_ BitVec 32))) (or (forall ((v_ArrVal_4291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4293 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| v_nondet_tree_~n~0.base_502 v_ArrVal_4293) v_nondet_tree_~n~0.base_501 v_ArrVal_4291) v_nondet_tree_~n~0.base_502 v_ArrVal_4294) c_nondet_tree_~n~0.base) .cse0) (_ bv0 32))) (not (= (select (store |c_#valid| v_nondet_tree_~n~0.base_502 v_ArrVal_4288) v_nondet_tree_~n~0.base_501) (_ bv0 1))))) (not (= (_ bv0 1) (select |c_#valid| v_nondet_tree_~n~0.base_502))))) (forall ((v_nondet_tree_~n~0.base_502 (_ BitVec 32))) (or (forall ((v_ArrVal_4288 (_ BitVec 1)) (v_nondet_tree_~n~0.base_501 (_ BitVec 32))) (or (not (= (select (store |c_#valid| v_nondet_tree_~n~0.base_502 v_ArrVal_4288) v_nondet_tree_~n~0.base_501) (_ bv0 1))) (forall ((v_ArrVal_4292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| v_nondet_tree_~n~0.base_502 v_ArrVal_4292) v_nondet_tree_~n~0.base_501 v_ArrVal_4290) v_nondet_tree_~n~0.base_502 v_ArrVal_4289) c_nondet_tree_~n~0.base) .cse0) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| v_nondet_tree_~n~0.base_502))))))) is different from false [2022-12-13 19:23:36,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:23:36,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [158688696] [2022-12-13 19:23:36,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [158688696] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:23:36,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1037856599] [2022-12-13 19:23:36,381 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 19:23:36,381 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 19:23:36,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 19:23:36,382 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 19:23:36,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (47)] Waiting until timeout for monitored process [2022-12-13 19:23:36,941 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 19:23:36,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:23:36,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 81 conjunts are in the unsatisfiable core [2022-12-13 19:23:36,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:23:36,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-13 19:23:36,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 19:23:37,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 19:23:37,529 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_4396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| nondet_tree_~n~0.base v_ArrVal_4396))) (exists ((v_ArrVal_4397 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| nondet_tree_~n~0.base v_ArrVal_4397) |c_#memory_$Pointer$.base|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:23:37,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:23:37,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:23:37,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:23:37,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2022-12-13 19:23:37,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:23:37,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:23:37,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:23:37,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2022-12-13 19:23:38,008 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2022-12-13 19:23:38,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 19:23:38,017 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 23 treesize of output 22 [2022-12-13 19:23:38,026 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 23 treesize of output 22 [2022-12-13 19:23:38,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 19:23:38,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 19:23:38,120 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 10 proven. 60 refuted. 0 times theorem prover too weak. 6 trivial. 14 not checked. [2022-12-13 19:23:38,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:23:45,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1037856599] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:23:45,999 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:23:45,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 30 [2022-12-13 19:23:45,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546093228] [2022-12-13 19:23:45,999 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:23:45,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-13 19:23:45,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:23:45,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-13 19:23:46,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1003, Unknown=38, NotChecked=268, Total=1406 [2022-12-13 19:23:46,000 INFO L87 Difference]: Start difference. First operand 638 states and 980 transitions. Second operand has 30 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 23 states have internal predecessors, (52), 8 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2022-12-13 19:23:58,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:23:58,890 INFO L93 Difference]: Finished difference Result 781 states and 1200 transitions. [2022-12-13 19:23:58,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 19:23:58,891 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 23 states have internal predecessors, (52), 8 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) Word has length 59 [2022-12-13 19:23:58,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:23:58,893 INFO L225 Difference]: With dead ends: 781 [2022-12-13 19:23:58,893 INFO L226 Difference]: Without dead ends: 781 [2022-12-13 19:23:58,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 109 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=260, Invalid=2440, Unknown=72, NotChecked=420, Total=3192 [2022-12-13 19:23:58,894 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 301 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 2755 mSolverCounterSat, 93 mSolverCounterUnsat, 137 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 3948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2755 IncrementalHoareTripleChecker+Invalid, 137 IncrementalHoareTripleChecker+Unknown, 963 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2022-12-13 19:23:58,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 1940 Invalid, 3948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2755 Invalid, 137 Unknown, 963 Unchecked, 9.2s Time] [2022-12-13 19:23:58,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2022-12-13 19:23:58,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 662. [2022-12-13 19:23:58,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 456 states have (on average 1.4232456140350878) internal successors, (649), 514 states have internal predecessors, (649), 90 states have call successors, (90), 43 states have call predecessors, (90), 59 states have return successors, (281), 104 states have call predecessors, (281), 90 states have call successors, (281) [2022-12-13 19:23:58,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1020 transitions. [2022-12-13 19:23:58,906 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1020 transitions. Word has length 59 [2022-12-13 19:23:58,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:23:58,906 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 1020 transitions. [2022-12-13 19:23:58,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 23 states have internal predecessors, (52), 8 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2022-12-13 19:23:58,906 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1020 transitions. [2022-12-13 19:23:58,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-12-13 19:23:58,913 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:23:58,913 INFO L195 NwaCegarLoop]: trace histogram [23, 13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 1, 1, 1, 1] [2022-12-13 19:23:58,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Forceful destruction successful, exit code 0 [2022-12-13 19:23:59,128 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (47)] Ended with exit code 0 [2022-12-13 19:23:59,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt [2022-12-13 19:23:59,315 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting nondet_treeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-12-13 19:23:59,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:23:59,317 INFO L85 PathProgramCache]: Analyzing trace with hash -15130472, now seen corresponding path program 3 times [2022-12-13 19:23:59,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:23:59,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [992849665] [2022-12-13 19:23:59,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 19:23:59,318 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:23:59,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:23:59,319 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:23:59,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cbddb0d-2792-49c3-bbf2-f5448d3d9ed8/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2022-12-13 19:24:03,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2022-12-13 19:24:03,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:24:03,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 1003 conjuncts, 98 conjunts are in the unsatisfiable core [2022-12-13 19:24:03,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:24:03,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 19:24:03,469 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) |c_#length|)) is different from true [2022-12-13 19:24:03,529 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 19:24:03,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 19:24:03,579 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_4835 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4835) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (exists ((v_ArrVal_4836 (_ BitVec 1))) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_4836) |c_#valid|)))) is different from true [2022-12-13 19:24:03,664 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_4838 (_ BitVec 32))) (and (= (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |c_#valid|) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4838) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:24:03,758 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4836 (_ BitVec 1)) (v_nondet_tree_~n~0.base_533 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_4838 (_ BitVec 32)) (v_ArrVal_4835 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| v_nondet_tree_~n~0.base_533 v_ArrVal_4836))) (and (= (store (store |c_old(#length)| v_nondet_tree_~n~0.base_533 v_ArrVal_4835) nondet_tree_~n~0.base v_ArrVal_4838) |c_#length|) (= (select .cse0 nondet_tree_~n~0.base) (_ bv0 1)) (= (store .cse0 nondet_tree_~n~0.base (_ bv1 1)) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_533))))) is different from true [2022-12-13 19:24:04,330 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_4847 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4847))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:24:04,355 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_4847 (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4847)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 19:24:04,405 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_4838 (_ BitVec 32)) (v_ArrVal_4847 (_ BitVec 32)) (v_nondet_tree_~n~0.base_535 (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| v_nondet_tree_~n~0.base_535 v_ArrVal_4838) nondet_tree_~n~0.base v_ArrVal_4847)) (= (_ bv0 1) (select (store |c_old(#valid)| v_nondet_tree_~n~0.base_535 (_ bv1 1)) nondet_tree_~n~0.base)) (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_535) (_ bv0 1)))) is different from true [2022-12-13 19:24:04,458 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4848 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_4838 (_ BitVec 32)) (v_ArrVal_4847 (_ BitVec 32)) (v_nondet_tree_~n~0.base_535 (_ BitVec 32)) (v_nondet_tree_~n~0.base_536 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| v_nondet_tree_~n~0.base_536 (_ bv1 1)))) (and (= (select (store .cse0 v_nondet_tree_~n~0.base_535 (_ bv1 1)) nondet_tree_~n~0.base) (_ bv0 1)) (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_536)) (= |c_#length| (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_536 v_ArrVal_4848) v_nondet_tree_~n~0.base_535 v_ArrVal_4838) nondet_tree_~n~0.base v_ArrVal_4847)) (= (_ bv0 1) (select .cse0 v_nondet_tree_~n~0.base_535))))) is different from true