./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 e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/verifythis/tree_del_iter.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8 --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-e04fb08 [2022-11-16 12:00:21,500 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:00:21,506 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:00:21,547 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:00:21,549 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:00:21,551 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:00:21,555 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:00:21,557 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:00:21,561 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:00:21,564 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:00:21,566 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:00:21,568 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:00:21,570 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:00:21,574 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:00:21,576 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:00:21,577 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:00:21,578 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:00:21,578 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:00:21,580 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:00:21,582 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:00:21,583 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:00:21,585 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:00:21,586 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:00:21,587 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:00:21,590 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:00:21,595 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:00:21,596 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:00:21,597 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:00:21,597 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:00:21,598 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:00:21,599 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:00:21,600 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:00:21,602 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:00:21,603 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:00:21,605 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:00:21,606 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:00:21,607 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:00:21,608 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:00:21,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:00:21,610 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:00:21,611 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:00:21,612 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-11-16 12:00:21,646 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:00:21,646 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:00:21,647 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:00:21,647 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:00:21,648 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:00:21,649 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:00:21,649 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:00:21,650 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:00:21,650 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:00:21,650 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:00:21,651 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:00:21,652 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 12:00:21,652 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:00:21,652 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:00:21,652 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:00:21,653 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 12:00:21,653 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 12:00:21,653 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:00:21,654 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 12:00:21,654 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:00:21,654 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:00:21,654 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:00:21,655 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:00:21,655 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:00:21,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:00:21,656 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:00:21,657 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:00:21,657 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:00:21,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:00:21,658 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/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_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8 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-11-16 12:00:21,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:00:21,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:00:21,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:00:21,983 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:00:21,984 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:00:21,985 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/verifythis/tree_del_iter.c [2022-11-16 12:00:22,069 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/data/f05144e23/71983607d145418995b4f96d31629c8e/FLAGb554a202d [2022-11-16 12:00:22,660 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:00:22,661 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/sv-benchmarks/c/verifythis/tree_del_iter.c [2022-11-16 12:00:22,670 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/data/f05144e23/71983607d145418995b4f96d31629c8e/FLAGb554a202d [2022-11-16 12:00:22,958 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/data/f05144e23/71983607d145418995b4f96d31629c8e [2022-11-16 12:00:22,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:00:22,968 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:00:22,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:00:22,973 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:00:22,976 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:00:22,977 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:00:22" (1/1) ... [2022-11-16 12:00:22,979 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5031b708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:22, skipping insertion in model container [2022-11-16 12:00:22,980 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:00:22" (1/1) ... [2022-11-16 12:00:22,987 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:00:23,010 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:00:23,265 WARN L229 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_a6d488d4-9674-47fa-9cab-62b9be24f738/sv-benchmarks/c/verifythis/tree_del_iter.c[586,599] [2022-11-16 12:00:23,305 WARN L1554 CHandler]: Possible shadowing of function min [2022-11-16 12:00:23,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:00:23,348 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-11-16 12:00:23,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5d7d33fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:23, skipping insertion in model container [2022-11-16 12:00:23,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:00:23,350 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-16 12:00:23,353 INFO L158 Benchmark]: Toolchain (without parser) took 382.95ms. Allocated memory is still 140.5MB. Free memory was 104.4MB in the beginning and 115.0MB in the end (delta: -10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-16 12:00:23,355 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 98.6MB. Free memory was 72.0MB in the beginning and 71.9MB in the end (delta: 21.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:00:23,357 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.60ms. Allocated memory is still 140.5MB. Free memory was 104.0MB in the beginning and 115.0MB in the end (delta: -11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-16 12:00:23,361 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.26ms. Allocated memory is still 98.6MB. Free memory was 72.0MB in the beginning and 71.9MB in the end (delta: 21.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 377.60ms. Allocated memory is still 140.5MB. Free memory was 104.0MB in the beginning and 115.0MB in the end (delta: -11.0MB). 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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/verifythis/tree_del_iter.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8 --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-e04fb08 [2022-11-16 12:00:25,615 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:00:25,618 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:00:25,656 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:00:25,659 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:00:25,663 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:00:25,666 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:00:25,673 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:00:25,678 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:00:25,684 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:00:25,686 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:00:25,687 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:00:25,688 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:00:25,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:00:25,693 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:00:25,699 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:00:25,700 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:00:25,702 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:00:25,705 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:00:25,709 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:00:25,713 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:00:25,716 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:00:25,718 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:00:25,720 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:00:25,731 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:00:25,734 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:00:25,734 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:00:25,735 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:00:25,736 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:00:25,737 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:00:25,738 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:00:25,739 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:00:25,740 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:00:25,741 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:00:25,743 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:00:25,743 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:00:25,747 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:00:25,748 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:00:25,748 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:00:25,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:00:25,751 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:00:25,758 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2022-11-16 12:00:25,804 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:00:25,804 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:00:25,805 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:00:25,805 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:00:25,806 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:00:25,807 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:00:25,809 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:00:25,809 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:00:25,810 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:00:25,810 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:00:25,811 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:00:25,812 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 12:00:25,812 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:00:25,812 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:00:25,813 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:00:25,813 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 12:00:25,813 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 12:00:25,813 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:00:25,814 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 12:00:25,814 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 12:00:25,814 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 12:00:25,814 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:00:25,815 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:00:25,815 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:00:25,815 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:00:25,815 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:00:25,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:00:25,816 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:00:25,817 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:00:25,817 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 12:00:25,817 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 12:00:25,817 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 12:00:25,818 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/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_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8 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-11-16 12:00:26,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:00:26,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:00:26,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:00:26,290 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:00:26,291 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:00:26,295 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/verifythis/tree_del_iter.c [2022-11-16 12:00:26,380 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/data/675a911bd/57f06824ba3d4020951fe33d70013ece/FLAGd1d342fd4 [2022-11-16 12:00:26,984 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:00:26,985 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/sv-benchmarks/c/verifythis/tree_del_iter.c [2022-11-16 12:00:26,994 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/data/675a911bd/57f06824ba3d4020951fe33d70013ece/FLAGd1d342fd4 [2022-11-16 12:00:27,312 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/data/675a911bd/57f06824ba3d4020951fe33d70013ece [2022-11-16 12:00:27,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:00:27,318 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:00:27,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:00:27,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:00:27,328 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:00:27,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:00:27" (1/1) ... [2022-11-16 12:00:27,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7df1a11d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:27, skipping insertion in model container [2022-11-16 12:00:27,331 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:00:27" (1/1) ... [2022-11-16 12:00:27,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:00:27,369 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:00:27,565 WARN L229 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_a6d488d4-9674-47fa-9cab-62b9be24f738/sv-benchmarks/c/verifythis/tree_del_iter.c[586,599] [2022-11-16 12:00:27,650 WARN L1554 CHandler]: Possible shadowing of function min [2022-11-16 12:00:27,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:00:27,710 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-16 12:00:27,723 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:00:27,729 WARN L229 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_a6d488d4-9674-47fa-9cab-62b9be24f738/sv-benchmarks/c/verifythis/tree_del_iter.c[586,599] [2022-11-16 12:00:27,746 WARN L1554 CHandler]: Possible shadowing of function min [2022-11-16 12:00:27,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:00:27,776 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:00:27,790 WARN L229 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_a6d488d4-9674-47fa-9cab-62b9be24f738/sv-benchmarks/c/verifythis/tree_del_iter.c[586,599] [2022-11-16 12:00:27,798 WARN L1554 CHandler]: Possible shadowing of function min [2022-11-16 12:00:27,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:00:27,833 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:00:27,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:27 WrapperNode [2022-11-16 12:00:27,834 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:00:27,835 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:00:27,835 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:00:27,835 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:00:27,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:27" (1/1) ... [2022-11-16 12:00:27,874 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:27" (1/1) ... [2022-11-16 12:00:27,913 INFO L138 Inliner]: procedures = 31, calls = 64, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 122 [2022-11-16 12:00:27,913 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:00:27,914 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:00:27,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:00:27,914 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:00:27,930 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:27" (1/1) ... [2022-11-16 12:00:27,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:27" (1/1) ... [2022-11-16 12:00:27,954 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:27" (1/1) ... [2022-11-16 12:00:27,954 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:27" (1/1) ... [2022-11-16 12:00:27,968 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:27" (1/1) ... [2022-11-16 12:00:27,972 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:27" (1/1) ... [2022-11-16 12:00:27,974 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:27" (1/1) ... [2022-11-16 12:00:27,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:27" (1/1) ... [2022-11-16 12:00:27,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:00:27,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:00:27,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:00:27,996 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:00:27,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:27" (1/1) ... [2022-11-16 12:00:28,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:00:28,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:00:28,032 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:00:28,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:00:28,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:00:28,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 12:00:28,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:00:28,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 12:00:28,083 INFO L130 BoogieDeclarations]: Found specification of procedure min [2022-11-16 12:00:28,083 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2022-11-16 12:00:28,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-16 12:00:28,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-16 12:00:28,083 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-16 12:00:28,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 12:00:28,084 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-11-16 12:00:28,084 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-11-16 12:00:28,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 12:00:28,084 INFO L130 BoogieDeclarations]: Found specification of procedure size [2022-11-16 12:00:28,084 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2022-11-16 12:00:28,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:00:28,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:00:28,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-16 12:00:28,085 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-16 12:00:28,085 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2022-11-16 12:00:28,085 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2022-11-16 12:00:28,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:00:28,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 12:00:28,222 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:00:28,224 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:00:29,255 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:00:29,262 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:00:29,263 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-16 12:00:29,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:00:29 BoogieIcfgContainer [2022-11-16 12:00:29,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:00:29,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:00:29,274 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:00:29,277 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:00:29,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:00:27" (1/3) ... [2022-11-16 12:00:29,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b6b40b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:00:29, skipping insertion in model container [2022-11-16 12:00:29,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:27" (2/3) ... [2022-11-16 12:00:29,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b6b40b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:00:29, skipping insertion in model container [2022-11-16 12:00:29,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:00:29" (3/3) ... [2022-11-16 12:00:29,280 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_iter.c [2022-11-16 12:00:29,301 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:00:29,302 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2022-11-16 12:00:29,376 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:00:29,383 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4c85dc3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:00:29,384 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2022-11-16 12:00:29,388 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-11-16 12:00:29,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 12:00:29,394 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:00:29,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 12:00:29,396 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-11-16 12:00:29,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:00:29,402 INFO L85 PathProgramCache]: Analyzing trace with hash 88048840, now seen corresponding path program 1 times [2022-11-16 12:00:29,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:00:29,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [881118128] [2022-11-16 12:00:29,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:00:29,417 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:00:29,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:00:29,423 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:00:29,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-16 12:00:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:29,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 12:00:29,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:00:29,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:00:29,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:00:29,652 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:00:29,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:00:29,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [881118128] [2022-11-16 12:00:29,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [881118128] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:00:29,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:00:29,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:00:29,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530197861] [2022-11-16 12:00:29,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:00:29,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:00:29,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:00:29,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:00:29,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:00:29,708 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-11-16 12:00:30,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:00:30,104 INFO L93 Difference]: Finished difference Result 191 states and 216 transitions. [2022-11-16 12:00:30,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:00:30,108 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-11-16 12:00:30,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:00:30,118 INFO L225 Difference]: With dead ends: 191 [2022-11-16 12:00:30,118 INFO L226 Difference]: Without dead ends: 188 [2022-11-16 12:00:30,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:00:30,123 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.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:00:30,124 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.3s Time] [2022-11-16 12:00:30,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-11-16 12:00:30,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2022-11-16 12:00:30,170 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-11-16 12:00:30,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 208 transitions. [2022-11-16 12:00:30,176 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 208 transitions. Word has length 5 [2022-11-16 12:00:30,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:00:30,177 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 208 transitions. [2022-11-16 12:00:30,177 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-11-16 12:00:30,177 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 208 transitions. [2022-11-16 12:00:30,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 12:00:30,178 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:00:30,178 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 12:00:30,192 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:00:30,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:00:30,387 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-11-16 12:00:30,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:00:30,387 INFO L85 PathProgramCache]: Analyzing trace with hash 88048841, now seen corresponding path program 1 times [2022-11-16 12:00:30,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:00:30,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [734214669] [2022-11-16 12:00:30,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:00:30,388 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:00:30,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:00:30,394 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:00:30,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-16 12:00:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:30,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:00:30,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:00:30,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:00:30,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:00:30,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:00:30,500 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:00:30,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [734214669] [2022-11-16 12:00:30,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [734214669] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:00:30,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:00:30,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:00:30,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679010552] [2022-11-16 12:00:30,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:00:30,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:00:30,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:00:30,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:00:30,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:00:30,512 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-11-16 12:00:30,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:00:30,856 INFO L93 Difference]: Finished difference Result 185 states and 207 transitions. [2022-11-16 12:00:30,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:00:30,858 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-11-16 12:00:30,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:00:30,859 INFO L225 Difference]: With dead ends: 185 [2022-11-16 12:00:30,860 INFO L226 Difference]: Without dead ends: 185 [2022-11-16 12:00:30,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:00:30,861 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.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:00:30,861 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.3s Time] [2022-11-16 12:00:30,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-16 12:00:30,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2022-11-16 12:00:30,880 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-11-16 12:00:30,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 207 transitions. [2022-11-16 12:00:30,883 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 207 transitions. Word has length 5 [2022-11-16 12:00:30,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:00:30,888 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 207 transitions. [2022-11-16 12:00:30,888 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-11-16 12:00:30,888 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 207 transitions. [2022-11-16 12:00:30,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 12:00:30,889 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:00:30,890 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:00:30,914 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:00:31,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:00:31,101 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-11-16 12:00:31,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:00:31,102 INFO L85 PathProgramCache]: Analyzing trace with hash -163614216, now seen corresponding path program 1 times [2022-11-16 12:00:31,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:00:31,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795363095] [2022-11-16 12:00:31,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:00:31,103 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:00:31,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:00:31,104 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:00:31,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-16 12:00:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:31,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 12:00:31,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:00:31,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:00:31,336 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:00:31,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:00:31,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1795363095] [2022-11-16 12:00:31,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1795363095] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:00:31,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:00:31,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:00:31,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367322323] [2022-11-16 12:00:31,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:00:31,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:00:31,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:00:31,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:00:31,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:00:31,347 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-11-16 12:00:31,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:00:31,557 INFO L93 Difference]: Finished difference Result 297 states and 335 transitions. [2022-11-16 12:00:31,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:00:31,557 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-11-16 12:00:31,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:00:31,559 INFO L225 Difference]: With dead ends: 297 [2022-11-16 12:00:31,560 INFO L226 Difference]: Without dead ends: 297 [2022-11-16 12:00:31,560 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-11-16 12:00:31,561 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-11-16 12:00:31,561 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-11-16 12:00:31,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-11-16 12:00:31,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 193. [2022-11-16 12:00:31,576 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-11-16 12:00:31,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 217 transitions. [2022-11-16 12:00:31,578 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 217 transitions. Word has length 11 [2022-11-16 12:00:31,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:00:31,578 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 217 transitions. [2022-11-16 12:00:31,579 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-11-16 12:00:31,579 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 217 transitions. [2022-11-16 12:00:31,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 12:00:31,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:00:31,579 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:00:31,599 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-16 12:00:31,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:00:31,791 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-11-16 12:00:31,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:00:31,791 INFO L85 PathProgramCache]: Analyzing trace with hash -916126343, now seen corresponding path program 1 times [2022-11-16 12:00:31,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:00:31,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1373480717] [2022-11-16 12:00:31,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:00:31,792 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:00:31,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:00:31,799 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:00:31,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-16 12:00:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:31,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 12:00:31,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:00:31,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:00:31,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:00:31,934 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:00:31,935 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:00:31,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1373480717] [2022-11-16 12:00:31,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1373480717] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:00:31,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:00:31,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:00:31,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383037379] [2022-11-16 12:00:31,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:00:31,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:00:31,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:00:31,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:00:31,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:00:31,937 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-11-16 12:00:32,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:00:32,542 INFO L93 Difference]: Finished difference Result 197 states and 221 transitions. [2022-11-16 12:00:32,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:00:32,543 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-11-16 12:00:32,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:00:32,545 INFO L225 Difference]: With dead ends: 197 [2022-11-16 12:00:32,545 INFO L226 Difference]: Without dead ends: 197 [2022-11-16 12:00:32,545 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-11-16 12:00:32,546 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 70 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:00:32,547 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.6s Time] [2022-11-16 12:00:32,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-11-16 12:00:32,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2022-11-16 12:00:32,555 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-11-16 12:00:32,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 221 transitions. [2022-11-16 12:00:32,558 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 221 transitions. Word has length 11 [2022-11-16 12:00:32,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:00:32,558 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 221 transitions. [2022-11-16 12:00:32,563 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-11-16 12:00:32,563 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 221 transitions. [2022-11-16 12:00:32,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 12:00:32,564 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:00:32,564 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:00:32,582 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-16 12:00:32,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:00:32,776 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-11-16 12:00:32,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:00:32,777 INFO L85 PathProgramCache]: Analyzing trace with hash -916126342, now seen corresponding path program 1 times [2022-11-16 12:00:32,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:00:32,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1101258147] [2022-11-16 12:00:32,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:00:32,777 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:00:32,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:00:32,778 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:00:32,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-16 12:00:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:32,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 12:00:32,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:00:32,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:00:32,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:00:32,958 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:00:32,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:00:32,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1101258147] [2022-11-16 12:00:32,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1101258147] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:00:32,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:00:32,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:00:32,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797500187] [2022-11-16 12:00:32,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:00:32,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:00:32,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:00:32,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:00:32,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:00:32,961 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-11-16 12:00:33,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:00:33,613 INFO L93 Difference]: Finished difference Result 201 states and 231 transitions. [2022-11-16 12:00:33,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:00:33,614 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-11-16 12:00:33,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:00:33,615 INFO L225 Difference]: With dead ends: 201 [2022-11-16 12:00:33,615 INFO L226 Difference]: Without dead ends: 201 [2022-11-16 12:00:33,615 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-11-16 12:00:33,616 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 68 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:00:33,617 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.6s Time] [2022-11-16 12:00:33,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-11-16 12:00:33,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2022-11-16 12:00:33,625 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-11-16 12:00:33,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 225 transitions. [2022-11-16 12:00:33,627 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 225 transitions. Word has length 11 [2022-11-16 12:00:33,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:00:33,627 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 225 transitions. [2022-11-16 12:00:33,627 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-11-16 12:00:33,628 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 225 transitions. [2022-11-16 12:00:33,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 12:00:33,628 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:00:33,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:00:33,648 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-16 12:00:33,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:00:33,845 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-11-16 12:00:33,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:00:33,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1497511222, now seen corresponding path program 1 times [2022-11-16 12:00:33,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:00:33,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1899099968] [2022-11-16 12:00:33,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:00:33,846 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:00:33,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:00:33,847 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:00:33,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-16 12:00:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:33,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 12:00:33,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:00:34,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:00:34,043 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:00:34,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:00:34,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1899099968] [2022-11-16 12:00:34,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1899099968] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:00:34,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:00:34,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:00:34,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103303144] [2022-11-16 12:00:34,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:00:34,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:00:34,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:00:34,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:00:34,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:00:34,046 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-11-16 12:00:34,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:00:34,245 INFO L93 Difference]: Finished difference Result 306 states and 347 transitions. [2022-11-16 12:00:34,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:00:34,246 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-11-16 12:00:34,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:00:34,248 INFO L225 Difference]: With dead ends: 306 [2022-11-16 12:00:34,248 INFO L226 Difference]: Without dead ends: 306 [2022-11-16 12:00:34,249 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-11-16 12:00:34,250 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-11-16 12:00:34,250 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-11-16 12:00:34,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-11-16 12:00:34,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 244. [2022-11-16 12:00:34,261 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-11-16 12:00:34,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 306 transitions. [2022-11-16 12:00:34,264 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 306 transitions. Word has length 17 [2022-11-16 12:00:34,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:00:34,264 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 306 transitions. [2022-11-16 12:00:34,265 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-11-16 12:00:34,265 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 306 transitions. [2022-11-16 12:00:34,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 12:00:34,266 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:00:34,266 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:00:34,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-16 12:00:34,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:00:34,480 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-11-16 12:00:34,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:00:34,480 INFO L85 PathProgramCache]: Analyzing trace with hash -2030552348, now seen corresponding path program 1 times [2022-11-16 12:00:34,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:00:34,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1453330303] [2022-11-16 12:00:34,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:00:34,481 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:00:34,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:00:34,482 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:00:34,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-16 12:00:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:34,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 12:00:34,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:00:34,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:00:34,774 WARN L855 $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-11-16 12:00:34,819 WARN L855 $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-11-16 12:00:34,934 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 12:00:34,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-16 12:00:34,944 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 8 not checked. [2022-11-16 12:00:34,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:00:35,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:00:35,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1453330303] [2022-11-16 12:00:35,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1453330303] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:00:35,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2125662514] [2022-11-16 12:00:35,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:00:35,174 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 12:00:35,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 12:00:35,178 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 12:00:35,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-11-16 12:00:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:35,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 12:00:35,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:00:35,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 7 [2022-11-16 12:00:35,510 WARN L855 $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-11-16 12:00:35,611 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 12:00:35,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-16 12:00:35,620 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 8 not checked. [2022-11-16 12:00:35,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:00:35,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2125662514] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:00:35,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:00:35,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2022-11-16 12:00:35,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224468506] [2022-11-16 12:00:35,786 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:00:35,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:00:35,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:00:35,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:00:35,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=15, Unknown=3, NotChecked=24, Total=56 [2022-11-16 12:00:35,788 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-11-16 12:00:38,371 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |c_#valid|)) (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-11-16 12:00:38,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:00:38,731 INFO L93 Difference]: Finished difference Result 253 states and 321 transitions. [2022-11-16 12:00:38,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:00:38,732 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-11-16 12:00:38,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:00:38,735 INFO L225 Difference]: With dead ends: 253 [2022-11-16 12:00:38,735 INFO L226 Difference]: Without dead ends: 253 [2022-11-16 12:00:38,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=20, Invalid=21, Unknown=5, NotChecked=44, Total=90 [2022-11-16 12:00:38,736 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 67 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 654 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:00:38,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 268 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 262 Invalid, 0 Unknown, 654 Unchecked, 0.8s Time] [2022-11-16 12:00:38,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-11-16 12:00:38,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 248. [2022-11-16 12:00:38,747 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-11-16 12:00:38,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 314 transitions. [2022-11-16 12:00:38,749 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 314 transitions. Word has length 29 [2022-11-16 12:00:38,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:00:38,750 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 314 transitions. [2022-11-16 12:00:38,750 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-11-16 12:00:38,750 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 314 transitions. [2022-11-16 12:00:38,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-16 12:00:38,752 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:00:38,752 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:00:38,764 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2022-11-16 12:00:38,970 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-16 12:00:39,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:00:39,156 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-11-16 12:00:39,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:00:39,157 INFO L85 PathProgramCache]: Analyzing trace with hash 2020472179, now seen corresponding path program 1 times [2022-11-16 12:00:39,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:00:39,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1950493713] [2022-11-16 12:00:39,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:00:39,158 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:00:39,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:00:39,159 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:00:39,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-16 12:00:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:39,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-16 12:00:39,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:00:39,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:00:39,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:00:39,493 WARN L855 $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-11-16 12:00:39,546 WARN L855 $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-11-16 12:00:39,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:39,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:00:39,664 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:00:39,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 12:00:39,685 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 8 not checked. [2022-11-16 12:00:39,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:00:39,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:00:39,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1950493713] [2022-11-16 12:00:39,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1950493713] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:00:39,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [848777918] [2022-11-16 12:00:39,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:00:39,993 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 12:00:39,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 12:00:39,994 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 12:00:40,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-11-16 12:00:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:40,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-16 12:00:40,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:00:40,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:00:40,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:00:40,493 WARN L855 $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-11-16 12:00:40,546 WARN L855 $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-11-16 12:00:40,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:40,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:00:40,653 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:00:40,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 12:00:40,661 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 8 not checked. [2022-11-16 12:00:40,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:00:41,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [848777918] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:00:41,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:00:41,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-11-16 12:00:41,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597596871] [2022-11-16 12:00:41,146 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:00:41,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:00:41,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:00:41,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:00:41,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=42, Unknown=4, NotChecked=60, Total=132 [2022-11-16 12:00:41,147 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-11-16 12:00:41,581 WARN L855 $PredicateComparison]: unable to prove that (and (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)))) (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-11-16 12:00:42,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:00:42,152 INFO L93 Difference]: Finished difference Result 267 states and 346 transitions. [2022-11-16 12:00:42,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:00:42,153 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-11-16 12:00:42,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:00:42,156 INFO L225 Difference]: With dead ends: 267 [2022-11-16 12:00:42,156 INFO L226 Difference]: Without dead ends: 267 [2022-11-16 12:00:42,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=53, Unknown=5, NotChecked=90, Total=182 [2022-11-16 12:00:42,157 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 129 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 904 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:00:42,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 356 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 397 Invalid, 0 Unknown, 904 Unchecked, 0.9s Time] [2022-11-16 12:00:42,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-11-16 12:00:42,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 264. [2022-11-16 12:00:42,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 159 states have (on average 1.6415094339622642) internal successors, (261), 220 states have internal predecessors, (261), 31 states have call successors, (31), 9 states have call predecessors, (31), 12 states have return successors, (45), 34 states have call predecessors, (45), 31 states have call successors, (45) [2022-11-16 12:00:42,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 337 transitions. [2022-11-16 12:00:42,173 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 337 transitions. Word has length 35 [2022-11-16 12:00:42,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:00:42,173 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 337 transitions. [2022-11-16 12:00:42,174 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-11-16 12:00:42,174 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 337 transitions. [2022-11-16 12:00:42,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 12:00:42,175 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:00:42,176 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-11-16 12:00:42,203 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-16 12:00:42,395 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2022-11-16 12:00:42,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -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_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt [2022-11-16 12:00:42,592 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-11-16 12:00:42,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:00:42,593 INFO L85 PathProgramCache]: Analyzing trace with hash -599064084, now seen corresponding path program 1 times [2022-11-16 12:00:42,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:00:42,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2093985931] [2022-11-16 12:00:42,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:00:42,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:00:42,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:00:42,600 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:00:42,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-16 12:00:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:42,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 12:00:42,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:00:42,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:00:42,891 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:00:42,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:00:43,103 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:00:43,104 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:00:43,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2093985931] [2022-11-16 12:00:43,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2093985931] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:00:43,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:00:43,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-11-16 12:00:43,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881452782] [2022-11-16 12:00:43,104 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:00:43,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:00:43,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:00:43,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:00:43,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:00:43,106 INFO L87 Difference]: Start difference. First operand 264 states and 337 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-11-16 12:00:44,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:00:44,313 INFO L93 Difference]: Finished difference Result 307 states and 364 transitions. [2022-11-16 12:00:44,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:00:44,314 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-11-16 12:00:44,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:00:44,316 INFO L225 Difference]: With dead ends: 307 [2022-11-16 12:00:44,316 INFO L226 Difference]: Without dead ends: 307 [2022-11-16 12:00:44,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-11-16 12:00:44,317 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 148 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 178 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:00:44,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 1252 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 703 Invalid, 0 Unknown, 178 Unchecked, 1.1s Time] [2022-11-16 12:00:44,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-11-16 12:00:44,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 279. [2022-11-16 12:00:44,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 172 states have (on average 1.622093023255814) internal successors, (279), 231 states have internal predecessors, (279), 33 states have call successors, (33), 11 states have call predecessors, (33), 14 states have return successors, (47), 36 states have call predecessors, (47), 33 states have call successors, (47) [2022-11-16 12:00:44,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 359 transitions. [2022-11-16 12:00:44,330 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 359 transitions. Word has length 25 [2022-11-16 12:00:44,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:00:44,331 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 359 transitions. [2022-11-16 12:00:44,331 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-11-16 12:00:44,331 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 359 transitions. [2022-11-16 12:00:44,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 12:00:44,332 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:00:44,333 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-11-16 12:00:44,350 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-16 12:00:44,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:00:44,550 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-11-16 12:00:44,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:00:44,551 INFO L85 PathProgramCache]: Analyzing trace with hash -599064083, now seen corresponding path program 1 times [2022-11-16 12:00:44,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:00:44,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852246569] [2022-11-16 12:00:44,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:00:44,552 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:00:44,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:00:44,553 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:00:44,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-16 12:00:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:44,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-16 12:00:44,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:00:44,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:00:44,896 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:00:44,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:00:46,423 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:00:46,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:00:46,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852246569] [2022-11-16 12:00:46,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852246569] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:00:46,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:00:46,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2022-11-16 12:00:46,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480368390] [2022-11-16 12:00:46,424 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:00:46,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 12:00:46,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:00:46,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 12:00:46,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-11-16 12:00:46,426 INFO L87 Difference]: Start difference. First operand 279 states and 359 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-11-16 12:00:49,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:00:49,812 INFO L93 Difference]: Finished difference Result 310 states and 401 transitions. [2022-11-16 12:00:49,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:00:49,813 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-11-16 12:00:49,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:00:49,815 INFO L225 Difference]: With dead ends: 310 [2022-11-16 12:00:49,815 INFO L226 Difference]: Without dead ends: 310 [2022-11-16 12:00:49,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2022-11-16 12:00:49,816 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 73 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1458 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:00:49,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1458 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 696 Invalid, 0 Unknown, 136 Unchecked, 3.0s Time] [2022-11-16 12:00:49,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-11-16 12:00:49,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 301. [2022-11-16 12:00:49,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 188 states have (on average 1.5957446808510638) internal successors, (300), 247 states have internal predecessors, (300), 36 states have call successors, (36), 14 states have call predecessors, (36), 17 states have return successors, (50), 39 states have call predecessors, (50), 36 states have call successors, (50) [2022-11-16 12:00:49,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 386 transitions. [2022-11-16 12:00:49,829 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 386 transitions. Word has length 25 [2022-11-16 12:00:49,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:00:49,830 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 386 transitions. [2022-11-16 12:00:49,830 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-11-16 12:00:49,830 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 386 transitions. [2022-11-16 12:00:49,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 12:00:49,831 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:00:49,832 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-11-16 12:00:49,847 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-16 12:00:50,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:00:50,044 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-11-16 12:00:50,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:00:50,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1805510171, now seen corresponding path program 1 times [2022-11-16 12:00:50,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:00:50,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368059332] [2022-11-16 12:00:50,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:00:50,046 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:00:50,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:00:50,047 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:00:50,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-16 12:00:50,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:50,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 12:00:50,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:00:50,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:00:50,194 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:00:50,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:00:50,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368059332] [2022-11-16 12:00:50,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368059332] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:00:50,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:00:50,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:00:50,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271629381] [2022-11-16 12:00:50,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:00:50,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:00:50,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:00:50,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:00:50,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:00:50,198 INFO L87 Difference]: Start difference. First operand 301 states and 386 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-11-16 12:00:50,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:00:50,250 INFO L93 Difference]: Finished difference Result 267 states and 318 transitions. [2022-11-16 12:00:50,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:00:50,251 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-11-16 12:00:50,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:00:50,253 INFO L225 Difference]: With dead ends: 267 [2022-11-16 12:00:50,253 INFO L226 Difference]: Without dead ends: 249 [2022-11-16 12:00:50,253 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-11-16 12:00:50,253 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 0 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 808 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-11-16 12:00:50,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 808 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:00:50,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-11-16 12:00:50,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2022-11-16 12:00:50,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 145 states have (on average 1.5586206896551724) internal successors, (226), 204 states have internal predecessors, (226), 29 states have call successors, (29), 12 states have call predecessors, (29), 15 states have return successors, (45), 32 states have call predecessors, (45), 29 states have call successors, (45) [2022-11-16 12:00:50,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 300 transitions. [2022-11-16 12:00:50,262 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 300 transitions. Word has length 30 [2022-11-16 12:00:50,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:00:50,262 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 300 transitions. [2022-11-16 12:00:50,262 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-11-16 12:00:50,263 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 300 transitions. [2022-11-16 12:00:50,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 12:00:50,264 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:00:50,264 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-11-16 12:00:50,277 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-16 12:00:50,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:00:50,476 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-11-16 12:00:50,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:00:50,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1626172482, now seen corresponding path program 1 times [2022-11-16 12:00:50,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:00:50,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2025598496] [2022-11-16 12:00:50,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:00:50,478 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:00:50,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:00:50,479 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:00:50,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-16 12:00:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:50,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 12:00:50,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:00:50,683 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 12:00:50,684 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:00:50,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:00:50,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2025598496] [2022-11-16 12:00:50,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2025598496] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:00:50,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:00:50,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:00:50,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586094999] [2022-11-16 12:00:50,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:00:50,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:00:50,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:00:50,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:00:50,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:00:50,685 INFO L87 Difference]: Start difference. First operand 249 states and 300 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-11-16 12:00:51,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:00:51,022 INFO L93 Difference]: Finished difference Result 255 states and 309 transitions. [2022-11-16 12:00:51,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:00:51,022 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-11-16 12:00:51,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:00:51,024 INFO L225 Difference]: With dead ends: 255 [2022-11-16 12:00:51,024 INFO L226 Difference]: Without dead ends: 251 [2022-11-16 12:00:51,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:00:51,025 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 211 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:00:51,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 1036 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:00:51,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-11-16 12:00:51,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2022-11-16 12:00:51,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 145 states have (on average 1.5448275862068965) internal successors, (224), 204 states have internal predecessors, (224), 29 states have call successors, (29), 12 states have call predecessors, (29), 15 states have return successors, (45), 32 states have call predecessors, (45), 29 states have call successors, (45) [2022-11-16 12:00:51,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 298 transitions. [2022-11-16 12:00:51,040 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 298 transitions. Word has length 31 [2022-11-16 12:00:51,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:00:51,041 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 298 transitions. [2022-11-16 12:00:51,041 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-11-16 12:00:51,041 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 298 transitions. [2022-11-16 12:00:51,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 12:00:51,044 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:00:51,044 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-11-16 12:00:51,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-16 12:00:51,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:00:51,256 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-11-16 12:00:51,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:00:51,256 INFO L85 PathProgramCache]: Analyzing trace with hash -575590880, now seen corresponding path program 1 times [2022-11-16 12:00:51,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:00:51,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1119391455] [2022-11-16 12:00:51,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:00:51,257 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:00:51,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:00:51,258 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:00:51,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-16 12:00:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:51,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-16 12:00:51,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:00:51,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:00:51,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:00:51,582 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-11-16 12:00:51,590 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-11-16 12:00:51,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-16 12:00:51,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-16 12:00:52,002 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:00:52,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:00:53,136 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:00:53,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:00:53,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1119391455] [2022-11-16 12:00:53,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1119391455] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:00:53,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:00:53,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2022-11-16 12:00:53,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076993340] [2022-11-16 12:00:53,137 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:00:53,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 12:00:53,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:00:53,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 12:00:53,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:00:53,138 INFO L87 Difference]: Start difference. First operand 249 states and 298 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-11-16 12:00:54,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:00:54,537 INFO L93 Difference]: Finished difference Result 267 states and 322 transitions. [2022-11-16 12:00:54,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 12:00:54,538 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-11-16 12:00:54,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:00:54,539 INFO L225 Difference]: With dead ends: 267 [2022-11-16 12:00:54,540 INFO L226 Difference]: Without dead ends: 267 [2022-11-16 12:00:54,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2022-11-16 12:00:54,541 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 44 mSDsluCounter, 2179 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 2386 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:00:54,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 2386 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 386 Invalid, 0 Unknown, 113 Unchecked, 1.1s Time] [2022-11-16 12:00:54,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-11-16 12:00:54,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 256. [2022-11-16 12:00:54,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 150 states have (on average 1.5333333333333334) internal successors, (230), 209 states have internal predecessors, (230), 29 states have call successors, (29), 14 states have call predecessors, (29), 17 states have return successors, (45), 32 states have call predecessors, (45), 29 states have call successors, (45) [2022-11-16 12:00:54,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 304 transitions. [2022-11-16 12:00:54,556 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 304 transitions. Word has length 31 [2022-11-16 12:00:54,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:00:54,557 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 304 transitions. [2022-11-16 12:00:54,557 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-11-16 12:00:54,557 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 304 transitions. [2022-11-16 12:00:54,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 12:00:54,558 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:00:54,558 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1] [2022-11-16 12:00:54,575 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-16 12:00:54,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:00:54,772 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting nondet_treeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 12:00:54,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:00:54,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1212258249, now seen corresponding path program 1 times [2022-11-16 12:00:54,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:00:54,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [620269244] [2022-11-16 12:00:54,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:00:54,773 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:00:54,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:00:54,774 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:00:54,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-16 12:00:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:55,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-16 12:00:55,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:00:55,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:00:55,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:00:55,296 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_576 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_576) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:00:55,339 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_576 (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_576) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:00:55,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:55,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:00:55,429 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:00:55,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 12:00:55,448 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 60 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 13 not checked. [2022-11-16 12:00:55,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:00:55,792 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:00:55,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [620269244] [2022-11-16 12:00:55,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [620269244] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:00:55,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1287521402] [2022-11-16 12:00:55,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:00:55,792 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 12:00:55,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 12:00:55,795 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 12:00:55,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2022-11-16 12:00:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:56,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-16 12:00:56,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:00:56,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:00:56,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:00:56,438 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_680 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_680))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:00:56,478 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_680 (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_680)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:00:56,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:56,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:00:56,593 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:00:56,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 12:00:56,600 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 60 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 13 not checked. [2022-11-16 12:00:56,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:00:58,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1287521402] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:00:58,861 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:00:58,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-11-16 12:00:58,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454820612] [2022-11-16 12:00:58,862 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:00:58,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:00:58,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:00:58,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:00:58,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=42, Unknown=4, NotChecked=60, Total=132 [2022-11-16 12:00:58,863 INFO L87 Difference]: Start difference. First operand 256 states and 304 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 6 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-16 12:00:58,959 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_680 (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_680)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_576 (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_576) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 12:00:59,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:00:59,801 INFO L93 Difference]: Finished difference Result 261 states and 315 transitions. [2022-11-16 12:00:59,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:00:59,802 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 6 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) Word has length 51 [2022-11-16 12:00:59,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:00:59,804 INFO L225 Difference]: With dead ends: 261 [2022-11-16 12:00:59,805 INFO L226 Difference]: Without dead ends: 261 [2022-11-16 12:00:59,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 95 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=34, Invalid=53, Unknown=5, NotChecked=90, Total=182 [2022-11-16 12:00:59,806 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 66 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 1356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 889 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:00:59,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 399 Invalid, 1356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 452 Invalid, 0 Unknown, 889 Unchecked, 0.8s Time] [2022-11-16 12:00:59,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-11-16 12:00:59,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 257. [2022-11-16 12:00:59,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 151 states have (on average 1.5364238410596027) internal successors, (232), 209 states have internal predecessors, (232), 29 states have call successors, (29), 14 states have call predecessors, (29), 17 states have return successors, (45), 33 states have call predecessors, (45), 29 states have call successors, (45) [2022-11-16 12:00:59,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 306 transitions. [2022-11-16 12:00:59,815 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 306 transitions. Word has length 51 [2022-11-16 12:00:59,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:00:59,815 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 306 transitions. [2022-11-16 12:00:59,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 6 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-16 12:00:59,816 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 306 transitions. [2022-11-16 12:00:59,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 12:00:59,817 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:00:59,817 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-16 12:00:59,827 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2022-11-16 12:01:00,030 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-16 12:01:00,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:01:00,221 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting nondet_treeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 12:01:00,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:01:00,222 INFO L85 PathProgramCache]: Analyzing trace with hash 324404478, now seen corresponding path program 1 times [2022-11-16 12:01:00,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:01:00,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [560431370] [2022-11-16 12:01:00,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:00,222 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:01:00,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:01:00,224 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:01:00,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-16 12:01:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:01:00,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 12:01:00,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:01:00,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:01:00,476 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_737 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_737))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:01:00,511 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_737 (_ BitVec 1))) (and (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_737)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:01:00,596 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 12:01:00,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-16 12:01:00,601 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 13 not checked. [2022-11-16 12:01:00,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:01:00,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:01:00,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [560431370] [2022-11-16 12:01:00,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [560431370] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:01:00,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [641154027] [2022-11-16 12:01:00,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:00,729 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 12:01:00,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 12:01:00,731 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 12:01:00,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-11-16 12:01:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:01:00,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 12:01:00,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:01:01,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:01:01,031 WARN L855 $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-11-16 12:01:01,081 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 12:01:01,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-16 12:01:01,092 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 13 not checked. [2022-11-16 12:01:01,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:01:01,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [641154027] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:01:01,223 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:01:01,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2022-11-16 12:01:01,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974389052] [2022-11-16 12:01:01,223 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:01:01,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:01:01,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:01:01,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:01:01,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=15, Unknown=3, NotChecked=24, Total=56 [2022-11-16 12:01:01,225 INFO L87 Difference]: Start difference. First operand 257 states and 306 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-16 12:01:03,296 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |c_#valid|)) (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_737 (_ BitVec 1))) (and (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_737)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 12:01:03,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:01:03,818 INFO L93 Difference]: Finished difference Result 257 states and 305 transitions. [2022-11-16 12:01:03,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:01:03,819 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 31 [2022-11-16 12:01:03,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:01:03,820 INFO L225 Difference]: With dead ends: 257 [2022-11-16 12:01:03,821 INFO L226 Difference]: Without dead ends: 257 [2022-11-16 12:01:03,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=20, Invalid=21, Unknown=5, NotChecked=44, Total=90 [2022-11-16 12:01:03,822 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 64 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 650 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:01:03,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 275 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 254 Invalid, 0 Unknown, 650 Unchecked, 0.5s Time] [2022-11-16 12:01:03,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-11-16 12:01:03,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 256. [2022-11-16 12:01:03,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 150 states have (on average 1.5333333333333334) internal successors, (230), 209 states have internal predecessors, (230), 29 states have call successors, (29), 14 states have call predecessors, (29), 17 states have return successors, (45), 32 states have call predecessors, (45), 29 states have call successors, (45) [2022-11-16 12:01:03,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 304 transitions. [2022-11-16 12:01:03,831 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 304 transitions. Word has length 31 [2022-11-16 12:01:03,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:01:03,832 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 304 transitions. [2022-11-16 12:01:03,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-16 12:01:03,832 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 304 transitions. [2022-11-16 12:01:03,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-16 12:01:03,833 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:01:03,833 INFO L195 NwaCegarLoop]: trace histogram [7, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1] [2022-11-16 12:01:03,841 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2022-11-16 12:01:04,045 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-11-16 12:01:04,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:01:04,237 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 12:01:04,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:01:04,238 INFO L85 PathProgramCache]: Analyzing trace with hash -2001744789, now seen corresponding path program 2 times [2022-11-16 12:01:04,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:01:04,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406534118] [2022-11-16 12:01:04,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:01:04,239 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:01:04,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:01:04,240 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:01:04,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-11-16 12:01:04,622 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:01:04,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:01:04,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-16 12:01:04,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:01:04,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:01:04,669 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_918 (_ BitVec 1))) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_918) |c_#valid|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:01:04,694 WARN L855 $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-11-16 12:01:04,852 INFO L321 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2022-11-16 12:01:04,853 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 4 case distinctions, treesize of input 22 treesize of output 38 [2022-11-16 12:01:04,870 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 77 proven. 7 refuted. 0 times theorem prover too weak. 34 trivial. 23 not checked. [2022-11-16 12:01:04,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:01:07,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:01:07,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406534118] [2022-11-16 12:01:07,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406534118] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:01:07,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1383668556] [2022-11-16 12:01:07,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:01:07,003 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 12:01:07,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 12:01:07,005 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 12:01:07,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2022-11-16 12:01:07,420 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:01:07,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354441644] [2022-11-16 12:01:07,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:01:07,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:01:07,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:01:07,426 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:01:07,429 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 1 [2022-11-16 12:01:07,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-16 12:01:07,749 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:01:07,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:01:07,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-16 12:01:07,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:01:07,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:01:07,786 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1167 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_1167))) is different from true [2022-11-16 12:01:07,799 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1168 (_ BitVec 1))) (= (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_1168) |c_#valid|)) is different from true [2022-11-16 12:01:09,883 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1167 (_ BitVec 1)) (v_nondet_tree_~n~0.base_66 (_ BitVec 32))) (= |c_#valid| (store (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_1167) v_nondet_tree_~n~0.base_66 (_ bv1 1)))) is different from true [2022-11-16 12:01:11,964 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1167 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_66 (_ BitVec 32))) (let ((.cse0 (store (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_1167) v_nondet_tree_~n~0.base_66 (_ bv1 1)))) (and (= |c_#valid| .cse0) (= (bvadd (_ bv1 1) (select .cse0 nondet_tree_~n~0.base)) (_ bv0 1))))) is different from true [2022-11-16 12:01:12,034 INFO L321 Elim1Store]: treesize reduction 46, result has 29.2 percent of original size [2022-11-16 12:01:12,034 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 31 treesize of output 45 [2022-11-16 12:01:12,048 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 77 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 28 not checked. [2022-11-16 12:01:12,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:01:12,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354441644] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:01:12,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:01:12,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 12 [2022-11-16 12:01:12,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714789411] [2022-11-16 12:01:12,230 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:01:12,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-16 12:01:12,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:01:12,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 12:01:12,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=53, Unknown=9, NotChecked=114, Total=210 [2022-11-16 12:01:12,231 INFO L87 Difference]: Start difference. First operand 256 states and 304 transitions. Second operand has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 9 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (11), 7 states have call predecessors, (11), 9 states have call successors, (11) [2022-11-16 12:01:20,366 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1168 (_ BitVec 1))) (= (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_1168) |c_#valid|)) (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-11-16 12:01:24,409 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |c_#valid|)) (exists ((v_ArrVal_1167 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_66 (_ BitVec 32))) (let ((.cse0 (store (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_1167) v_nondet_tree_~n~0.base_66 (_ bv1 1)))) (and (= |c_#valid| .cse0) (= (bvadd (_ bv1 1) (select .cse0 nondet_tree_~n~0.base)) (_ bv0 1)))))) is different from true [2022-11-16 12:01:29,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:01:29,015 INFO L93 Difference]: Finished difference Result 262 states and 316 transitions. [2022-11-16 12:01:29,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:01:29,016 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 9 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (11), 7 states have call predecessors, (11), 9 states have call successors, (11) Word has length 59 [2022-11-16 12:01:29,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:01:29,018 INFO L225 Difference]: With dead ends: 262 [2022-11-16 12:01:29,018 INFO L226 Difference]: Without dead ends: 262 [2022-11-16 12:01:29,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 110 SyntacticMatches, 9 SemanticMatches, 17 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=52, Invalid=75, Unknown=15, NotChecked=200, Total=342 [2022-11-16 12:01:29,019 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 65 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 1984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1722 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:01:29,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 479 Invalid, 1984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 249 Invalid, 0 Unknown, 1722 Unchecked, 0.5s Time] [2022-11-16 12:01:29,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-11-16 12:01:29,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2022-11-16 12:01:29,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 154 states have (on average 1.525974025974026) internal successors, (235), 212 states have internal predecessors, (235), 29 states have call successors, (29), 14 states have call predecessors, (29), 18 states have return successors, (52), 34 states have call predecessors, (52), 29 states have call successors, (52) [2022-11-16 12:01:29,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 316 transitions. [2022-11-16 12:01:29,037 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 316 transitions. Word has length 59 [2022-11-16 12:01:29,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:01:29,038 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 316 transitions. [2022-11-16 12:01:29,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 9 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (11), 7 states have call predecessors, (11), 9 states have call successors, (11) [2022-11-16 12:01:29,038 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 316 transitions. [2022-11-16 12:01:29,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-16 12:01:29,039 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:01:29,039 INFO L195 NwaCegarLoop]: trace histogram [8, 6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1] [2022-11-16 12:01:29,048 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-16 12:01:29,257 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-11-16 12:01:29,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:01:29,448 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-11-16 12:01:29,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:01:29,449 INFO L85 PathProgramCache]: Analyzing trace with hash -610355630, now seen corresponding path program 2 times [2022-11-16 12:01:29,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:01:29,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [504166796] [2022-11-16 12:01:29,449 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:01:29,449 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:01:29,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:01:29,450 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:01:29,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-11-16 12:01:29,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:01:29,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:01:29,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-16 12:01:29,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:01:29,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:01:29,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:01:30,008 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1319 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1319) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:01:30,041 WARN L855 $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-11-16 12:01:30,101 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_77 (_ BitVec 32)) (v_ArrVal_1319 (_ BitVec 32))) (and (= (store (store |c_old(#length)| v_nondet_tree_~n~0.base_77 v_ArrVal_1319) nondet_tree_~n~0.base (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_77)))) is different from true [2022-11-16 12:01:30,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:01:30,234 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-16 12:01:30,234 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-11-16 12:01:30,251 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:01:30,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 12:01:30,294 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 105 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 30 not checked. [2022-11-16 12:01:30,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:01:30,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:01:30,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [504166796] [2022-11-16 12:01:30,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [504166796] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:01:30,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1078523370] [2022-11-16 12:01:30,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:01:30,667 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 12:01:30,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 12:01:30,668 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 12:01:30,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2022-11-16 12:01:31,307 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:01:31,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:01:31,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-16 12:01:31,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:01:31,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:01:31,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:01:31,409 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1471 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1471) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:01:31,496 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_88 (_ BitVec 32)) (v_ArrVal_1471 (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1471) v_nondet_tree_~n~0.base_88 (_ bv12 32))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:01:31,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:01:31,613 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-16 12:01:31,614 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-11-16 12:01:31,635 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:01:31,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 12:01:31,657 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 105 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 30 not checked. [2022-11-16 12:01:31,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:01:34,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1078523370] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:01:34,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:01:34,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-11-16 12:01:34,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857571858] [2022-11-16 12:01:34,088 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:01:34,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:01:34,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:01:34,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:01:34,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=43, Unknown=5, NotChecked=80, Total=156 [2022-11-16 12:01:34,089 INFO L87 Difference]: Start difference. First operand 261 states and 316 transitions. Second operand has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 7 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2022-11-16 12:01:34,617 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_88 (_ BitVec 32)) (v_ArrVal_1471 (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1471) v_nondet_tree_~n~0.base_88 (_ bv12 32))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_77 (_ BitVec 32)) (v_ArrVal_1319 (_ BitVec 32))) (and (= (store (store |c_old(#length)| v_nondet_tree_~n~0.base_77 v_ArrVal_1319) nondet_tree_~n~0.base (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_77))))) is different from true [2022-11-16 12:01:34,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:01:34,772 INFO L93 Difference]: Finished difference Result 271 states and 332 transitions. [2022-11-16 12:01:34,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:01:34,779 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), 7 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) Word has length 67 [2022-11-16 12:01:34,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:01:34,781 INFO L225 Difference]: With dead ends: 271 [2022-11-16 12:01:34,781 INFO L226 Difference]: Without dead ends: 271 [2022-11-16 12:01:34,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 125 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=43, Invalid=64, Unknown=7, NotChecked=126, Total=240 [2022-11-16 12:01:34,784 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 120 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1064 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:01:34,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 294 Invalid, 1329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 226 Invalid, 0 Unknown, 1064 Unchecked, 0.5s Time] [2022-11-16 12:01:34,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-11-16 12:01:34,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2022-11-16 12:01:34,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 161 states have (on average 1.4968944099378882) internal successors, (241), 220 states have internal predecessors, (241), 31 states have call successors, (31), 14 states have call predecessors, (31), 19 states have return successors, (60), 36 states have call predecessors, (60), 31 states have call successors, (60) [2022-11-16 12:01:34,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 332 transitions. [2022-11-16 12:01:34,795 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 332 transitions. Word has length 67 [2022-11-16 12:01:34,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:01:34,795 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 332 transitions. [2022-11-16 12:01:34,795 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), 7 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2022-11-16 12:01:34,796 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 332 transitions. [2022-11-16 12:01:34,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-16 12:01:34,796 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:01:34,797 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-11-16 12:01:34,813 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-11-16 12:01:35,016 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2022-11-16 12:01:35,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt [2022-11-16 12:01:35,212 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting minErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 12:01:35,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:01:35,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1749891935, now seen corresponding path program 2 times [2022-11-16 12:01:35,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:01:35,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633989351] [2022-11-16 12:01:35,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:01:35,213 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:01:35,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:01:35,214 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:01:35,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-11-16 12:01:35,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:01:35,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:01:35,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-16 12:01:35,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:01:35,634 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 12:01:35,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:01:36,495 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-11-16 12:01:36,661 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 12:01:36,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:01:36,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633989351] [2022-11-16 12:01:36,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1633989351] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:01:36,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:01:36,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2022-11-16 12:01:36,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395959548] [2022-11-16 12:01:36,662 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:01:36,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 12:01:36,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:01:36,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 12:01:36,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2022-11-16 12:01:36,663 INFO L87 Difference]: Start difference. First operand 271 states and 332 transitions. Second operand has 18 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 7 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-16 12:01:42,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:01:42,380 INFO L93 Difference]: Finished difference Result 275 states and 336 transitions. [2022-11-16 12:01:42,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:01:42,381 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 7 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) Word has length 39 [2022-11-16 12:01:42,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:01:42,382 INFO L225 Difference]: With dead ends: 275 [2022-11-16 12:01:42,382 INFO L226 Difference]: Without dead ends: 275 [2022-11-16 12:01:42,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2022-11-16 12:01:42,383 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 132 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 1616 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 1711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:01:42,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1298 Invalid, 1711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1616 Invalid, 0 Unknown, 54 Unchecked, 5.3s Time] [2022-11-16 12:01:42,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-11-16 12:01:42,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 271. [2022-11-16 12:01:42,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 161 states have (on average 1.484472049689441) internal successors, (239), 220 states have internal predecessors, (239), 31 states have call successors, (31), 14 states have call predecessors, (31), 19 states have return successors, (60), 36 states have call predecessors, (60), 31 states have call successors, (60) [2022-11-16 12:01:42,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 330 transitions. [2022-11-16 12:01:42,403 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 330 transitions. Word has length 39 [2022-11-16 12:01:42,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:01:42,404 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 330 transitions. [2022-11-16 12:01:42,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 7 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-16 12:01:42,404 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 330 transitions. [2022-11-16 12:01:42,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-16 12:01:42,407 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:01:42,407 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1] [2022-11-16 12:01:42,420 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-16 12:01:42,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:01:42,620 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 12:01:42,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:01:42,620 INFO L85 PathProgramCache]: Analyzing trace with hash -457467550, now seen corresponding path program 3 times [2022-11-16 12:01:42,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:01:42,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [576022647] [2022-11-16 12:01:42,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:01:42,621 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:01:42,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:01:42,622 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:01:42,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-11-16 12:01:42,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-16 12:01:42,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:01:43,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-16 12:01:43,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:01:43,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:01:43,061 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1674 (_ BitVec 1))) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_1674) |c_#valid|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:01:43,089 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_1674 (_ BitVec 1))) (and (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_1674) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:01:43,111 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1675 (_ BitVec 1))) (= (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_1675) |c_#valid|)) is different from true [2022-11-16 12:01:43,156 WARN L855 $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-11-16 12:01:45,272 INFO L321 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2022-11-16 12:01:45,272 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 4 case distinctions, treesize of input 22 treesize of output 38 [2022-11-16 12:01:45,285 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 91 proven. 8 refuted. 0 times theorem prover too weak. 45 trivial. 22 not checked. [2022-11-16 12:01:45,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:01:45,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:01:45,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [576022647] [2022-11-16 12:01:45,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [576022647] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:01:45,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1879787373] [2022-11-16 12:01:45,672 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:01:45,672 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 12:01:45,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 12:01:45,675 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 12:01:45,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2022-11-16 12:01:46,270 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-16 12:01:46,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:01:46,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-16 12:01:46,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:01:46,298 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1824 (_ BitVec 1))) (= (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_1824) |c_#valid|)) is different from true [2022-11-16 12:01:46,322 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1825 (_ BitVec 1))) (= (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_1825) |c_#valid|)) is different from true [2022-11-16 12:01:46,412 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_123 (_ BitVec 32)) (v_ArrVal_1824 (_ BitVec 1))) (= |c_#valid| (store (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_1824) v_nondet_tree_~n~0.base_123 (_ bv1 1)))) is different from true [2022-11-16 12:01:48,525 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:01:48,557 INFO L321 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2022-11-16 12:01:48,557 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 17 treesize of output 31 [2022-11-16 12:01:48,572 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 90 proven. 9 refuted. 0 times theorem prover too weak. 48 trivial. 19 not checked. [2022-11-16 12:01:48,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:01:48,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1879787373] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:01:48,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:01:48,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2022-11-16 12:01:48,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428508986] [2022-11-16 12:01:48,860 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:01:48,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 12:01:48,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:01:48,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 12:01:48,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=61, Unknown=9, NotChecked=154, Total=272 [2022-11-16 12:01:48,861 INFO L87 Difference]: Start difference. First operand 271 states and 330 transitions. Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 7 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2022-11-16 12:01:53,136 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (= (bvadd (select |c_#valid| nondet_tree_~n~0.base) (_ bv1 1)) (_ bv0 1)) (exists ((v_ArrVal_1675 (_ BitVec 1))) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_1675) |c_#valid|)))) (exists ((v_ArrVal_1824 (_ BitVec 1))) (= (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_1824) |c_#valid|)) (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_1674 (_ BitVec 1))) (and (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_1674) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (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-11-16 12:01:57,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:01:57,698 INFO L93 Difference]: Finished difference Result 277 states and 343 transitions. [2022-11-16 12:01:57,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:01:57,698 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 7 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) Word has length 63 [2022-11-16 12:01:57,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:01:57,700 INFO L225 Difference]: With dead ends: 277 [2022-11-16 12:01:57,700 INFO L226 Difference]: Without dead ends: 277 [2022-11-16 12:01:57,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 115 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=66, Invalid=86, Unknown=12, NotChecked=216, Total=380 [2022-11-16 12:01:57,701 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 70 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 1951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1674 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:01:57,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 338 Invalid, 1951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 261 Invalid, 0 Unknown, 1674 Unchecked, 0.5s Time] [2022-11-16 12:01:57,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-11-16 12:01:57,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 275. [2022-11-16 12:01:57,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 164 states have (on average 1.4817073170731707) internal successors, (243), 223 states have internal predecessors, (243), 31 states have call successors, (31), 14 states have call predecessors, (31), 20 states have return successors, (69), 37 states have call predecessors, (69), 31 states have call successors, (69) [2022-11-16 12:01:57,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 343 transitions. [2022-11-16 12:01:57,712 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 343 transitions. Word has length 63 [2022-11-16 12:01:57,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:01:57,713 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 343 transitions. [2022-11-16 12:01:57,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 7 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2022-11-16 12:01:57,713 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 343 transitions. [2022-11-16 12:01:57,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-16 12:01:57,714 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:01:57,714 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2022-11-16 12:01:57,719 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2022-11-16 12:01:57,929 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-11-16 12:01:58,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:01:58,120 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting nondet_treeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 12:01:58,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:01:58,120 INFO L85 PathProgramCache]: Analyzing trace with hash -824897625, now seen corresponding path program 3 times [2022-11-16 12:01:58,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:01:58,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1605158022] [2022-11-16 12:01:58,120 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:01:58,120 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:01:58,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:01:58,121 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:01:58,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-11-16 12:01:58,526 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-16 12:01:58,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:01:58,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-16 12:01:58,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:01:58,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:01:58,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:01:58,687 WARN L855 $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-11-16 12:01:58,775 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1931 (_ BitVec 32)) (v_nondet_tree_~n~0.base_137 (_ BitVec 32)) (|nondet_tree_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |nondet_tree_#res.base|)) (= (store (store |c_old(#length)| |nondet_tree_#res.base| v_ArrVal_1931) v_nondet_tree_~n~0.base_137 (_ bv12 32)) |c_#length|))) is different from true [2022-11-16 12:01:58,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:01:58,833 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-16 12:01:58,833 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-11-16 12:01:58,848 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:01:58,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 12:01:58,885 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 41 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 26 not checked. [2022-11-16 12:01:58,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:01:59,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:01:59,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1605158022] [2022-11-16 12:01:59,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1605158022] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:01:59,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2081991299] [2022-11-16 12:01:59,355 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:01:59,356 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 12:01:59,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 12:01:59,356 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 12:01:59,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2022-11-16 12:01:59,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-16 12:01:59,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:02:00,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-16 12:02:00,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:02:00,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:02:00,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:02:00,186 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2037 (_ 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_2037) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:02:00,388 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2037 (_ BitVec 32)) (v_ArrVal_1931 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2037) |c_nondet_tree_#t~ret9.base| v_ArrVal_1931) |c_#length|) (= (_ bv0 1) (select (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |c_nondet_tree_#t~ret9.base|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:02:00,410 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2037 (_ BitVec 32)) (v_ArrVal_1931 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (|nondet_tree_#t~ret9.base| (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2037) |nondet_tree_#t~ret9.base| v_ArrVal_1931) |c_#length|) (= (_ bv0 1) (select (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |nondet_tree_#t~ret9.base|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:02:00,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:02:00,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:02:00,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:02:00,464 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-11-16 12:02:00,495 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2022-11-16 12:02:00,495 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-11-16 12:02:00,506 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 41 proven. 26 refuted. 0 times theorem prover too weak. 9 trivial. 14 not checked. [2022-11-16 12:02:00,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:02:03,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2081991299] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:02:03,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:02:03,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 14 [2022-11-16 12:02:03,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666732424] [2022-11-16 12:02:03,316 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:02:03,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 12:02:03,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:02:03,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 12:02:03,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=130, Unknown=6, NotChecked=130, Total=306 [2022-11-16 12:02:03,317 INFO L87 Difference]: Start difference. First operand 275 states and 343 transitions. Second operand has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 6 states have call successors, (10), 3 states have call predecessors, (10), 7 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2022-11-16 12:02:14,807 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2037 (_ BitVec 32)) (v_ArrVal_1931 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (|nondet_tree_#t~ret9.base| (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2037) |nondet_tree_#t~ret9.base| v_ArrVal_1931) |c_#length|) (= (_ bv0 1) (select (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |nondet_tree_#t~ret9.base|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((v_ArrVal_1931 (_ BitVec 32)) (v_nondet_tree_~n~0.base_137 (_ BitVec 32)) (|nondet_tree_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |nondet_tree_#res.base|)) (= (store (store |c_old(#length)| |nondet_tree_#res.base| v_ArrVal_1931) v_nondet_tree_~n~0.base_137 (_ bv12 32)) |c_#length|)))) is different from true [2022-11-16 12:02:15,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:02:15,655 INFO L93 Difference]: Finished difference Result 281 states and 362 transitions. [2022-11-16 12:02:15,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:02:15,656 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 6 states have call successors, (10), 3 states have call predecessors, (10), 7 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) Word has length 49 [2022-11-16 12:02:15,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:02:15,658 INFO L225 Difference]: With dead ends: 281 [2022-11-16 12:02:15,658 INFO L226 Difference]: Without dead ends: 281 [2022-11-16 12:02:15,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=74, Invalid=281, Unknown=11, NotChecked=234, Total=600 [2022-11-16 12:02:15,659 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 69 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 2200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1720 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:02:15,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 687 Invalid, 2200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 462 Invalid, 0 Unknown, 1720 Unchecked, 1.0s Time] [2022-11-16 12:02:15,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-11-16 12:02:15,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 278. [2022-11-16 12:02:15,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 166 states have (on average 1.4698795180722892) internal successors, (244), 225 states have internal predecessors, (244), 32 states have call successors, (32), 14 states have call predecessors, (32), 20 states have return successors, (74), 38 states have call predecessors, (74), 32 states have call successors, (74) [2022-11-16 12:02:15,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 350 transitions. [2022-11-16 12:02:15,669 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 350 transitions. Word has length 49 [2022-11-16 12:02:15,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:02:15,670 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 350 transitions. [2022-11-16 12:02:15,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 6 states have call successors, (10), 3 states have call predecessors, (10), 7 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2022-11-16 12:02:15,670 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 350 transitions. [2022-11-16 12:02:15,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-16 12:02:15,671 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:02:15,671 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-11-16 12:02:15,679 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2022-11-16 12:02:15,887 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-11-16 12:02:16,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:02:16,077 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting nondet_treeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 12:02:16,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:02:16,077 INFO L85 PathProgramCache]: Analyzing trace with hash -352342486, now seen corresponding path program 2 times [2022-11-16 12:02:16,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:02:16,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1740232760] [2022-11-16 12:02:16,078 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:02:16,078 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:02:16,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:02:16,079 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:02:16,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-11-16 12:02:16,452 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:02:16,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:02:16,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-16 12:02:16,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:02:16,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:02:16,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:02:16,554 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2152 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2152) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:02:16,588 WARN L855 $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-11-16 12:02:16,648 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_155 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2152 (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2152) v_nondet_tree_~n~0.base_155 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:02:16,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:02:16,758 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-16 12:02:16,758 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-11-16 12:02:16,803 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:02:16,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 12:02:16,860 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 40 not checked. [2022-11-16 12:02:16,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:02:17,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:02:17,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1740232760] [2022-11-16 12:02:17,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1740232760] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:02:17,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2020893955] [2022-11-16 12:02:17,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:02:17,618 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 12:02:17,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 12:02:17,619 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 12:02:17,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-11-16 12:02:18,175 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:02:18,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:02:18,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-16 12:02:18,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:02:18,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:02:18,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:02:18,270 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2258 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2258))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:02:18,365 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2258 (_ BitVec 32)) (v_nondet_tree_~n~0.base_166 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2258) v_nondet_tree_~n~0.base_166 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:02:18,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:02:18,486 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-16 12:02:18,486 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-11-16 12:02:18,527 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:02:18,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 12:02:18,580 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 40 not checked. [2022-11-16 12:02:18,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:02:22,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2020893955] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:02:22,467 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:02:22,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-11-16 12:02:22,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251849486] [2022-11-16 12:02:22,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:02:22,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:02:22,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:02:22,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:02:22,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=83, Unknown=6, NotChecked=110, Total=240 [2022-11-16 12:02:22,471 INFO L87 Difference]: Start difference. First operand 278 states and 350 transitions. Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 8 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-16 12:02:23,279 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2258 (_ BitVec 32)) (v_nondet_tree_~n~0.base_166 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2258) v_nondet_tree_~n~0.base_166 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((v_nondet_tree_~n~0.base_155 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2152 (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2152) v_nondet_tree_~n~0.base_155 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 12:02:23,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:02:23,619 INFO L93 Difference]: Finished difference Result 294 states and 385 transitions. [2022-11-16 12:02:23,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:02:23,620 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 8 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) Word has length 49 [2022-11-16 12:02:23,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:02:23,622 INFO L225 Difference]: With dead ends: 294 [2022-11-16 12:02:23,622 INFO L226 Difference]: Without dead ends: 294 [2022-11-16 12:02:23,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=60, Invalid=112, Unknown=8, NotChecked=162, Total=342 [2022-11-16 12:02:23,623 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 65 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 1606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1150 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:02:23,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 415 Invalid, 1606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 441 Invalid, 0 Unknown, 1150 Unchecked, 1.0s Time] [2022-11-16 12:02:23,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-11-16 12:02:23,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 290. [2022-11-16 12:02:23,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 174 states have (on average 1.4482758620689655) internal successors, (252), 236 states have internal predecessors, (252), 35 states have call successors, (35), 14 states have call predecessors, (35), 21 states have return successors, (89), 39 states have call predecessors, (89), 35 states have call successors, (89) [2022-11-16 12:02:23,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 376 transitions. [2022-11-16 12:02:23,642 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 376 transitions. Word has length 49 [2022-11-16 12:02:23,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:02:23,642 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 376 transitions. [2022-11-16 12:02:23,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 8 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-16 12:02:23,643 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 376 transitions. [2022-11-16 12:02:23,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-16 12:02:23,644 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:02:23,644 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-11-16 12:02:23,656 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2022-11-16 12:02:23,860 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-11-16 12:02:24,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:02:24,051 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting minErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 12:02:24,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:02:24,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1971504767, now seen corresponding path program 1 times [2022-11-16 12:02:24,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:02:24,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1234148504] [2022-11-16 12:02:24,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:02:24,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:02:24,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:02:24,052 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:02:24,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-11-16 12:02:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:02:24,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-16 12:02:24,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:02:24,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:02:24,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-11-16 12:02:24,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-16 12:02:24,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-16 12:02:24,923 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:02:24,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:02:25,320 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:02:25,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:02:25,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1234148504] [2022-11-16 12:02:25,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1234148504] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:02:25,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:02:25,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 14 [2022-11-16 12:02:25,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961774630] [2022-11-16 12:02:25,321 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:02:25,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 12:02:25,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:02:25,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 12:02:25,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:02:25,323 INFO L87 Difference]: Start difference. First operand 290 states and 376 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-11-16 12:02:25,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:02:25,940 INFO L93 Difference]: Finished difference Result 331 states and 437 transitions. [2022-11-16 12:02:25,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 12:02:25,944 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-11-16 12:02:25,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:02:25,946 INFO L225 Difference]: With dead ends: 331 [2022-11-16 12:02:25,946 INFO L226 Difference]: Without dead ends: 331 [2022-11-16 12:02:25,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2022-11-16 12:02:25,948 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 47 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:02:25,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 1502 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 64 Unchecked, 0.3s Time] [2022-11-16 12:02:25,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-11-16 12:02:25,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 322. [2022-11-16 12:02:25,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 198 states have (on average 1.4343434343434343) internal successors, (284), 261 states have internal predecessors, (284), 40 states have call successors, (40), 17 states have call predecessors, (40), 24 states have return successors, (107), 43 states have call predecessors, (107), 40 states have call successors, (107) [2022-11-16 12:02:25,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 431 transitions. [2022-11-16 12:02:25,962 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 431 transitions. Word has length 38 [2022-11-16 12:02:25,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:02:25,963 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 431 transitions. [2022-11-16 12:02:25,963 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-11-16 12:02:25,963 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 431 transitions. [2022-11-16 12:02:25,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 12:02:25,965 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:02:25,965 INFO L195 NwaCegarLoop]: trace histogram [7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1] [2022-11-16 12:02:25,978 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-11-16 12:02:26,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:02:26,178 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting nondet_treeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 12:02:26,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:02:26,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1701152456, now seen corresponding path program 3 times [2022-11-16 12:02:26,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:02:26,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892016291] [2022-11-16 12:02:26,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:02:26,179 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:02:26,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:02:26,180 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:02:26,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -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-11-16 12:02:26,597 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-16 12:02:26,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:02:26,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-16 12:02:26,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:02:26,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:02:26,736 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2406 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2406))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:02:26,774 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2406 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2406)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:02:26,803 WARN L855 $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-11-16 12:02:26,870 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2406 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_180 (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2406) v_nondet_tree_~n~0.base_180 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:02:26,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:02:26,951 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-16 12:02:26,952 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-11-16 12:02:26,973 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:02:26,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 12:02:26,989 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 49 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 40 not checked. [2022-11-16 12:02:26,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:02:27,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:02:27,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892016291] [2022-11-16 12:02:27,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892016291] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:02:27,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1762088031] [2022-11-16 12:02:27,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:02:27,382 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 12:02:27,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 12:02:27,383 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 12:02:27,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2022-11-16 12:02:28,019 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-16 12:02:28,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:02:28,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-16 12:02:28,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:02:28,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:02:28,181 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2517 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |c_#valid|) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2517)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:02:28,384 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2517 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2519 (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |c_nondet_tree_#t~ret9.base|)) (= |c_#length| (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2517) |c_nondet_tree_#t~ret9.base| v_ArrVal_2519)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:02:28,406 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2517 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2519 (_ BitVec 32)) (|nondet_tree_#t~ret9.base| (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2517) |nondet_tree_#t~ret9.base| v_ArrVal_2519)) (= (_ bv0 1) (select (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |nondet_tree_#t~ret9.base|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:02:28,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:02:28,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:02:28,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:02:28,457 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-11-16 12:02:28,490 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2022-11-16 12:02:28,490 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-11-16 12:02:28,496 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 48 proven. 37 refuted. 0 times theorem prover too weak. 14 trivial. 19 not checked. [2022-11-16 12:02:28,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:02:32,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1762088031] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:02:32,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:02:32,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 15 [2022-11-16 12:02:32,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732111249] [2022-11-16 12:02:32,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:02:32,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 12:02:32,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:02:32,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 12:02:32,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=110, Unknown=8, NotChecked=182, Total=342 [2022-11-16 12:02:32,062 INFO L87 Difference]: Start difference. First operand 322 states and 431 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 9 states have call successors, (14), 3 states have call predecessors, (14), 7 states have return successors, (13), 8 states have call predecessors, (13), 9 states have call successors, (13) [2022-11-16 12:02:32,683 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2517 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2519 (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |c_nondet_tree_#t~ret9.base|)) (= |c_#length| (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2517) |c_nondet_tree_#t~ret9.base| v_ArrVal_2519)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((v_ArrVal_2406 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_180 (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2406) v_nondet_tree_~n~0.base_180 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 12:02:32,692 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2406 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_180 (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2406) v_nondet_tree_~n~0.base_180 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((v_ArrVal_2517 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2519 (_ BitVec 32)) (|nondet_tree_#t~ret9.base| (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2517) |nondet_tree_#t~ret9.base| v_ArrVal_2519)) (= (_ bv0 1) (select (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |nondet_tree_#t~ret9.base|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 12:02:33,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:02:33,473 INFO L93 Difference]: Finished difference Result 324 states and 433 transitions. [2022-11-16 12:02:33,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:02:33,474 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 9 states have call successors, (14), 3 states have call predecessors, (14), 7 states have return successors, (13), 8 states have call predecessors, (13), 9 states have call successors, (13) Word has length 55 [2022-11-16 12:02:33,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:02:33,476 INFO L225 Difference]: With dead ends: 324 [2022-11-16 12:02:33,476 INFO L226 Difference]: Without dead ends: 324 [2022-11-16 12:02:33,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 96 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=70, Invalid=196, Unknown=10, NotChecked=324, Total=600 [2022-11-16 12:02:33,477 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 64 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 2360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1912 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:02:33,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 591 Invalid, 2360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 434 Invalid, 0 Unknown, 1912 Unchecked, 1.0s Time] [2022-11-16 12:02:33,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-11-16 12:02:33,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 323. [2022-11-16 12:02:33,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 199 states have (on average 1.4371859296482412) internal successors, (286), 261 states have internal predecessors, (286), 40 states have call successors, (40), 17 states have call predecessors, (40), 24 states have return successors, (107), 44 states have call predecessors, (107), 40 states have call successors, (107) [2022-11-16 12:02:33,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 433 transitions. [2022-11-16 12:02:33,489 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 433 transitions. Word has length 55 [2022-11-16 12:02:33,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:02:33,489 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 433 transitions. [2022-11-16 12:02:33,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 9 states have call successors, (14), 3 states have call predecessors, (14), 7 states have return successors, (13), 8 states have call predecessors, (13), 9 states have call successors, (13) [2022-11-16 12:02:33,490 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 433 transitions. [2022-11-16 12:02:33,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 12:02:33,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:02:33,491 INFO L195 NwaCegarLoop]: trace histogram [7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1] [2022-11-16 12:02:33,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2022-11-16 12:02:33,707 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-16 12:02:33,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:02:33,897 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting nondet_treeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 12:02:33,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:02:33,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1701152457, now seen corresponding path program 2 times [2022-11-16 12:02:33,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:02:33,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815563253] [2022-11-16 12:02:33,898 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:02:33,898 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:02:33,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:02:33,899 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:02:33,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -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-11-16 12:02:34,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:02:34,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:02:34,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-16 12:02:34,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:02:34,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:02:34,356 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2637 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_2637))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:02:34,384 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2637 (_ BitVec 1))) (and (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_2637)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:02:34,408 WARN L855 $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-11-16 12:02:34,561 INFO L321 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2022-11-16 12:02:34,561 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 4 case distinctions, treesize of input 22 treesize of output 38 [2022-11-16 12:02:34,577 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 48 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 31 not checked. [2022-11-16 12:02:34,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:02:36,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:02:36,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815563253] [2022-11-16 12:02:36,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815563253] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:02:36,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1902229104] [2022-11-16 12:02:36,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:02:36,728 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 12:02:36,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 12:02:36,729 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 12:02:36,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2022-11-16 12:02:37,248 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:02:37,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855183941] [2022-11-16 12:02:37,248 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:02:37,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:02:37,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:02:37,256 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:02:37,262 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (37)] Forceful destruction successful, exit code 1 [2022-11-16 12:02:37,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-11-16 12:02:37,578 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:02:37,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:02:37,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-16 12:02:37,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:02:37,614 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2851 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_2851))) is different from true [2022-11-16 12:02:37,647 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2852 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_2852))) is different from true [2022-11-16 12:02:39,753 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_210 (_ BitVec 32)) (v_ArrVal_2851 (_ BitVec 1))) (= |c_#valid| (store (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_2851) v_nondet_tree_~n~0.base_210 (_ bv1 1)))) is different from true [2022-11-16 12:02:41,841 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:02:41,883 INFO L321 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2022-11-16 12:02:41,883 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 17 treesize of output 31 [2022-11-16 12:02:41,900 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 62 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 20 not checked. [2022-11-16 12:02:41,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:02:42,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855183941] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:02:42,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:02:42,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 12 [2022-11-16 12:02:42,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745191955] [2022-11-16 12:02:42,288 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:02:42,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-16 12:02:42,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:02:42,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 12:02:42,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=76, Unknown=9, NotChecked=138, Total=272 [2022-11-16 12:02:42,290 INFO L87 Difference]: Start difference. First operand 323 states and 433 transitions. Second operand has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 8 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2022-11-16 12:02:57,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:02:57,320 INFO L93 Difference]: Finished difference Result 328 states and 449 transitions. [2022-11-16 12:02:57,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:02:57,321 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 8 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 55 [2022-11-16 12:02:57,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:02:57,323 INFO L225 Difference]: With dead ends: 328 [2022-11-16 12:02:57,323 INFO L226 Difference]: Without dead ends: 328 [2022-11-16 12:02:57,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 99 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=66, Invalid=103, Unknown=11, NotChecked=162, Total=342 [2022-11-16 12:02:57,324 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 66 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 1874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1603 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:02:57,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 470 Invalid, 1874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 258 Invalid, 0 Unknown, 1603 Unchecked, 0.7s Time] [2022-11-16 12:02:57,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-11-16 12:02:57,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 324. [2022-11-16 12:02:57,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 200 states have (on average 1.435) internal successors, (287), 261 states have internal predecessors, (287), 40 states have call successors, (40), 17 states have call predecessors, (40), 24 states have return successors, (107), 45 states have call predecessors, (107), 40 states have call successors, (107) [2022-11-16 12:02:57,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 434 transitions. [2022-11-16 12:02:57,345 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 434 transitions. Word has length 55 [2022-11-16 12:02:57,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:02:57,345 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 434 transitions. [2022-11-16 12:02:57,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 8 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2022-11-16 12:02:57,346 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 434 transitions. [2022-11-16 12:02:57,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-16 12:02:57,347 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:02:57,347 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-11-16 12:02:57,373 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-16 12:02:57,575 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-11-16 12:02:57,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:02:57,763 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting nondet_treeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 12:02:57,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:02:57,764 INFO L85 PathProgramCache]: Analyzing trace with hash 942364394, now seen corresponding path program 4 times [2022-11-16 12:02:57,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:02:57,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760481064] [2022-11-16 12:02:57,764 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 12:02:57,764 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:02:57,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:02:57,765 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:02:57,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2022-11-16 12:02:58,175 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 12:02:58,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:02:58,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-16 12:02:58,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:02:58,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:02:58,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:02:58,271 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2960 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2960) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:02:58,330 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2960 (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2960) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:02:58,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:02:58,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:02:58,427 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:02:58,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 12:02:58,488 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2961 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2961))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:02:58,532 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2961 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2961)))) is different from true [2022-11-16 12:02:58,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:02:58,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:02:58,633 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:02:58,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 12:02:58,642 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 20 trivial. 40 not checked. [2022-11-16 12:02:58,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:03:01,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:03:01,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1760481064] [2022-11-16 12:03:01,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1760481064] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:03:01,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [320756299] [2022-11-16 12:03:01,020 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 12:03:01,021 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 12:03:01,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 12:03:01,022 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 12:03:01,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2022-11-16 12:03:01,670 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 12:03:01,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:03:01,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-16 12:03:01,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:03:01,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:03:01,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:03:01,766 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_3065 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3065) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:03:01,821 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3065 (_ BitVec 32)) (nondet_tree_~n~0.base (_ 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_3065) |c_#length|))) is different from true [2022-11-16 12:03:01,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:03:01,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:03:01,932 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:03:01,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 12:03:01,985 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_3066 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3066) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:03:02,029 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3066 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3066) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:03:02,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:03:02,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:03:02,131 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:03:02,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 12:03:02,136 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 21 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 40 not checked. [2022-11-16 12:03:02,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:03:02,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [320756299] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:03:02,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:03:02,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2022-11-16 12:03:02,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658271156] [2022-11-16 12:03:02,377 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:03:02,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 12:03:02,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:03:02,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 12:03:02,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=45, Unknown=9, NotChecked=152, Total=240 [2022-11-16 12:03:02,379 INFO L87 Difference]: Start difference. First operand 324 states and 434 transitions. Second operand has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 10 states have call successors, (12), 3 states have call predecessors, (12), 6 states have return successors, (12), 5 states have call predecessors, (12), 9 states have call successors, (12) [2022-11-16 12:03:02,490 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2960 (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2960) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((v_ArrVal_2961 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2961)))) (exists ((v_ArrVal_3065 (_ BitVec 32)) (nondet_tree_~n~0.base (_ 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_3065) |c_#length|))) (exists ((v_ArrVal_3066 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3066) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 12:03:03,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:03:03,578 INFO L93 Difference]: Finished difference Result 326 states and 436 transitions. [2022-11-16 12:03:03,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:03:03,579 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 10 states have call successors, (12), 3 states have call predecessors, (12), 6 states have return successors, (12), 5 states have call predecessors, (12), 9 states have call successors, (12) Word has length 49 [2022-11-16 12:03:03,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:03:03,582 INFO L225 Difference]: With dead ends: 326 [2022-11-16 12:03:03,582 INFO L226 Difference]: Without dead ends: 326 [2022-11-16 12:03:03,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=42, Invalid=56, Unknown=10, NotChecked=198, Total=306 [2022-11-16 12:03:03,583 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 64 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 2136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1679 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:03:03,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 393 Invalid, 2136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 442 Invalid, 0 Unknown, 1679 Unchecked, 1.1s Time] [2022-11-16 12:03:03,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-11-16 12:03:03,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2022-11-16 12:03:03,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 201 states have (on average 1.4378109452736318) internal successors, (289), 261 states have internal predecessors, (289), 40 states have call successors, (40), 17 states have call predecessors, (40), 24 states have return successors, (107), 46 states have call predecessors, (107), 40 states have call successors, (107) [2022-11-16 12:03:03,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 436 transitions. [2022-11-16 12:03:03,597 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 436 transitions. Word has length 49 [2022-11-16 12:03:03,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:03:03,598 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 436 transitions. [2022-11-16 12:03:03,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 10 states have call successors, (12), 3 states have call predecessors, (12), 6 states have return successors, (12), 5 states have call predecessors, (12), 9 states have call successors, (12) [2022-11-16 12:03:03,599 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 436 transitions. [2022-11-16 12:03:03,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-16 12:03:03,600 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:03:03,600 INFO L195 NwaCegarLoop]: trace histogram [8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1] [2022-11-16 12:03:03,624 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2022-11-16 12:03:03,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (40)] Forceful destruction successful, exit code 0 [2022-11-16 12:03:04,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt [2022-11-16 12:03:04,017 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting nondet_treeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 12:03:04,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:03:04,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1980206119, now seen corresponding path program 5 times [2022-11-16 12:03:04,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:03:04,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [524114803] [2022-11-16 12:03:04,018 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 12:03:04,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:03:04,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:03:04,019 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:03:04,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2022-11-16 12:03:04,604 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-11-16 12:03:04,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:03:04,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-16 12:03:04,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:03:04,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:03:04,723 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_3181 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3181))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:03:04,772 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_3181 (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3181)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:03:04,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:03:04,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:03:04,880 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:03:04,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 12:03:04,933 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_3182 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3182))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:03:04,970 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_3182 (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3182)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:03:05,003 WARN L855 $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-11-16 12:03:05,075 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_3182 (_ BitVec 32)) (v_nondet_tree_~n~0.base_235 (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3182) v_nondet_tree_~n~0.base_235 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:03:05,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:03:05,159 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-16 12:03:05,159 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-11-16 12:03:05,182 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:03:05,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 12:03:05,198 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 36 trivial. 81 not checked. [2022-11-16 12:03:05,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:03:05,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:03:05,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [524114803] [2022-11-16 12:03:05,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [524114803] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:03:05,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1227588154] [2022-11-16 12:03:05,624 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 12:03:05,624 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 12:03:05,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 12:03:05,626 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 12:03:05,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (42)] Waiting until timeout for monitored process [2022-11-16 12:03:06,500 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-11-16 12:03:06,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:03:06,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 12:03:06,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:03:06,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:03:06,819 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3300 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3300) |c_#length|))) is different from true [2022-11-16 12:03:06,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:03:06,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:03:06,923 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 12:03:06,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-16 12:03:07,063 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_3301 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3301) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (exists ((v_ArrVal_3302 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_3302))))) is different from true [2022-11-16 12:03:07,134 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3301 (_ BitVec 32)) (v_ArrVal_3302 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_3302)) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3301) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:03:07,184 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_3303 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3303) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:03:07,228 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_3303 (_ 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_3303) |c_#length|))) is different from true [2022-11-16 12:03:07,309 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3301 (_ BitVec 32)) (v_ArrVal_3302 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_247 (_ BitVec 32)) (v_ArrVal_3303 (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3301) v_nondet_tree_~n~0.base_247 v_ArrVal_3303)) (= (select (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_3302) v_nondet_tree_~n~0.base_247) (_ bv0 1)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:03:07,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:03:07,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:03:07,432 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:03:07,433 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 1 case distinctions, treesize of input 15 treesize of output 23 [2022-11-16 12:03:07,523 INFO L321 Elim1Store]: treesize reduction 29, result has 43.1 percent of original size [2022-11-16 12:03:07,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 51 [2022-11-16 12:03:07,541 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 75 not checked. [2022-11-16 12:03:07,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:03:08,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1227588154] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:03:08,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:03:08,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2022-11-16 12:03:08,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125661914] [2022-11-16 12:03:08,820 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:03:08,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-16 12:03:08,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:03:08,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-16 12:03:08,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=111, Unknown=12, NotChecked=372, Total=552 [2022-11-16 12:03:08,822 INFO L87 Difference]: Start difference. First operand 325 states and 436 transitions. Second operand has 21 states, 20 states have (on average 3.1) internal successors, (62), 21 states have internal predecessors, (62), 14 states have call successors, (16), 3 states have call predecessors, (16), 8 states have return successors, (16), 11 states have call predecessors, (16), 13 states have call successors, (16) [2022-11-16 12:03:09,163 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) |c_#length|)) (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_3182 (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3182)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_3303 (_ 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_3303) |c_#length|))) (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_3181 (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3181)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (= (bvadd (select |c_#valid| nondet_tree_~n~0.base) (_ bv1 1)) (_ bv0 1)) (exists ((v_ArrVal_3300 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3300) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (exists ((v_ArrVal_3299 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_3299))))) (exists ((v_ArrVal_3301 (_ BitVec 32)) (v_ArrVal_3302 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_3302)) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3301) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 12:03:09,169 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) |c_#length|)) (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_3303 (_ 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_3303) |c_#length|))) (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_3181 (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3181)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((v_ArrVal_3300 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3300) |c_#length|)))) is different from true [2022-11-16 12:03:09,316 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3301 (_ BitVec 32)) (v_ArrVal_3302 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_247 (_ BitVec 32)) (v_ArrVal_3303 (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3301) v_nondet_tree_~n~0.base_247 v_ArrVal_3303)) (= (select (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_3302) v_nondet_tree_~n~0.base_247) (_ bv0 1)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_3182 (_ BitVec 32)) (v_nondet_tree_~n~0.base_235 (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3182) v_nondet_tree_~n~0.base_235 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 12:03:09,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:03:09,914 INFO L93 Difference]: Finished difference Result 326 states and 437 transitions. [2022-11-16 12:03:09,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:03:09,915 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.1) internal successors, (62), 21 states have internal predecessors, (62), 14 states have call successors, (16), 3 states have call predecessors, (16), 8 states have return successors, (16), 11 states have call predecessors, (16), 13 states have call successors, (16) Word has length 59 [2022-11-16 12:03:09,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:03:09,917 INFO L225 Difference]: With dead ends: 326 [2022-11-16 12:03:09,917 INFO L226 Difference]: Without dead ends: 326 [2022-11-16 12:03:09,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=76, Invalid=151, Unknown=15, NotChecked=570, Total=812 [2022-11-16 12:03:09,918 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 119 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 3172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2906 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:03:09,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 399 Invalid, 3172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 227 Invalid, 0 Unknown, 2906 Unchecked, 0.7s Time] [2022-11-16 12:03:09,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-11-16 12:03:09,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2022-11-16 12:03:09,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 201 states have (on average 1.4378109452736318) internal successors, (289), 261 states have internal predecessors, (289), 40 states have call successors, (40), 17 states have call predecessors, (40), 24 states have return successors, (107), 46 states have call predecessors, (107), 40 states have call successors, (107) [2022-11-16 12:03:09,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 436 transitions. [2022-11-16 12:03:09,932 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 436 transitions. Word has length 59 [2022-11-16 12:03:09,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:03:09,933 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 436 transitions. [2022-11-16 12:03:09,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.1) internal successors, (62), 21 states have internal predecessors, (62), 14 states have call successors, (16), 3 states have call predecessors, (16), 8 states have return successors, (16), 11 states have call predecessors, (16), 13 states have call successors, (16) [2022-11-16 12:03:09,933 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 436 transitions. [2022-11-16 12:03:09,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-16 12:03:09,935 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:03:09,935 INFO L195 NwaCegarLoop]: trace histogram [10, 8, 8, 8, 8, 7, 6, 6, 6, 6, 4, 3, 3, 1, 1, 1, 1] [2022-11-16 12:03:09,963 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-16 12:03:10,158 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (42)] Forceful destruction successful, exit code 0 [2022-11-16 12:03:10,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt [2022-11-16 12:03:10,352 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting nondet_treeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 12:03:10,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:03:10,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1757529950, now seen corresponding path program 3 times [2022-11-16 12:03:10,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:03:10,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591767137] [2022-11-16 12:03:10,353 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:03:10,354 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:03:10,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:03:10,354 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:03:10,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -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-11-16 12:03:10,764 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-16 12:03:10,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:03:10,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 12:03:10,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:03:10,813 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_3506 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_3506))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:03:10,846 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3506 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_3506)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:03:10,928 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 12:03:10,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-16 12:03:10,933 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 7 not checked. [2022-11-16 12:03:10,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:03:11,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:03:11,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [591767137] [2022-11-16 12:03:11,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [591767137] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:03:11,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [666039047] [2022-11-16 12:03:11,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:03:11,091 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 12:03:11,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 12:03:11,100 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 12:03:11,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process [2022-11-16 12:03:11,729 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-16 12:03:11,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:03:11,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 12:03:11,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:03:11,757 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3700 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_3700))) is different from true [2022-11-16 12:03:11,809 WARN L855 $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-11-16 12:03:11,848 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 12:03:11,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-16 12:03:11,858 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 7 not checked. [2022-11-16 12:03:11,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:03:11,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [666039047] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:03:11,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:03:11,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2022-11-16 12:03:11,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774096592] [2022-11-16 12:03:11,991 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:03:11,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:03:11,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:03:11,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:03:11,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=4, NotChecked=44, Total=90 [2022-11-16 12:03:11,993 INFO L87 Difference]: Start difference. First operand 325 states and 436 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-16 12:03:14,043 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (= (bvadd (select |c_#valid| nondet_tree_~n~0.base) (_ bv1 1)) (_ bv0 1)) (exists ((v_ArrVal_3700 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_3700))))) (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_3506 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_3506))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 12:03:14,046 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3506 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_3506)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (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-11-16 12:03:16,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:03:16,717 INFO L93 Difference]: Finished difference Result 330 states and 452 transitions. [2022-11-16 12:03:16,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:03:16,718 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) Word has length 87 [2022-11-16 12:03:16,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:03:16,720 INFO L225 Difference]: With dead ends: 330 [2022-11-16 12:03:16,720 INFO L226 Difference]: Without dead ends: 330 [2022-11-16 12:03:16,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 174 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=34, Invalid=40, Unknown=6, NotChecked=102, Total=182 [2022-11-16 12:03:16,721 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 66 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1019 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:03:16,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 334 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 258 Invalid, 0 Unknown, 1019 Unchecked, 0.6s Time] [2022-11-16 12:03:16,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-11-16 12:03:16,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 324. [2022-11-16 12:03:16,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 200 states have (on average 1.435) internal successors, (287), 261 states have internal predecessors, (287), 40 states have call successors, (40), 17 states have call predecessors, (40), 24 states have return successors, (107), 45 states have call predecessors, (107), 40 states have call successors, (107) [2022-11-16 12:03:16,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 434 transitions. [2022-11-16 12:03:16,735 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 434 transitions. Word has length 87 [2022-11-16 12:03:16,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:03:16,735 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 434 transitions. [2022-11-16 12:03:16,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-16 12:03:16,736 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 434 transitions. [2022-11-16 12:03:16,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-16 12:03:16,737 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:03:16,737 INFO L195 NwaCegarLoop]: trace histogram [10, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 3, 3, 1, 1, 1, 1] [2022-11-16 12:03:16,752 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (44)] Forceful destruction successful, exit code 0 [2022-11-16 12:03:16,955 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-16 12:03:17,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:03:17,144 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting nondet_treeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 12:03:17,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:03:17,145 INFO L85 PathProgramCache]: Analyzing trace with hash 947188017, now seen corresponding path program 6 times [2022-11-16 12:03:17,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:03:17,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1023758570] [2022-11-16 12:03:17,146 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 12:03:17,146 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:03:17,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:03:17,147 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:03:17,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -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)] Waiting until timeout for monitored process [2022-11-16 12:03:17,949 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-11-16 12:03:17,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:03:17,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-16 12:03:17,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:03:17,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:03:18,139 WARN L855 $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-11-16 12:03:18,256 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:03:18,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 12:03:18,268 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_266 (_ BitVec 32))) (and (not (= v_nondet_tree_~n~0.base_266 c_nondet_tree_~n~0.base)) (= (store (store |c_old(#length)| c_nondet_tree_~n~0.base (_ bv12 32)) v_nondet_tree_~n~0.base_266 (_ bv12 32)) |c_#length|))) is different from true [2022-11-16 12:03:18,323 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_266 (_ BitVec 32)) (|nondet_tree_#res.base| (_ BitVec 32))) (and (not (= v_nondet_tree_~n~0.base_266 |nondet_tree_#res.base|)) (= (store (store |c_old(#length)| |nondet_tree_#res.base| (_ bv12 32)) v_nondet_tree_~n~0.base_266 (_ bv12 32)) |c_#length|))) is different from true [2022-11-16 12:03:18,362 INFO L321 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2022-11-16 12:03:18,363 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 1 case distinctions, treesize of input 15 treesize of output 19 [2022-11-16 12:03:18,412 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 151 proven. 6 refuted. 0 times theorem prover too weak. 73 trivial. 37 not checked. [2022-11-16 12:03:18,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:03:18,729 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-16 12:03:18,730 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-11-16 12:03:18,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:03:18,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1023758570] [2022-11-16 12:03:18,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1023758570] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:03:18,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [773518452] [2022-11-16 12:03:18,915 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 12:03:18,915 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 12:03:18,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 12:03:18,916 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 12:03:18,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (46)] Waiting until timeout for monitored process [2022-11-16 12:03:20,059 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-11-16 12:03:20,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:03:20,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-16 12:03:20,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:03:20,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:03:20,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:03:20,512 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4023 (_ BitVec 32)) (v_ArrVal_4021 (_ BitVec 32)) (nondet_tree_~n~0.base (_ 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_4021) |c_nondet_tree_#t~ret8.base| v_ArrVal_4023)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:03:20,536 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4023 (_ BitVec 32)) (v_ArrVal_4021 (_ BitVec 32)) (nondet_tree_~n~0.base (_ 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|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4021) |nondet_tree_#t~ret8.base| v_ArrVal_4023) |c_#length|))) is different from true [2022-11-16 12:03:20,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:03:20,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:03:20,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:03:20,648 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-11-16 12:03:20,674 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2022-11-16 12:03:20,674 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-11-16 12:03:20,685 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 149 proven. 36 refuted. 0 times theorem prover too weak. 63 trivial. 19 not checked. [2022-11-16 12:03:20,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:03:21,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [773518452] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:03:21,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:03:21,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-11-16 12:03:21,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554575352] [2022-11-16 12:03:21,202 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:03:21,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-16 12:03:21,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:03:21,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-16 12:03:21,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=176, Unknown=5, NotChecked=150, Total=380 [2022-11-16 12:03:21,203 INFO L87 Difference]: Start difference. First operand 324 states and 434 transitions. Second operand has 17 states, 16 states have (on average 3.6875) internal successors, (59), 15 states have internal predecessors, (59), 9 states have call successors, (15), 3 states have call predecessors, (15), 7 states have return successors, (14), 9 states have call predecessors, (14), 9 states have call successors, (14) [2022-11-16 12:03:22,606 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_nondet_tree_~n~0.base_266 (_ BitVec 32))) (and (not (= v_nondet_tree_~n~0.base_266 c_nondet_tree_~n~0.base)) (= (store (store |c_old(#length)| c_nondet_tree_~n~0.base (_ bv12 32)) v_nondet_tree_~n~0.base_266 (_ bv12 32)) |c_#length|))) (exists ((v_ArrVal_4023 (_ BitVec 32)) (v_ArrVal_4021 (_ BitVec 32)) (nondet_tree_~n~0.base (_ 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_4021) |c_nondet_tree_#t~ret8.base| v_ArrVal_4023)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 12:03:22,616 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_nondet_tree_~n~0.base_266 (_ BitVec 32))) (and (not (= v_nondet_tree_~n~0.base_266 c_nondet_tree_~n~0.base)) (= (store (store |c_old(#length)| c_nondet_tree_~n~0.base (_ bv12 32)) v_nondet_tree_~n~0.base_266 (_ bv12 32)) |c_#length|))) (exists ((v_ArrVal_4023 (_ BitVec 32)) (v_ArrVal_4021 (_ BitVec 32)) (nondet_tree_~n~0.base (_ 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|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4021) |nondet_tree_#t~ret8.base| v_ArrVal_4023) |c_#length|)))) is different from true [2022-11-16 12:03:22,624 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_nondet_tree_~n~0.base_266 (_ BitVec 32)) (|nondet_tree_#res.base| (_ BitVec 32))) (and (not (= v_nondet_tree_~n~0.base_266 |nondet_tree_#res.base|)) (= (store (store |c_old(#length)| |nondet_tree_#res.base| (_ bv12 32)) v_nondet_tree_~n~0.base_266 (_ bv12 32)) |c_#length|))) (exists ((v_ArrVal_4023 (_ BitVec 32)) (v_ArrVal_4021 (_ BitVec 32)) (nondet_tree_~n~0.base (_ 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|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4021) |nondet_tree_#t~ret8.base| v_ArrVal_4023) |c_#length|)))) is different from true [2022-11-16 12:03:23,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:03:23,069 INFO L93 Difference]: Finished difference Result 325 states and 436 transitions. [2022-11-16 12:03:23,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:03:23,070 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.6875) internal successors, (59), 15 states have internal predecessors, (59), 9 states have call successors, (15), 3 states have call predecessors, (15), 7 states have return successors, (14), 9 states have call predecessors, (14), 9 states have call successors, (14) Word has length 79 [2022-11-16 12:03:23,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:03:23,073 INFO L225 Difference]: With dead ends: 325 [2022-11-16 12:03:23,073 INFO L226 Difference]: Without dead ends: 325 [2022-11-16 12:03:23,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=85, Invalid=281, Unknown=8, NotChecked=328, Total=702 [2022-11-16 12:03:23,075 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 63 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 2357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1636 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:03:23,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 811 Invalid, 2357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 707 Invalid, 0 Unknown, 1636 Unchecked, 1.5s Time] [2022-11-16 12:03:23,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-11-16 12:03:23,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2022-11-16 12:03:23,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 201 states have (on average 1.4378109452736318) internal successors, (289), 261 states have internal predecessors, (289), 40 states have call successors, (40), 17 states have call predecessors, (40), 24 states have return successors, (107), 46 states have call predecessors, (107), 40 states have call successors, (107) [2022-11-16 12:03:23,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 436 transitions. [2022-11-16 12:03:23,089 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 436 transitions. Word has length 79 [2022-11-16 12:03:23,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:03:23,089 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 436 transitions. [2022-11-16 12:03:23,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.6875) internal successors, (59), 15 states have internal predecessors, (59), 9 states have call successors, (15), 3 states have call predecessors, (15), 7 states have return successors, (14), 9 states have call predecessors, (14), 9 states have call successors, (14) [2022-11-16 12:03:23,090 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 436 transitions. [2022-11-16 12:03:23,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-16 12:03:23,091 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:03:23,092 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-11-16 12:03:23,113 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-16 12:03:23,313 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (46)] Forceful destruction successful, exit code 0 [2022-11-16 12:03:23,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt [2022-11-16 12:03:23,507 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting nondet_treeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 12:03:23,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:03:23,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1922628366, now seen corresponding path program 4 times [2022-11-16 12:03:23,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:03:23,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1445490551] [2022-11-16 12:03:23,508 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 12:03:23,508 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:03:23,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:03:23,509 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:03:23,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -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)] Waiting until timeout for monitored process [2022-11-16 12:03:23,884 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 12:03:23,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:03:23,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-16 12:03:23,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:03:23,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:03:23,941 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_4120 (_ BitVec 1))) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_4120) |c_#valid|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:03:23,966 WARN L855 $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-11-16 12:03:24,153 INFO L321 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2022-11-16 12:03:24,154 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 4 case distinctions, treesize of input 22 treesize of output 38 [2022-11-16 12:03:24,170 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 27 trivial. 28 not checked. [2022-11-16 12:03:24,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:03:24,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:03:24,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1445490551] [2022-11-16 12:03:24,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1445490551] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:03:24,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [756231596] [2022-11-16 12:03:24,568 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 12:03:24,568 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 12:03:24,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 12:03:24,570 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 12:03:24,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (48)] Waiting until timeout for monitored process [2022-11-16 12:03:25,256 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 12:03:25,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:03:25,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-16 12:03:25,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:03:25,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:03:25,322 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4208 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_4208))) is different from true [2022-11-16 12:03:25,384 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4208 (_ BitVec 1)) (v_nondet_tree_~n~0.base_295 (_ BitVec 32))) (= |c_#valid| (store (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_4208) v_nondet_tree_~n~0.base_295 (_ bv1 1)))) is different from true [2022-11-16 12:03:27,489 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4208 (_ BitVec 1)) (v_nondet_tree_~n~0.base_295 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (let ((.cse0 (store (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_4208) v_nondet_tree_~n~0.base_295 (_ bv1 1)))) (and (= |c_#valid| .cse0) (= (bvadd (_ bv1 1) (select .cse0 nondet_tree_~n~0.base)) (_ bv0 1))))) is different from true [2022-11-16 12:03:27,579 INFO L321 Elim1Store]: treesize reduction 46, result has 29.2 percent of original size [2022-11-16 12:03:27,580 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 31 treesize of output 45 [2022-11-16 12:03:27,595 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 38 not checked. [2022-11-16 12:03:27,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:03:27,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [756231596] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:03:27,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:03:27,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2022-11-16 12:03:27,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321159938] [2022-11-16 12:03:27,842 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:03:27,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:03:27,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:03:27,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:03:27,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=6, NotChecked=70, Total=132 [2022-11-16 12:03:27,844 INFO L87 Difference]: Start difference. First operand 325 states and 436 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-16 12:03:38,381 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4208 (_ BitVec 1)) (v_nondet_tree_~n~0.base_295 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (let ((.cse0 (store (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_4208) v_nondet_tree_~n~0.base_295 (_ bv1 1)))) (and (= |c_#valid| .cse0) (= (bvadd (_ bv1 1) (select .cse0 nondet_tree_~n~0.base)) (_ bv0 1))))) (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-11-16 12:03:47,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:03:47,206 INFO L93 Difference]: Finished difference Result 325 states and 435 transitions. [2022-11-16 12:03:47,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:03:47,207 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) Word has length 45 [2022-11-16 12:03:47,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:03:47,210 INFO L225 Difference]: With dead ends: 325 [2022-11-16 12:03:47,210 INFO L226 Difference]: Without dead ends: 325 [2022-11-16 12:03:47,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 88 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=49, Invalid=71, Unknown=14, NotChecked=138, Total=272 [2022-11-16 12:03:47,211 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 66 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 1677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1409 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:03:47,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 408 Invalid, 1677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 254 Invalid, 0 Unknown, 1409 Unchecked, 0.7s Time] [2022-11-16 12:03:47,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-11-16 12:03:47,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 324. [2022-11-16 12:03:47,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 200 states have (on average 1.435) internal successors, (287), 261 states have internal predecessors, (287), 40 states have call successors, (40), 17 states have call predecessors, (40), 24 states have return successors, (107), 45 states have call predecessors, (107), 40 states have call successors, (107) [2022-11-16 12:03:47,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 434 transitions. [2022-11-16 12:03:47,225 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 434 transitions. Word has length 45 [2022-11-16 12:03:47,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:03:47,225 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 434 transitions. [2022-11-16 12:03:47,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-16 12:03:47,226 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 434 transitions. [2022-11-16 12:03:47,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-16 12:03:47,227 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:03:47,227 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-11-16 12:03:47,249 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-16 12:03:47,448 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (48)] Forceful destruction successful, exit code 0 [2022-11-16 12:03:47,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt [2022-11-16 12:03:47,643 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting minErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 12:03:47,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:03:47,644 INFO L85 PathProgramCache]: Analyzing trace with hash -626976300, now seen corresponding path program 2 times [2022-11-16 12:03:47,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:03:47,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206497815] [2022-11-16 12:03:47,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:03:47,644 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:03:47,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:03:47,645 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:03:47,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (49)] Waiting until timeout for monitored process [2022-11-16 12:03:48,025 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:03:48,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:03:48,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-16 12:03:48,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:03:48,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:03:48,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:03:48,189 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-11-16 12:03:48,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-16 12:03:48,508 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 12:03:48,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:03:49,305 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 12:03:49,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:03:49,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206497815] [2022-11-16 12:03:49,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206497815] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:03:49,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:03:49,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2022-11-16 12:03:49,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825501436] [2022-11-16 12:03:49,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:03:49,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 12:03:49,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:03:49,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 12:03:49,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2022-11-16 12:03:49,308 INFO L87 Difference]: Start difference. First operand 324 states and 434 transitions. Second operand has 18 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 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-11-16 12:03:55,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:03:55,124 INFO L93 Difference]: Finished difference Result 360 states and 482 transitions. [2022-11-16 12:03:55,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 12:03:55,125 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 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-11-16 12:03:55,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:03:55,127 INFO L225 Difference]: With dead ends: 360 [2022-11-16 12:03:55,128 INFO L226 Difference]: Without dead ends: 360 [2022-11-16 12:03:55,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=115, Invalid=755, Unknown=0, NotChecked=0, Total=870 [2022-11-16 12:03:55,129 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 130 mSDsluCounter, 1151 mSDsCounter, 0 mSdLazyCounter, 2474 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 2813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 293 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:03:55,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1300 Invalid, 2813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2474 Invalid, 0 Unknown, 293 Unchecked, 5.2s Time] [2022-11-16 12:03:55,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-11-16 12:03:55,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 343. [2022-11-16 12:03:55,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 215 states have (on average 1.441860465116279) internal successors, (310), 276 states have internal predecessors, (310), 42 states have call successors, (42), 18 states have call predecessors, (42), 26 states have return successors, (109), 48 states have call predecessors, (109), 42 states have call successors, (109) [2022-11-16 12:03:55,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 461 transitions. [2022-11-16 12:03:55,144 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 461 transitions. Word has length 45 [2022-11-16 12:03:55,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:03:55,144 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 461 transitions. [2022-11-16 12:03:55,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 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-11-16 12:03:55,145 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 461 transitions. [2022-11-16 12:03:55,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-16 12:03:55,146 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:03:55,146 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-11-16 12:03:55,162 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (49)] Forceful destruction successful, exit code 0 [2022-11-16 12:03:55,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:03:55,359 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting minErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 12:03:55,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:03:55,360 INFO L85 PathProgramCache]: Analyzing trace with hash -626976299, now seen corresponding path program 1 times [2022-11-16 12:03:55,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:03:55,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1908322986] [2022-11-16 12:03:55,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:03:55,360 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:03:55,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:03:55,361 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:03:55,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2022-11-16 12:03:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:03:55,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 12:03:55,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:03:55,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:03:56,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:03:56,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:03:56,181 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-11-16 12:03:56,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-16 12:03:56,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-16 12:03:56,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-16 12:03:56,796 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 12:03:56,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:04:02,516 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 12:04:02,516 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:04:02,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1908322986] [2022-11-16 12:04:02,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1908322986] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:04:02,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:04:02,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2022-11-16 12:04:02,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946275650] [2022-11-16 12:04:02,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:04:02,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-16 12:04:02,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:04:02,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-16 12:04:02,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=797, Unknown=0, NotChecked=0, Total=870 [2022-11-16 12:04:02,518 INFO L87 Difference]: Start difference. First operand 343 states and 461 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-11-16 12:04:12,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:04:12,662 INFO L93 Difference]: Finished difference Result 385 states and 520 transitions. [2022-11-16 12:04:12,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-16 12:04:12,663 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-11-16 12:04:12,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:04:12,664 INFO L225 Difference]: With dead ends: 385 [2022-11-16 12:04:12,664 INFO L226 Difference]: Without dead ends: 385 [2022-11-16 12:04:12,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=133, Invalid=1349, Unknown=0, NotChecked=0, Total=1482 [2022-11-16 12:04:12,665 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 91 mSDsluCounter, 2829 mSDsCounter, 0 mSdLazyCounter, 1902 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 3071 SdHoareTripleChecker+Invalid, 2269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 343 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:04:12,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 3071 Invalid, 2269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1902 Invalid, 0 Unknown, 343 Unchecked, 8.6s Time] [2022-11-16 12:04:12,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2022-11-16 12:04:12,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 373. [2022-11-16 12:04:12,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 238 states have (on average 1.4243697478991597) internal successors, (339), 299 states have internal predecessors, (339), 47 states have call successors, (47), 20 states have call predecessors, (47), 28 states have return successors, (114), 53 states have call predecessors, (114), 47 states have call successors, (114) [2022-11-16 12:04:12,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 500 transitions. [2022-11-16 12:04:12,679 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 500 transitions. Word has length 45 [2022-11-16 12:04:12,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:04:12,680 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 500 transitions. [2022-11-16 12:04:12,680 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-11-16 12:04:12,680 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 500 transitions. [2022-11-16 12:04:12,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-16 12:04:12,682 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:04:12,682 INFO L195 NwaCegarLoop]: trace histogram [8, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1] [2022-11-16 12:04:12,696 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (50)] Forceful destruction successful, exit code 0 [2022-11-16 12:04:12,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:04:12,896 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-11-16 12:04:12,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:04:12,896 INFO L85 PathProgramCache]: Analyzing trace with hash 612737438, now seen corresponding path program 7 times [2022-11-16 12:04:12,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:04:12,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [718971367] [2022-11-16 12:04:12,897 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 12:04:12,897 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:04:12,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:04:12,898 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:04:12,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (51)] Waiting until timeout for monitored process [2022-11-16 12:04:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:04:13,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-16 12:04:13,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:04:13,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:04:13,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:04:13,649 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_4497 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4497) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:04:13,730 WARN L855 $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-11-16 12:04:13,968 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4498 (_ BitVec 32)) (v_nondet_tree_~n~0.base_330 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (bvule (_ bv12 32) (select |c_#length| nondet_tree_~n~0.base)) (= |c_#length| (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4498) v_nondet_tree_~n~0.base_330 (_ bv12 32))))) is different from true [2022-11-16 12:04:14,015 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4497 (_ BitVec 32)) (v_ArrVal_4498 (_ BitVec 32)) (v_nondet_tree_~n~0.base_331 (_ BitVec 32)) (v_nondet_tree_~n~0.base_330 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4497) v_nondet_tree_~n~0.base_331 v_ArrVal_4498) v_nondet_tree_~n~0.base_330 (_ bv12 32)) |c_#length|) (bvule (_ bv12 32) (select |c_#length| v_nondet_tree_~n~0.base_331)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:04:14,092 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4497 (_ BitVec 32)) (v_ArrVal_4498 (_ BitVec 32)) (v_nondet_tree_~n~0.base_331 (_ BitVec 32)) (v_nondet_tree_~n~0.base_330 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (let ((.cse0 (store (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4497) v_nondet_tree_~n~0.base_331 v_ArrVal_4498) v_nondet_tree_~n~0.base_330 (_ bv12 32)))) (and (= .cse0 |c_#length|) (bvule (_ bv12 32) (select .cse0 v_nondet_tree_~n~0.base_331)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 12:04:14,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:04:14,306 INFO L321 Elim1Store]: treesize reduction 59, result has 34.4 percent of original size [2022-11-16 12:04:14,306 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 30 treesize of output 51 [2022-11-16 12:04:14,336 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:04:14,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 12:04:14,415 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 28 proven. 26 refuted. 1 times theorem prover too weak. 29 trivial. 74 not checked. [2022-11-16 12:04:14,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:04:15,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:04:15,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [718971367] [2022-11-16 12:04:15,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [718971367] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:04:15,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [753023904] [2022-11-16 12:04:15,217 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 12:04:15,217 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 12:04:15,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 12:04:15,219 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 12:04:15,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (52)] Waiting until timeout for monitored process [2022-11-16 12:04:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:04:16,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-16 12:04:16,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:04:16,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:04:16,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:04:16,361 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_4640 (_ BitVec 1))) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_4640) |c_#valid|)) (exists ((v_ArrVal_4639 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4639) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:04:16,405 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_4641 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4641))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:04:16,510 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4641 (_ BitVec 32)) (v_nondet_tree_~n~0.base_351 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4641) v_nondet_tree_~n~0.base_351 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:04:16,649 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4641 (_ BitVec 32)) (v_nondet_tree_~n~0.base_351 (_ BitVec 32)) (v_nondet_tree_~n~0.base_352 (_ BitVec 32)) (v_ArrVal_4639 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_4640 (_ BitVec 1))) (and (= |c_#length| (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_352 v_ArrVal_4639) nondet_tree_~n~0.base v_ArrVal_4641) v_nondet_tree_~n~0.base_351 (_ bv12 32))) (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_352)) (= (_ bv0 1) (select (store |c_old(#valid)| v_nondet_tree_~n~0.base_352 v_ArrVal_4640) nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:04:16,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:04:16,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:04:16,928 INFO L321 Elim1Store]: treesize reduction 47, result has 36.5 percent of original size [2022-11-16 12:04:16,929 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-11-16 12:04:16,998 INFO L321 Elim1Store]: treesize reduction 17, result has 45.2 percent of original size [2022-11-16 12:04:16,998 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-11-16 12:04:17,078 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 28 proven. 23 refuted. 0 times theorem prover too weak. 26 trivial. 81 not checked. [2022-11-16 12:04:17,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:04:19,465 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv12 32) c_nondet_tree_~n~0.offset))) (and (or (bvule (bvadd (_ bv8 32) c_nondet_tree_~n~0.offset) .cse0) (forall ((v_nondet_tree_~n~0.base_371 (_ BitVec 32)) (v_nondet_tree_~n~0.base_370 (_ BitVec 32)) (v_ArrVal_4655 (_ BitVec 1))) (or (not (= (select |c_#valid| v_nondet_tree_~n~0.base_370) (_ bv0 1))) (not (= (_ bv0 1) (select (store |c_#valid| v_nondet_tree_~n~0.base_370 v_ArrVal_4655) v_nondet_tree_~n~0.base_371)))))) (forall ((v_nondet_tree_~n~0.base_370 (_ BitVec 32))) (or (not (= (select |c_#valid| v_nondet_tree_~n~0.base_370) (_ bv0 1))) (forall ((v_nondet_tree_~n~0.base_371 (_ BitVec 32)) (v_ArrVal_4655 (_ BitVec 1))) (or (forall ((v_ArrVal_4653 (_ BitVec 32)) (v_ArrVal_4654 (_ BitVec 32)) (v_nondet_tree_~n~0.base_369 (_ BitVec 32))) (bvule .cse0 (select (store (store (store |c_#length| v_nondet_tree_~n~0.base_370 v_ArrVal_4653) v_nondet_tree_~n~0.base_371 v_ArrVal_4654) v_nondet_tree_~n~0.base_369 (_ bv12 32)) c_nondet_tree_~n~0.base))) (not (= (_ bv0 1) (select (store |c_#valid| v_nondet_tree_~n~0.base_370 v_ArrVal_4655) v_nondet_tree_~n~0.base_371))))))))) is different from false [2022-11-16 12:04:19,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [753023904] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:04:19,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:04:19,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2022-11-16 12:04:19,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265808014] [2022-11-16 12:04:19,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:04:19,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-16 12:04:19,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:04:19,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-16 12:04:19,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=103, Unknown=19, NotChecked=290, Total=462 [2022-11-16 12:04:19,472 INFO L87 Difference]: Start difference. First operand 373 states and 500 transitions. Second operand has 19 states, 18 states have (on average 3.111111111111111) internal successors, (56), 16 states have internal predecessors, (56), 11 states have call successors, (14), 3 states have call predecessors, (14), 7 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2022-11-16 12:04:20,024 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) |c_#length|)) (exists ((v_ArrVal_4498 (_ BitVec 32)) (v_nondet_tree_~n~0.base_330 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (bvule (_ bv12 32) (select |c_#length| nondet_tree_~n~0.base)) (= |c_#length| (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4498) v_nondet_tree_~n~0.base_330 (_ bv12 32)))))) is different from true [2022-11-16 12:04:57,299 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4497 (_ BitVec 32)) (v_ArrVal_4498 (_ BitVec 32)) (v_nondet_tree_~n~0.base_331 (_ BitVec 32)) (v_nondet_tree_~n~0.base_330 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (let ((.cse0 (store (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4497) v_nondet_tree_~n~0.base_331 v_ArrVal_4498) v_nondet_tree_~n~0.base_330 (_ bv12 32)))) (and (= .cse0 |c_#length|) (bvule (_ bv12 32) (select .cse0 v_nondet_tree_~n~0.base_331)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) (exists ((v_ArrVal_4498 (_ BitVec 32)) (v_nondet_tree_~n~0.base_330 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (bvule (_ bv12 32) (select |c_#length| nondet_tree_~n~0.base)) (= |c_#length| (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4498) v_nondet_tree_~n~0.base_330 (_ bv12 32))))) (exists ((v_ArrVal_4641 (_ BitVec 32)) (v_nondet_tree_~n~0.base_351 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4641) v_nondet_tree_~n~0.base_351 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 12:04:57,307 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4497 (_ BitVec 32)) (v_ArrVal_4498 (_ BitVec 32)) (v_nondet_tree_~n~0.base_331 (_ BitVec 32)) (v_nondet_tree_~n~0.base_330 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4497) v_nondet_tree_~n~0.base_331 v_ArrVal_4498) v_nondet_tree_~n~0.base_330 (_ bv12 32)) |c_#length|) (bvule (_ bv12 32) (select |c_#length| v_nondet_tree_~n~0.base_331)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((v_ArrVal_4641 (_ BitVec 32)) (v_nondet_tree_~n~0.base_351 (_ BitVec 32)) (v_nondet_tree_~n~0.base_352 (_ BitVec 32)) (v_ArrVal_4639 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_4640 (_ BitVec 1))) (and (= |c_#length| (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_352 v_ArrVal_4639) nondet_tree_~n~0.base v_ArrVal_4641) v_nondet_tree_~n~0.base_351 (_ bv12 32))) (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_352)) (= (_ bv0 1) (select (store |c_old(#valid)| v_nondet_tree_~n~0.base_352 v_ArrVal_4640) nondet_tree_~n~0.base))))) is different from true [2022-11-16 12:04:57,315 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4497 (_ BitVec 32)) (v_ArrVal_4498 (_ BitVec 32)) (v_nondet_tree_~n~0.base_331 (_ BitVec 32)) (v_nondet_tree_~n~0.base_330 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (let ((.cse0 (store (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4497) v_nondet_tree_~n~0.base_331 v_ArrVal_4498) v_nondet_tree_~n~0.base_330 (_ bv12 32)))) (and (= .cse0 |c_#length|) (bvule (_ bv12 32) (select .cse0 v_nondet_tree_~n~0.base_331)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) (exists ((v_ArrVal_4641 (_ BitVec 32)) (v_nondet_tree_~n~0.base_351 (_ BitVec 32)) (v_nondet_tree_~n~0.base_352 (_ BitVec 32)) (v_ArrVal_4639 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_4640 (_ BitVec 1))) (and (= |c_#length| (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_352 v_ArrVal_4639) nondet_tree_~n~0.base v_ArrVal_4641) v_nondet_tree_~n~0.base_351 (_ bv12 32))) (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_352)) (= (_ bv0 1) (select (store |c_old(#valid)| v_nondet_tree_~n~0.base_352 v_ArrVal_4640) nondet_tree_~n~0.base))))) is different from true [2022-11-16 12:04:57,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:04:57,556 INFO L93 Difference]: Finished difference Result 402 states and 564 transitions. [2022-11-16 12:04:57,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 12:04:57,556 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.111111111111111) internal successors, (56), 16 states have internal predecessors, (56), 11 states have call successors, (14), 3 states have call predecessors, (14), 7 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) Word has length 63 [2022-11-16 12:04:57,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:04:57,559 INFO L225 Difference]: With dead ends: 402 [2022-11-16 12:04:57,559 INFO L226 Difference]: Without dead ends: 402 [2022-11-16 12:04:57,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 110 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 40.0s TimeCoverageRelationStatistics Valid=105, Invalid=219, Unknown=38, NotChecked=630, Total=992 [2022-11-16 12:04:57,560 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 72 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 2821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2507 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:04:57,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 578 Invalid, 2821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 299 Invalid, 0 Unknown, 2507 Unchecked, 0.7s Time] [2022-11-16 12:04:57,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-11-16 12:04:57,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2022-11-16 12:04:57,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 257 states have (on average 1.404669260700389) internal successors, (361), 319 states have internal predecessors, (361), 51 states have call successors, (51), 22 states have call predecessors, (51), 32 states have return successors, (151), 58 states have call predecessors, (151), 51 states have call successors, (151) [2022-11-16 12:04:57,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 563 transitions. [2022-11-16 12:04:57,574 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 563 transitions. Word has length 63 [2022-11-16 12:04:57,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:04:57,575 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 563 transitions. [2022-11-16 12:04:57,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.111111111111111) internal successors, (56), 16 states have internal predecessors, (56), 11 states have call successors, (14), 3 states have call predecessors, (14), 7 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2022-11-16 12:04:57,575 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 563 transitions. [2022-11-16 12:04:57,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-16 12:04:57,576 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:04:57,577 INFO L195 NwaCegarLoop]: trace histogram [8, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1] [2022-11-16 12:04:57,585 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (52)] Forceful destruction successful, exit code 0 [2022-11-16 12:04:57,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (51)] Forceful destruction successful, exit code 0 [2022-11-16 12:04:57,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt,51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:04:57,985 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 12:04:57,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:04:57,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1372794778, now seen corresponding path program 4 times [2022-11-16 12:04:57,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:04:57,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [506911192] [2022-11-16 12:04:57,986 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 12:04:57,986 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:04:57,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:04:57,987 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:04:57,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (53)] Waiting until timeout for monitored process [2022-11-16 12:04:58,537 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 12:04:58,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:04:58,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-16 12:04:58,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:04:58,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:04:58,598 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_4784 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_4784))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:04:58,620 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4785 (_ BitVec 1))) (= (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_4785) |c_#valid|)) is different from true [2022-11-16 12:04:58,632 WARN L855 $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-11-16 12:04:58,671 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_372 (_ BitVec 32)) (v_ArrVal_4785 (_ BitVec 1))) (= |c_#valid| (store (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_4785) v_nondet_tree_~n~0.base_372 (_ bv1 1)))) is different from true [2022-11-16 12:04:58,725 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_372 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_4785 (_ BitVec 1))) (let ((.cse0 (store (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_4785) v_nondet_tree_~n~0.base_372 (_ bv1 1)))) (and (= (_ bv0 1) (bvadd (select .cse0 nondet_tree_~n~0.base) (_ bv1 1))) (= |c_#valid| .cse0)))) is different from true [2022-11-16 12:05:00,981 INFO L321 Elim1Store]: treesize reduction 100, result has 27.0 percent of original size [2022-11-16 12:05:00,981 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 5 case distinctions, treesize of input 39 treesize of output 66 [2022-11-16 12:05:01,003 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 57 proven. 11 refuted. 0 times theorem prover too weak. 36 trivial. 55 not checked. [2022-11-16 12:05:01,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:05:01,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:05:01,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [506911192] [2022-11-16 12:05:01,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [506911192] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:05:01,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1457145937] [2022-11-16 12:05:01,590 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 12:05:01,590 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 12:05:01,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 12:05:01,591 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 12:05:01,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (54)] Waiting until timeout for monitored process [2022-11-16 12:05:02,509 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 12:05:02,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:05:02,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-16 12:05:02,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:05:02,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:05:02,548 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4925 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_4925))) is different from true [2022-11-16 12:05:02,564 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_4926 (_ BitVec 1))) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_4926) |c_#valid|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:05:08,731 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_393 (_ BitVec 32)) (v_nondet_tree_~n~0.base_394 (_ BitVec 32)) (v_ArrVal_4925 (_ BitVec 1)) (v_ArrVal_4926 (_ BitVec 1))) (let ((.cse0 (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_4925))) (and (= (select .cse0 v_nondet_tree_~n~0.base_393) (_ bv0 1)) (= |c_#valid| (store (store .cse0 v_nondet_tree_~n~0.base_393 v_ArrVal_4926) v_nondet_tree_~n~0.base_394 (_ bv1 1)))))) is different from true [2022-11-16 12:05:18,959 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_393 (_ BitVec 32)) (v_nondet_tree_~n~0.base_394 (_ BitVec 32)) (v_ArrVal_4925 (_ BitVec 1)) (v_ArrVal_4926 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32))) (let ((.cse1 (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_4925))) (let ((.cse0 (store (store .cse1 v_nondet_tree_~n~0.base_393 v_ArrVal_4926) v_nondet_tree_~n~0.base_394 (_ bv1 1)))) (and (= (_ bv0 1) (bvadd (select .cse0 nondet_tree_~n~0.base) (_ bv1 1))) (= .cse0 |c_#valid|) (= (_ bv0 1) (select .cse1 v_nondet_tree_~n~0.base_393)))))) is different from true [2022-11-16 12:05:19,189 INFO L321 Elim1Store]: treesize reduction 94, result has 31.4 percent of original size [2022-11-16 12:05:19,190 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 5 case distinctions, treesize of input 115 treesize of output 148 [2022-11-16 12:05:19,335 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 57 proven. 9 refuted. 2 times theorem prover too weak. 36 trivial. 55 not checked. [2022-11-16 12:05:19,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:05:19,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1457145937] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:05:19,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:05:19,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-11-16 12:05:19,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751052267] [2022-11-16 12:05:19,694 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:05:19,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-16 12:05:19,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:05:19,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-16 12:05:19,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=50, Unknown=19, NotChecked=198, Total=306 [2022-11-16 12:05:19,696 INFO L87 Difference]: Start difference. First operand 400 states and 563 transitions. Second operand has 17 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 11 states have call successors, (14), 2 states have call predecessors, (14), 7 states have return successors, (13), 9 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-16 12:06:23,651 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_nondet_tree_~n~0.base_393 (_ BitVec 32)) (v_nondet_tree_~n~0.base_394 (_ BitVec 32)) (v_ArrVal_4925 (_ BitVec 1)) (v_ArrVal_4926 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32))) (let ((.cse1 (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_4925))) (let ((.cse0 (store (store .cse1 v_nondet_tree_~n~0.base_393 v_ArrVal_4926) v_nondet_tree_~n~0.base_394 (_ bv1 1)))) (and (= (_ bv0 1) (bvadd (select .cse0 nondet_tree_~n~0.base) (_ bv1 1))) (= .cse0 |c_#valid|) (= (_ bv0 1) (select .cse1 v_nondet_tree_~n~0.base_393)))))) (exists ((v_nondet_tree_~n~0.base_372 (_ BitVec 32)) (v_nondet_tree_~n~0.base_373 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_4784 (_ BitVec 1)) (v_ArrVal_4785 (_ BitVec 1))) (let ((.cse2 (store (store (store |c_old(#valid)| v_nondet_tree_~n~0.base_373 v_ArrVal_4784) nondet_tree_~n~0.base v_ArrVal_4785) v_nondet_tree_~n~0.base_372 (_ bv1 1)))) (and (= .cse2 |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_373)) (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse2 nondet_tree_~n~0.base))))))) is different from true [2022-11-16 12:06:23,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:06:23,888 INFO L93 Difference]: Finished difference Result 413 states and 593 transitions. [2022-11-16 12:06:23,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:06:23,889 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 11 states have call successors, (14), 2 states have call predecessors, (14), 7 states have return successors, (13), 9 states have call predecessors, (13), 11 states have call successors, (13) Word has length 63 [2022-11-16 12:06:23,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:06:23,892 INFO L225 Difference]: With dead ends: 413 [2022-11-16 12:06:23,892 INFO L226 Difference]: Without dead ends: 413 [2022-11-16 12:06:23,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 117 SyntacticMatches, 10 SemanticMatches, 21 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 82.2s TimeCoverageRelationStatistics Valid=65, Invalid=95, Unknown=36, NotChecked=310, Total=506 [2022-11-16 12:06:23,893 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 69 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2658 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:06:23,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 548 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 257 Invalid, 0 Unknown, 2658 Unchecked, 0.6s Time] [2022-11-16 12:06:23,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-11-16 12:06:23,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 404. [2022-11-16 12:06:23,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 260 states have (on average 1.4038461538461537) internal successors, (365), 321 states have internal predecessors, (365), 52 states have call successors, (52), 22 states have call predecessors, (52), 32 states have return successors, (158), 60 states have call predecessors, (158), 52 states have call successors, (158) [2022-11-16 12:06:23,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 575 transitions. [2022-11-16 12:06:23,906 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 575 transitions. Word has length 63 [2022-11-16 12:06:23,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:06:23,907 INFO L495 AbstractCegarLoop]: Abstraction has 404 states and 575 transitions. [2022-11-16 12:06:23,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 11 states have call successors, (14), 2 states have call predecessors, (14), 7 states have return successors, (13), 9 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-16 12:06:23,907 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 575 transitions. [2022-11-16 12:06:23,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-16 12:06:23,908 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:06:23,909 INFO L195 NwaCegarLoop]: trace histogram [7, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2022-11-16 12:06:23,916 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (54)] Forceful destruction successful, exit code 0 [2022-11-16 12:06:24,126 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (53)] Forceful destruction successful, exit code 0 [2022-11-16 12:06:24,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt,53 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:06:24,316 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting nondet_treeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 12:06:24,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:06:24,317 INFO L85 PathProgramCache]: Analyzing trace with hash -374049066, now seen corresponding path program 4 times [2022-11-16 12:06:24,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:06:24,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691583404] [2022-11-16 12:06:24,317 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 12:06:24,317 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:06:24,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:06:24,318 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:06:24,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (55)] Waiting until timeout for monitored process [2022-11-16 12:06:24,827 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 12:06:24,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:06:24,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-16 12:06:24,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:06:24,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:06:24,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:06:24,916 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_5044 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_5044) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:06:24,946 WARN L855 $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-11-16 12:06:25,014 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_414 (_ BitVec 32))) (= (store (store |c_old(#length)| v_nondet_tree_~n~0.base_414 (_ bv12 32)) nondet_tree_~n~0.base (_ bv12 32)) |c_#length|)) is different from true [2022-11-16 12:06:25,069 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5044 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_414 (_ BitVec 32)) (v_nondet_tree_~n~0.base_415 (_ BitVec 32))) (and (= (store (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_5044) v_nondet_tree_~n~0.base_414 (_ bv12 32)) v_nondet_tree_~n~0.base_415 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:06:25,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:06:25,265 INFO L321 Elim1Store]: treesize reduction 67, result has 25.6 percent of original size [2022-11-16 12:06:25,265 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-11-16 12:06:25,289 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:06:25,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 12:06:25,333 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 63 not checked. [2022-11-16 12:06:25,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:06:25,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:06:25,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691583404] [2022-11-16 12:06:25,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1691583404] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:06:25,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [669767882] [2022-11-16 12:06:25,854 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 12:06:25,854 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 12:06:25,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 12:06:25,855 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 12:06:25,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (56)] Waiting until timeout for monitored process [2022-11-16 12:06:26,774 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 12:06:26,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:06:26,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-16 12:06:26,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:06:26,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 5 [2022-11-16 12:06:26,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:06:26,853 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_5159 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_5159))) (exists ((v_ArrVal_5158 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_5158) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:06:26,901 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_5160 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_5160))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:06:27,005 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_435 (_ BitVec 32)) (v_ArrVal_5160 (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| v_nondet_tree_~n~0.base_435 v_ArrVal_5160) nondet_tree_~n~0.base (_ bv12 32))) (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_435)))) is different from true [2022-11-16 12:06:27,131 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5158 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_435 (_ BitVec 32)) (v_ArrVal_5160 (_ BitVec 32)) (v_ArrVal_5159 (_ BitVec 1)) (v_nondet_tree_~n~0.base_436 (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_5159) v_nondet_tree_~n~0.base_435)) (= (store (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_5158) v_nondet_tree_~n~0.base_435 v_ArrVal_5160) v_nondet_tree_~n~0.base_436 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:06:27,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:06:27,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:06:27,409 INFO L321 Elim1Store]: treesize reduction 47, result has 36.5 percent of original size [2022-11-16 12:06:27,409 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-11-16 12:06:27,472 INFO L321 Elim1Store]: treesize reduction 17, result has 45.2 percent of original size [2022-11-16 12:06:27,472 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-11-16 12:06:27,522 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 23 trivial. 66 not checked. [2022-11-16 12:06:27,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:06:30,038 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) c_nondet_tree_~n~0.offset))) (and (forall ((v_nondet_tree_~n~0.base_454 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_nondet_tree_~n~0.base_454))) (forall ((v_ArrVal_5172 (_ BitVec 1)) (v_nondet_tree_~n~0.base_455 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_nondet_tree_~n~0.base_454 v_ArrVal_5172) v_nondet_tree_~n~0.base_455))) (forall ((v_nondet_tree_~n~0.base_453 (_ BitVec 32)) (v_ArrVal_5174 (_ BitVec 32)) (v_ArrVal_5173 (_ BitVec 32))) (bvule .cse0 (select (store (store (store |c_#length| v_nondet_tree_~n~0.base_454 v_ArrVal_5174) v_nondet_tree_~n~0.base_455 v_ArrVal_5173) v_nondet_tree_~n~0.base_453 (_ bv12 32)) c_nondet_tree_~n~0.base))))))) (or (forall ((v_ArrVal_5172 (_ BitVec 1)) (v_nondet_tree_~n~0.base_454 (_ BitVec 32)) (v_nondet_tree_~n~0.base_455 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_nondet_tree_~n~0.base_454))) (not (= (_ bv0 1) (select (store |c_#valid| v_nondet_tree_~n~0.base_454 v_ArrVal_5172) v_nondet_tree_~n~0.base_455))))) (bvule (bvadd (_ bv4 32) c_nondet_tree_~n~0.offset) .cse0)))) is different from false [2022-11-16 12:06:30,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [669767882] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:06:30,045 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:06:30,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2022-11-16 12:06:30,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399755589] [2022-11-16 12:06:30,045 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:06:30,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 12:06:30,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:06:30,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 12:06:30,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=47, Unknown=9, NotChecked=180, Total=272 [2022-11-16 12:06:30,047 INFO L87 Difference]: Start difference. First operand 404 states and 575 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-11-16 12:06:30,976 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_435 (_ BitVec 32)) (v_ArrVal_5160 (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| v_nondet_tree_~n~0.base_435 v_ArrVal_5160) nondet_tree_~n~0.base (_ bv12 32))) (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_435)))) (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_414 (_ BitVec 32))) (= (store (store |c_old(#length)| v_nondet_tree_~n~0.base_414 (_ bv12 32)) nondet_tree_~n~0.base (_ bv12 32)) |c_#length|))) is different from true [2022-11-16 12:06:30,983 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5158 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_435 (_ BitVec 32)) (v_ArrVal_5160 (_ BitVec 32)) (v_ArrVal_5159 (_ BitVec 1)) (v_nondet_tree_~n~0.base_436 (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_5159) v_nondet_tree_~n~0.base_435)) (= (store (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_5158) v_nondet_tree_~n~0.base_435 v_ArrVal_5160) v_nondet_tree_~n~0.base_436 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((v_ArrVal_5044 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_414 (_ BitVec 32)) (v_nondet_tree_~n~0.base_415 (_ BitVec 32))) (and (= (store (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_5044) v_nondet_tree_~n~0.base_414 (_ bv12 32)) v_nondet_tree_~n~0.base_415 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 12:06:31,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:06:31,286 INFO L93 Difference]: Finished difference Result 476 states and 718 transitions. [2022-11-16 12:06:31,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:06:31,286 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-11-16 12:06:31,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:06:31,289 INFO L225 Difference]: With dead ends: 476 [2022-11-16 12:06:31,289 INFO L226 Difference]: Without dead ends: 476 [2022-11-16 12:06:31,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=53, Invalid=68, Unknown=13, NotChecked=286, Total=420 [2022-11-16 12:06:31,290 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 66 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 2251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1803 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:06:31,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 409 Invalid, 2251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 431 Invalid, 0 Unknown, 1803 Unchecked, 1.0s Time] [2022-11-16 12:06:31,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-11-16 12:06:31,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2022-11-16 12:06:31,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 310 states have (on average 1.3516129032258064) internal successors, (419), 376 states have internal predecessors, (419), 63 states have call successors, (63), 27 states have call predecessors, (63), 43 states have return successors, (236), 72 states have call predecessors, (236), 63 states have call successors, (236) [2022-11-16 12:06:31,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 718 transitions. [2022-11-16 12:06:31,307 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 718 transitions. Word has length 53 [2022-11-16 12:06:31,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:06:31,307 INFO L495 AbstractCegarLoop]: Abstraction has 476 states and 718 transitions. [2022-11-16 12:06:31,307 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-11-16 12:06:31,308 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 718 transitions. [2022-11-16 12:06:31,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-16 12:06:31,309 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:06:31,309 INFO L195 NwaCegarLoop]: trace histogram [10, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 3, 3, 1, 1, 1, 1] [2022-11-16 12:06:31,329 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (55)] Forceful destruction successful, exit code 0 [2022-11-16 12:06:31,537 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (56)] Forceful destruction successful, exit code 0 [2022-11-16 12:06:31,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,56 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt [2022-11-16 12:06:31,724 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting nondet_treeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 12:06:31,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:06:31,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1766996112, now seen corresponding path program 5 times [2022-11-16 12:06:31,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:06:31,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2030641900] [2022-11-16 12:06:31,725 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 12:06:31,725 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:06:31,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:06:31,726 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:06:31,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (57)] Waiting until timeout for monitored process [2022-11-16 12:06:32,925 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-11-16 12:06:32,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:06:32,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-16 12:06:32,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:06:32,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:06:33,006 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_5332 (_ BitVec 1))) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_5332) |c_#valid|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:06:33,031 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_5333 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_5333))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:06:33,059 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5334 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_5334))) is different from true [2022-11-16 12:06:33,134 WARN L855 $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-11-16 12:06:39,583 INFO L321 Elim1Store]: treesize reduction 111, result has 29.3 percent of original size [2022-11-16 12:06:39,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 43 treesize of output 77 [2022-11-16 12:06:39,624 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 120 proven. 41 refuted. 0 times theorem prover too weak. 66 trivial. 40 not checked. [2022-11-16 12:06:39,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:06:41,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:06:41,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2030641900] [2022-11-16 12:06:41,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2030641900] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:06:41,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1767136538] [2022-11-16 12:06:41,946 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 12:06:41,946 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 12:06:41,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 12:06:41,947 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 12:06:41,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (58)] Waiting until timeout for monitored process [2022-11-16 12:06:42,668 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:06:42,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397624210] [2022-11-16 12:06:42,669 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 12:06:42,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:06:42,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:06:42,672 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:06:42,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-11-16 12:06:42,688 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (58)] Forceful destruction successful, exit code 1 [2022-11-16 12:07:18,113 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-11-16 12:07:18,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:07:18,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-16 12:07:18,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:07:18,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:07:20,249 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_5659 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_5659))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:07:20,281 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_5660 (_ BitVec 1))) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_5660) |c_#valid|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:07:20,318 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_5660 (_ BitVec 1))) (and (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_5660) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:07:20,390 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5659 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_477 (_ BitVec 32)) (v_ArrVal_5660 (_ BitVec 1))) (let ((.cse0 (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_5659))) (and (= (store .cse0 v_nondet_tree_~n~0.base_477 v_ArrVal_5660) |c_#valid|) (= (_ bv0 1) (select .cse0 v_nondet_tree_~n~0.base_477)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 12:07:24,899 INFO L321 Elim1Store]: treesize reduction 144, result has 23.0 percent of original size [2022-11-16 12:07:24,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 114 treesize of output 141 [2022-11-16 12:07:24,978 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 124 proven. 13 refuted. 0 times theorem prover too weak. 74 trivial. 56 not checked. [2022-11-16 12:07:24,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:07:33,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397624210] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:07:33,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:07:33,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2022-11-16 12:07:33,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329957335] [2022-11-16 12:07:33,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:07:33,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 12:07:33,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:07:33,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 12:07:33,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=98, Unknown=21, NotChecked=216, Total=380 [2022-11-16 12:07:33,307 INFO L87 Difference]: Start difference. First operand 476 states and 718 transitions. Second operand has 18 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 17 states have internal predecessors, (67), 14 states have call successors, (18), 2 states have call predecessors, (18), 8 states have return successors, (17), 10 states have call predecessors, (17), 14 states have call successors, (17) [2022-11-16 12:08:17,792 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5659 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_477 (_ BitVec 32)) (v_ArrVal_5660 (_ BitVec 1))) (let ((.cse0 (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_5659))) (and (= (store .cse0 v_nondet_tree_~n~0.base_477 v_ArrVal_5660) |c_#valid|) (= (_ bv0 1) (select .cse0 v_nondet_tree_~n~0.base_477)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) (exists ((v_nondet_tree_~n~0.base_456 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_457 (_ BitVec 32)) (v_ArrVal_5333 (_ BitVec 1)) (v_ArrVal_5332 (_ BitVec 1))) (let ((.cse1 (store |c_old(#valid)| v_nondet_tree_~n~0.base_457 v_ArrVal_5332))) (and (= (_ bv0 1) (select .cse1 v_nondet_tree_~n~0.base_456)) (= (store (store .cse1 v_nondet_tree_~n~0.base_456 v_ArrVal_5333) nondet_tree_~n~0.base (_ bv1 1)) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_457))))) (exists ((v_nondet_tree_~n~0.base_456 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_5333 (_ BitVec 1))) (and (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_456)) (= (store (store |c_old(#valid)| v_nondet_tree_~n~0.base_456 v_ArrVal_5333) nondet_tree_~n~0.base (_ bv1 1)) |c_#valid|)))) is different from true [2022-11-16 12:08:33,896 WARN L233 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:08:40,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:08:40,267 INFO L93 Difference]: Finished difference Result 485 states and 728 transitions. [2022-11-16 12:08:40,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 12:08:40,268 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 17 states have internal predecessors, (67), 14 states have call successors, (18), 2 states have call predecessors, (18), 8 states have return successors, (17), 10 states have call predecessors, (17), 14 states have call successors, (17) Word has length 79 [2022-11-16 12:08:40,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:08:40,271 INFO L225 Difference]: With dead ends: 485 [2022-11-16 12:08:40,271 INFO L226 Difference]: Without dead ends: 485 [2022-11-16 12:08:40,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 88.9s TimeCoverageRelationStatistics Valid=106, Invalid=228, Unknown=44, NotChecked=378, Total=756 [2022-11-16 12:08:40,272 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 68 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2465 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:08:40,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 629 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 250 Invalid, 0 Unknown, 2465 Unchecked, 0.5s Time] [2022-11-16 12:08:40,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-11-16 12:08:40,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 479. [2022-11-16 12:08:40,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 312 states have (on average 1.3461538461538463) internal successors, (420), 379 states have internal predecessors, (420), 63 states have call successors, (63), 27 states have call predecessors, (63), 44 states have return successors, (239), 72 states have call predecessors, (239), 63 states have call successors, (239) [2022-11-16 12:08:40,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 722 transitions. [2022-11-16 12:08:40,292 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 722 transitions. Word has length 79 [2022-11-16 12:08:40,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:08:40,292 INFO L495 AbstractCegarLoop]: Abstraction has 479 states and 722 transitions. [2022-11-16 12:08:40,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 17 states have internal predecessors, (67), 14 states have call successors, (18), 2 states have call predecessors, (18), 8 states have return successors, (17), 10 states have call predecessors, (17), 14 states have call successors, (17) [2022-11-16 12:08:40,293 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 722 transitions. [2022-11-16 12:08:40,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-16 12:08:40,294 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:08:40,295 INFO L195 NwaCegarLoop]: trace histogram [8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1] [2022-11-16 12:08:40,313 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (57)] Forceful destruction successful, exit code 0 [2022-11-16 12:08:40,533 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-11-16 12:08:40,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,59 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:08:40,711 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting nondet_treeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 12:08:40,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:08:40,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1773603623, now seen corresponding path program 8 times [2022-11-16 12:08:40,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:08:40,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772303219] [2022-11-16 12:08:40,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:08:40,712 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:08:40,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:08:40,713 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:08:40,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (60)] Waiting until timeout for monitored process [2022-11-16 12:08:41,291 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:08:41,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:08:41,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-16 12:08:41,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:08:41,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:08:41,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:08:41,459 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_5789 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_5789))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:08:41,501 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_5789 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_5789)))) is different from true [2022-11-16 12:08:41,527 WARN L855 $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-11-16 12:08:41,623 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_498 (_ BitVec 32))) (= |c_#length| (store (store |c_old(#length)| v_nondet_tree_~n~0.base_498 (_ bv12 32)) nondet_tree_~n~0.base (_ bv12 32)))) is different from true [2022-11-16 12:08:41,652 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_498 (_ BitVec 32)) (v_nondet_tree_~n~0.base_499 (_ BitVec 32)) (v_ArrVal_5789 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_499)) (= |c_#length| (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_499 v_ArrVal_5789) v_nondet_tree_~n~0.base_498 (_ bv12 32)) nondet_tree_~n~0.base (_ bv12 32))))) is different from true [2022-11-16 12:08:41,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:08:41,797 INFO L321 Elim1Store]: treesize reduction 67, result has 25.6 percent of original size [2022-11-16 12:08:41,798 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-11-16 12:08:41,820 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:08:41,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 12:08:41,863 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 34 trivial. 75 not checked. [2022-11-16 12:08:41,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:08:44,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:08:44,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772303219] [2022-11-16 12:08:44,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772303219] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:08:44,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1023114785] [2022-11-16 12:08:44,373 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:08:44,373 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 12:08:44,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 12:08:44,374 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 12:08:44,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (61)] Waiting until timeout for monitored process [2022-11-16 12:08:45,343 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:08:45,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:08:45,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-16 12:08:45,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:08:45,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:08:45,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:08:45,461 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_5910 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_5910))) (exists ((v_ArrVal_5909 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_5909) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:08:45,514 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5909 (_ BitVec 32)) (v_ArrVal_5910 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_5910)) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_5909) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:08:45,557 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_5911 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_5911) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:08:45,594 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_5911 (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_5911) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:08:45,687 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_519 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_5911 (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_5911) v_nondet_tree_~n~0.base_519 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:08:45,735 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_519 (_ BitVec 32)) (v_ArrVal_5909 (_ BitVec 32)) (v_ArrVal_5910 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_520 (_ BitVec 32)) (v_ArrVal_5911 (_ BitVec 32))) (and (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_520) (_ bv0 1)) (= (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_520 v_ArrVal_5909) nondet_tree_~n~0.base v_ArrVal_5911) v_nondet_tree_~n~0.base_519 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select (store |c_old(#valid)| v_nondet_tree_~n~0.base_520 v_ArrVal_5910) nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:08:45,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:08:45,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:08:45,899 INFO L321 Elim1Store]: treesize reduction 47, result has 36.5 percent of original size [2022-11-16 12:08:45,899 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-11-16 12:08:45,963 INFO L321 Elim1Store]: treesize reduction 17, result has 45.2 percent of original size [2022-11-16 12:08:45,964 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-11-16 12:08:46,010 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 81 not checked. [2022-11-16 12:08:46,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:08:48,441 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv12 32) c_nondet_tree_~n~0.offset))) (and (or (bvule (bvadd (_ bv8 32) c_nondet_tree_~n~0.offset) .cse0) (forall ((v_ArrVal_5923 (_ BitVec 1)) (v_nondet_tree_~n~0.base_537 (_ BitVec 32)) (v_nondet_tree_~n~0.base_538 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_nondet_tree_~n~0.base_537))) (not (= (select (store |c_#valid| v_nondet_tree_~n~0.base_537 v_ArrVal_5923) v_nondet_tree_~n~0.base_538) (_ bv0 1)))))) (forall ((v_nondet_tree_~n~0.base_537 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_nondet_tree_~n~0.base_537))) (forall ((v_ArrVal_5923 (_ BitVec 1)) (v_nondet_tree_~n~0.base_538 (_ BitVec 32))) (or (forall ((v_nondet_tree_~n~0.base_539 (_ BitVec 32)) (v_ArrVal_5925 (_ BitVec 32)) (v_ArrVal_5924 (_ BitVec 32))) (bvule .cse0 (select (store (store (store |c_#length| v_nondet_tree_~n~0.base_537 v_ArrVal_5925) v_nondet_tree_~n~0.base_538 v_ArrVal_5924) v_nondet_tree_~n~0.base_539 (_ bv12 32)) c_nondet_tree_~n~0.base))) (not (= (select (store |c_#valid| v_nondet_tree_~n~0.base_537 v_ArrVal_5923) v_nondet_tree_~n~0.base_538) (_ bv0 1))))))))) is different from false [2022-11-16 12:08:48,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1023114785] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:08:48,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:08:48,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 16 [2022-11-16 12:08:48,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807208043] [2022-11-16 12:08:48,447 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:08:48,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-16 12:08:48,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:08:48,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-16 12:08:48,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=49, Unknown=13, NotChecked=276, Total=380 [2022-11-16 12:08:48,448 INFO L87 Difference]: Start difference. First operand 479 states and 722 transitions. Second operand has 17 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 9 states have call successors, (11), 3 states have call predecessors, (11), 7 states have return successors, (12), 10 states have call predecessors, (12), 8 states have call successors, (12) [2022-11-16 12:08:48,741 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_nondet_tree_~n~0.base_519 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_5911 (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_5911) v_nondet_tree_~n~0.base_519 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_498 (_ BitVec 32))) (= |c_#length| (store (store |c_old(#length)| v_nondet_tree_~n~0.base_498 (_ bv12 32)) nondet_tree_~n~0.base (_ bv12 32))))) is different from true [2022-11-16 12:08:49,159 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_498 (_ BitVec 32)) (v_nondet_tree_~n~0.base_499 (_ BitVec 32)) (v_ArrVal_5789 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_499)) (= |c_#length| (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_499 v_ArrVal_5789) v_nondet_tree_~n~0.base_498 (_ bv12 32)) nondet_tree_~n~0.base (_ bv12 32))))) (exists ((v_nondet_tree_~n~0.base_519 (_ BitVec 32)) (v_ArrVal_5909 (_ BitVec 32)) (v_ArrVal_5910 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_520 (_ BitVec 32)) (v_ArrVal_5911 (_ BitVec 32))) (and (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_520) (_ bv0 1)) (= (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_520 v_ArrVal_5909) nondet_tree_~n~0.base v_ArrVal_5911) v_nondet_tree_~n~0.base_519 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select (store |c_old(#valid)| v_nondet_tree_~n~0.base_520 v_ArrVal_5910) nondet_tree_~n~0.base))))) is different from true [2022-11-16 12:08:49,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:08:49,247 INFO L93 Difference]: Finished difference Result 485 states and 756 transitions. [2022-11-16 12:08:49,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:08:49,248 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 9 states have call successors, (11), 3 states have call predecessors, (11), 7 states have return successors, (12), 10 states have call predecessors, (12), 8 states have call successors, (12) Word has length 59 [2022-11-16 12:08:49,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:08:49,251 INFO L225 Difference]: With dead ends: 485 [2022-11-16 12:08:49,251 INFO L226 Difference]: Without dead ends: 485 [2022-11-16 12:08:49,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 102 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=52, Invalid=61, Unknown=15, NotChecked=378, Total=506 [2022-11-16 12:08:49,252 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 119 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 2657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2388 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:08:49,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 301 Invalid, 2657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 230 Invalid, 0 Unknown, 2388 Unchecked, 0.6s Time] [2022-11-16 12:08:49,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-11-16 12:08:49,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 484. [2022-11-16 12:08:49,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 316 states have (on average 1.3449367088607596) internal successors, (425), 382 states have internal predecessors, (425), 63 states have call successors, (63), 27 states have call predecessors, (63), 45 states have return successors, (268), 74 states have call predecessors, (268), 63 states have call successors, (268) [2022-11-16 12:08:49,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 756 transitions. [2022-11-16 12:08:49,270 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 756 transitions. Word has length 59 [2022-11-16 12:08:49,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:08:49,271 INFO L495 AbstractCegarLoop]: Abstraction has 484 states and 756 transitions. [2022-11-16 12:08:49,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 9 states have call successors, (11), 3 states have call predecessors, (11), 7 states have return successors, (12), 10 states have call predecessors, (12), 8 states have call successors, (12) [2022-11-16 12:08:49,271 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 756 transitions. [2022-11-16 12:08:49,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-16 12:08:49,273 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:08:49,273 INFO L195 NwaCegarLoop]: trace histogram [12, 8, 7, 7, 7, 7, 7, 7, 7, 7, 5, 4, 4, 1, 1, 1, 1] [2022-11-16 12:08:49,296 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (60)] Forceful destruction successful, exit code 0 [2022-11-16 12:08:49,495 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (61)] Forceful destruction successful, exit code 0 [2022-11-16 12:08:49,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,61 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt [2022-11-16 12:08:49,688 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting nondet_treeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 12:08:49,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:08:49,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1125888740, now seen corresponding path program 6 times [2022-11-16 12:08:49,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:08:49,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1262884084] [2022-11-16 12:08:49,689 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 12:08:49,689 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:08:49,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:08:49,690 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:08:49,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (62)] Waiting until timeout for monitored process [2022-11-16 12:08:51,364 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-11-16 12:08:51,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:08:51,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-16 12:08:51,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:08:51,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:08:51,456 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_6112 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_6112))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:08:51,485 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_6112 (_ BitVec 1))) (and (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_6112)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:08:51,505 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6113 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_6113))) is different from true [2022-11-16 12:08:51,531 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6114 (_ BitVec 1))) (= (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_6114) |c_#valid|)) is different from true [2022-11-16 12:08:51,567 WARN L855 $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-11-16 12:08:51,595 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_540 (_ BitVec 32)) (v_ArrVal_6113 (_ BitVec 1))) (= (store (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_6113) v_nondet_tree_~n~0.base_540 (_ bv1 1)) |c_#valid|)) is different from true [2022-11-16 12:08:56,002 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:08:56,087 INFO L321 Elim1Store]: treesize reduction 88, result has 29.6 percent of original size [2022-11-16 12:08:56,088 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 5 case distinctions, treesize of input 25 treesize of output 52 [2022-11-16 12:08:56,111 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 199 proven. 26 refuted. 0 times theorem prover too weak. 99 trivial. 55 not checked. [2022-11-16 12:08:56,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:08:56,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:08:56,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1262884084] [2022-11-16 12:08:56,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1262884084] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:08:56,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2087346655] [2022-11-16 12:08:56,626 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 12:08:56,626 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 12:08:56,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 12:08:56,627 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 12:08:56,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (63)] Waiting until timeout for monitored process [2022-11-16 12:08:57,903 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:08:57,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359979748] [2022-11-16 12:08:57,904 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 12:08:57,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:08:57,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:08:57,907 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:08:57,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-11-16 12:08:57,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (63)] Forceful destruction successful, exit code 1 [2022-11-16 12:11:09,904 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-11-16 12:11:09,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:11:09,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-16 12:11:09,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:11:09,964 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6499 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_6499))) is different from true [2022-11-16 12:11:09,996 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6500 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_6500))) is different from true [2022-11-16 12:11:10,025 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6501 (_ BitVec 1))) (= (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_6501) |c_#valid|)) is different from true [2022-11-16 12:11:10,092 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_570 (_ BitVec 32)) (v_ArrVal_6500 (_ BitVec 1))) (= (store (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_6500) v_nondet_tree_~n~0.base_570 (_ bv1 1)) |c_#valid|)) is different from true [2022-11-16 12:11:10,157 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_540 (_ BitVec 32)) (v_nondet_tree_~n~0.base_571 (_ BitVec 32)) (v_ArrVal_6499 (_ BitVec 1)) (v_ArrVal_6113 (_ BitVec 1))) (and (= (store (store (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_6499) v_nondet_tree_~n~0.base_571 v_ArrVal_6113) v_nondet_tree_~n~0.base_540 (_ bv1 1)) |c_#valid|) (= (bvadd (select |c_#valid| v_nondet_tree_~n~0.base_571) (_ bv1 1)) (_ bv0 1)))) is different from true [2022-11-16 12:11:12,413 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:11:12,413 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:11:12,489 INFO L321 Elim1Store]: treesize reduction 70, result has 32.0 percent of original size [2022-11-16 12:11:12,490 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 3 case distinctions, treesize of input 20 treesize of output 45 [2022-11-16 12:11:12,518 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 205 proven. 21 refuted. 0 times theorem prover too weak. 111 trivial. 42 not checked. [2022-11-16 12:11:12,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:11:13,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359979748] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:11:13,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:11:13,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2022-11-16 12:11:13,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683728747] [2022-11-16 12:11:13,170 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:11:13,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-16 12:11:13,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:11:13,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-16 12:11:13,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=77, Unknown=14, NotChecked=308, Total=462 [2022-11-16 12:11:13,171 INFO L87 Difference]: Start difference. First operand 484 states and 756 transitions. Second operand has 19 states, 18 states have (on average 3.5) internal successors, (63), 16 states have internal predecessors, (63), 10 states have call successors, (17), 2 states have call predecessors, (17), 6 states have return successors, (17), 12 states have call predecessors, (17), 10 states have call successors, (17) [2022-11-16 12:11:21,926 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_nondet_tree_~n~0.base_540 (_ BitVec 32)) (v_ArrVal_6113 (_ BitVec 1))) (= (store (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_6113) v_nondet_tree_~n~0.base_540 (_ bv1 1)) |c_#valid|)) (exists ((v_nondet_tree_~n~0.base_570 (_ BitVec 32)) (v_ArrVal_6500 (_ BitVec 1))) (= (store (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_6500) v_nondet_tree_~n~0.base_570 (_ bv1 1)) |c_#valid|))) is different from true [2022-11-16 12:11:26,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:11:26,758 INFO L93 Difference]: Finished difference Result 488 states and 760 transitions. [2022-11-16 12:11:26,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:11:26,759 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.5) internal successors, (63), 16 states have internal predecessors, (63), 10 states have call successors, (17), 2 states have call predecessors, (17), 6 states have return successors, (17), 12 states have call predecessors, (17), 10 states have call successors, (17) Word has length 93 [2022-11-16 12:11:26,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:11:26,762 INFO L225 Difference]: With dead ends: 488 [2022-11-16 12:11:26,762 INFO L226 Difference]: Without dead ends: 488 [2022-11-16 12:11:26,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 170 SyntacticMatches, 13 SemanticMatches, 24 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=94, Invalid=119, Unknown=17, NotChecked=420, Total=650 [2022-11-16 12:11:26,763 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 69 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 3132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2861 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:11:26,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 472 Invalid, 3132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 257 Invalid, 0 Unknown, 2861 Unchecked, 0.6s Time] [2022-11-16 12:11:26,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-11-16 12:11:26,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 483. [2022-11-16 12:11:26,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 315 states have (on average 1.3428571428571427) internal successors, (423), 382 states have internal predecessors, (423), 63 states have call successors, (63), 27 states have call predecessors, (63), 45 states have return successors, (268), 73 states have call predecessors, (268), 63 states have call successors, (268) [2022-11-16 12:11:26,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 754 transitions. [2022-11-16 12:11:26,803 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 754 transitions. Word has length 93 [2022-11-16 12:11:26,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:11:26,804 INFO L495 AbstractCegarLoop]: Abstraction has 483 states and 754 transitions. [2022-11-16 12:11:26,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.5) internal successors, (63), 16 states have internal predecessors, (63), 10 states have call successors, (17), 2 states have call predecessors, (17), 6 states have return successors, (17), 12 states have call predecessors, (17), 10 states have call successors, (17) [2022-11-16 12:11:26,805 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 754 transitions. [2022-11-16 12:11:26,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-16 12:11:26,806 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:26,807 INFO L195 NwaCegarLoop]: trace histogram [11, 7, 7, 7, 7, 7, 7, 6, 6, 6, 4, 4, 4, 1, 1, 1, 1] [2022-11-16 12:11:26,827 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (62)] Forceful destruction successful, exit code 0 [2022-11-16 12:11:27,061 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2022-11-16 12:11:27,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,64 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:11:27,224 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 12:11:27,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:27,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1079152083, now seen corresponding path program 5 times [2022-11-16 12:11:27,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:11:27,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1298236107] [2022-11-16 12:11:27,225 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 12:11:27,226 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:11:27,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:11:27,227 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:11:27,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (65)] Waiting until timeout for monitored process [2022-11-16 12:11:28,765 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-11-16 12:11:28,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:11:28,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-16 12:11:28,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:11:28,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:11:28,868 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_6710 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_6710))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:11:28,900 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_6710 (_ BitVec 1))) (and (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_6710)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:11:31,018 WARN L855 $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-11-16 12:11:33,296 INFO L321 Elim1Store]: treesize reduction 123, result has 21.7 percent of original size [2022-11-16 12:11:33,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 56 [2022-11-16 12:11:33,358 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 177 proven. 12 refuted. 0 times theorem prover too weak. 84 trivial. 54 not checked. [2022-11-16 12:11:33,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:11:39,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:11:39,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1298236107] [2022-11-16 12:11:39,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1298236107] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:11:39,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [591592247] [2022-11-16 12:11:39,668 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 12:11:39,669 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 12:11:39,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 12:11:39,670 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 12:11:39,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (66)] Waiting until timeout for monitored process [2022-11-16 12:11:41,803 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:11:41,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250169908] [2022-11-16 12:11:41,803 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 12:11:41,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:11:41,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:11:41,808 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:11:41,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-11-16 12:11:41,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (66)] Forceful destruction successful, exit code 1 [2022-11-16 12:13:47,403 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-11-16 12:13:47,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:13:47,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-16 12:13:47,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:13:47,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:13:47,468 WARN L855 $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_7079 (_ BitVec 1))) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_7079) |c_#valid|)))) is different from true [2022-11-16 12:13:53,987 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_7081 (_ BitVec 1))) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_7081) |c_#valid|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:13:54,041 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7081 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_7081) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:13:56,401 INFO L321 Elim1Store]: treesize reduction 123, result has 21.7 percent of original size [2022-11-16 12:13:56,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 56 [2022-11-16 12:13:56,447 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 177 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 38 not checked. [2022-11-16 12:13:56,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:14:06,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250169908] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:14:06,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:14:06,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 15 [2022-11-16 12:14:06,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660505833] [2022-11-16 12:14:06,832 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:14:06,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 12:14:06,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:14:06,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 12:14:06,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=96, Unknown=19, NotChecked=150, Total=306 [2022-11-16 12:14:06,833 INFO L87 Difference]: Start difference. First operand 483 states and 754 transitions. Second operand has 16 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 12 states have call successors, (16), 2 states have call predecessors, (16), 7 states have return successors, (15), 9 states have call predecessors, (15), 12 states have call successors, (15) [2022-11-16 12:14:10,975 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7081 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_7081) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_6710 (_ BitVec 1))) (and (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_6710)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (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-11-16 12:14:11,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:14:11,366 INFO L93 Difference]: Finished difference Result 488 states and 788 transitions. [2022-11-16 12:14:11,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:14:11,367 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 12 states have call successors, (16), 2 states have call predecessors, (16), 7 states have return successors, (15), 9 states have call predecessors, (15), 12 states have call successors, (15) Word has length 87 [2022-11-16 12:14:11,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:14:11,369 INFO L225 Difference]: With dead ends: 488 [2022-11-16 12:14:11,369 INFO L226 Difference]: Without dead ends: 488 [2022-11-16 12:14:11,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 158 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 32.9s TimeCoverageRelationStatistics Valid=55, Invalid=133, Unknown=22, NotChecked=210, Total=420 [2022-11-16 12:14:11,369 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 64 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 1961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1825 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:14:11,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 609 Invalid, 1961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 123 Invalid, 0 Unknown, 1825 Unchecked, 0.4s Time] [2022-11-16 12:14:11,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-11-16 12:14:11,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2022-11-16 12:14:11,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 319 states have (on average 1.341692789968652) internal successors, (428), 385 states have internal predecessors, (428), 63 states have call successors, (63), 27 states have call predecessors, (63), 46 states have return successors, (297), 75 states have call predecessors, (297), 63 states have call successors, (297) [2022-11-16 12:14:11,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 788 transitions. [2022-11-16 12:14:11,389 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 788 transitions. Word has length 87 [2022-11-16 12:14:11,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:14:11,390 INFO L495 AbstractCegarLoop]: Abstraction has 488 states and 788 transitions. [2022-11-16 12:14:11,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 12 states have call successors, (16), 2 states have call predecessors, (16), 7 states have return successors, (15), 9 states have call predecessors, (15), 12 states have call successors, (15) [2022-11-16 12:14:11,390 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 788 transitions. [2022-11-16 12:14:11,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-16 12:14:11,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:14:11,392 INFO L195 NwaCegarLoop]: trace histogram [10, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1] [2022-11-16 12:14:11,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2022-11-16 12:14:11,620 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (65)] Ended with exit code 0 [2022-11-16 12:14:11,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,65 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:14:11,807 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting nondet_treeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 12:14:11,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:14:11,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1638962191, now seen corresponding path program 5 times [2022-11-16 12:14:11,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:14:11,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1844567197] [2022-11-16 12:14:11,808 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 12:14:11,808 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:14:11,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:14:11,809 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:14:11,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (68)] Waiting until timeout for monitored process [2022-11-16 12:14:12,872 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2022-11-16 12:14:12,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:14:12,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-16 12:14:12,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:14:12,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:14:12,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:14:12,985 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_7253 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_7253))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (exists ((v_ArrVal_7254 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_7254))))) is different from true [2022-11-16 12:14:13,040 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_7255 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_7255) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:14:13,085 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7255 (_ BitVec 32)) (nondet_tree_~n~0.base (_ 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_7255) |c_#length|))) is different from true [2022-11-16 12:14:13,169 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7253 (_ BitVec 1)) (v_ArrVal_7255 (_ BitVec 32)) (v_ArrVal_7254 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_636 (_ BitVec 32))) (and (= (select (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_7253) v_nondet_tree_~n~0.base_636) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_7254) v_nondet_tree_~n~0.base_636 v_ArrVal_7255)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:14:13,217 WARN L855 $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-11-16 12:14:13,290 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7253 (_ BitVec 1)) (v_ArrVal_7255 (_ BitVec 32)) (v_ArrVal_7254 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_636 (_ BitVec 32)) (v_nondet_tree_~n~0.base_637 (_ BitVec 32))) (and (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_637) (_ bv0 1)) (= (select (store |c_old(#valid)| v_nondet_tree_~n~0.base_637 v_ArrVal_7253) v_nondet_tree_~n~0.base_636) (_ bv0 1)) (= (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_637 v_ArrVal_7254) v_nondet_tree_~n~0.base_636 v_ArrVal_7255) nondet_tree_~n~0.base (_ bv12 32)) |c_#length|))) is different from true [2022-11-16 12:14:13,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:14:13,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:14:13,448 INFO L321 Elim1Store]: treesize reduction 47, result has 36.5 percent of original size [2022-11-16 12:14:13,448 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-11-16 12:14:13,506 INFO L321 Elim1Store]: treesize reduction 17, result has 45.2 percent of original size [2022-11-16 12:14:13,506 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-11-16 12:14:13,562 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 127 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 66 not checked. [2022-11-16 12:14:13,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:14:16,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:14:16,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1844567197] [2022-11-16 12:14:16,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1844567197] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:14:16,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [518211117] [2022-11-16 12:14:16,344 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 12:14:16,344 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 12:14:16,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 12:14:16,345 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 12:14:16,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (69)] Waiting until timeout for monitored process [2022-11-16 12:14:18,609 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2022-11-16 12:14:18,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:14:18,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-16 12:14:18,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:14:18,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:14:18,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:14:18,697 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_7428 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_7428))) (exists ((v_ArrVal_7429 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_7429) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:14:18,756 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_7431 (_ BitVec 1))) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_7431) |c_#valid|)) (exists ((v_ArrVal_7430 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_7430) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:14:18,814 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7430 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_7431 (_ BitVec 1))) (and (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_7431) |c_#valid|) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_7430) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:14:18,959 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7428 (_ BitVec 1)) (v_ArrVal_7430 (_ BitVec 32)) (v_nondet_tree_~n~0.base_654 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_7431 (_ BitVec 1)) (v_ArrVal_7429 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| v_nondet_tree_~n~0.base_654 v_ArrVal_7428))) (and (= |c_#length| (store (store |c_old(#length)| v_nondet_tree_~n~0.base_654 v_ArrVal_7429) nondet_tree_~n~0.base v_ArrVal_7430)) (= |c_#valid| (store .cse0 nondet_tree_~n~0.base v_ArrVal_7431)) (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_654) (_ bv0 1)) (= (_ bv0 1) (select .cse0 nondet_tree_~n~0.base))))) is different from true [2022-11-16 12:14:19,035 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_7432 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_7432))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:14:19,082 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7432 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_7432)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:14:19,183 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7428 (_ BitVec 1)) (v_ArrVal_7432 (_ BitVec 32)) (v_ArrVal_7430 (_ BitVec 32)) (v_nondet_tree_~n~0.base_654 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_655 (_ BitVec 32)) (v_ArrVal_7431 (_ BitVec 1)) (v_ArrVal_7429 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| v_nondet_tree_~n~0.base_654 v_ArrVal_7428))) (and (= (_ bv0 1) (select (store .cse0 v_nondet_tree_~n~0.base_655 v_ArrVal_7431) nondet_tree_~n~0.base)) (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_654) (_ bv0 1)) (= (select .cse0 v_nondet_tree_~n~0.base_655) (_ bv0 1)) (= (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_654 v_ArrVal_7429) v_nondet_tree_~n~0.base_655 v_ArrVal_7430) nondet_tree_~n~0.base v_ArrVal_7432) |c_#length|)))) is different from true [2022-11-16 12:14:19,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:14:19,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:14:19,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:14:19,404 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-16 12:14:19,405 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 2 case distinctions, treesize of input 18 treesize of output 35 [2022-11-16 12:14:19,521 INFO L321 Elim1Store]: treesize reduction 38, result has 37.7 percent of original size [2022-11-16 12:14:19,521 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 75 treesize of output 89 [2022-11-16 12:14:19,599 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 127 proven. 18 refuted. 0 times theorem prover too weak. 37 trivial. 66 not checked. [2022-11-16 12:14:19,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:14:22,241 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) c_nondet_tree_~n~0.offset))) (and (or (forall ((v_nondet_tree_~n~0.base_670 (_ BitVec 32)) (v_nondet_tree_~n~0.base_671 (_ BitVec 32)) (v_nondet_tree_~n~0.base_669 (_ BitVec 32)) (v_ArrVal_7453 (_ BitVec 1)) (v_ArrVal_7452 (_ BitVec 1))) (let ((.cse0 (store |c_#valid| v_nondet_tree_~n~0.base_669 v_ArrVal_7453))) (or (not (= (select |c_#valid| v_nondet_tree_~n~0.base_669) (_ bv0 1))) (not (= (select (store .cse0 v_nondet_tree_~n~0.base_671 v_ArrVal_7452) v_nondet_tree_~n~0.base_670) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_nondet_tree_~n~0.base_671)))))) (bvule (bvadd (_ bv4 32) c_nondet_tree_~n~0.offset) .cse1)) (forall ((v_nondet_tree_~n~0.base_669 (_ BitVec 32))) (or (not (= (select |c_#valid| v_nondet_tree_~n~0.base_669) (_ bv0 1))) (forall ((v_nondet_tree_~n~0.base_671 (_ BitVec 32)) (v_ArrVal_7453 (_ BitVec 1))) (let ((.cse2 (store |c_#valid| v_nondet_tree_~n~0.base_669 v_ArrVal_7453))) (or (forall ((v_nondet_tree_~n~0.base_670 (_ BitVec 32)) (v_ArrVal_7452 (_ BitVec 1))) (or (forall ((v_ArrVal_7456 (_ BitVec 32)) (v_ArrVal_7455 (_ BitVec 32)) (v_ArrVal_7454 (_ BitVec 32))) (bvule .cse1 (select (store (store (store |c_#length| v_nondet_tree_~n~0.base_669 v_ArrVal_7455) v_nondet_tree_~n~0.base_671 v_ArrVal_7454) v_nondet_tree_~n~0.base_670 v_ArrVal_7456) c_nondet_tree_~n~0.base))) (not (= (select (store .cse2 v_nondet_tree_~n~0.base_671 v_ArrVal_7452) v_nondet_tree_~n~0.base_670) (_ bv0 1))))) (not (= (_ bv0 1) (select .cse2 v_nondet_tree_~n~0.base_671)))))))))) is different from false [2022-11-16 12:14:22,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [518211117] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:14:22,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:14:22,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 18 [2022-11-16 12:14:22,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326188871] [2022-11-16 12:14:22,247 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:14:22,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-16 12:14:22,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:14:22,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-16 12:14:22,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=51, Unknown=15, NotChecked=350, Total=462 [2022-11-16 12:14:22,248 INFO L87 Difference]: Start difference. First operand 488 states and 788 transitions. Second operand has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 13 states have call successors, (16), 3 states have call predecessors, (16), 9 states have return successors, (16), 10 states have call predecessors, (16), 13 states have call successors, (16) [2022-11-16 12:14:22,405 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) |c_#length|)) (exists ((v_ArrVal_7432 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_7432)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((v_ArrVal_7255 (_ BitVec 32)) (nondet_tree_~n~0.base (_ 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_7255) |c_#length|))) (exists ((v_ArrVal_7430 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_7431 (_ BitVec 1))) (and (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_7431) |c_#valid|) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_7430) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 12:14:23,038 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7428 (_ BitVec 1)) (v_ArrVal_7430 (_ BitVec 32)) (v_nondet_tree_~n~0.base_654 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_7431 (_ BitVec 1)) (v_ArrVal_7429 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| v_nondet_tree_~n~0.base_654 v_ArrVal_7428))) (and (= |c_#length| (store (store |c_old(#length)| v_nondet_tree_~n~0.base_654 v_ArrVal_7429) nondet_tree_~n~0.base v_ArrVal_7430)) (= |c_#valid| (store .cse0 nondet_tree_~n~0.base v_ArrVal_7431)) (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_654) (_ bv0 1)) (= (_ bv0 1) (select .cse0 nondet_tree_~n~0.base))))) (exists ((v_ArrVal_7253 (_ BitVec 1)) (v_ArrVal_7255 (_ BitVec 32)) (v_ArrVal_7254 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_636 (_ BitVec 32))) (and (= (select (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_7253) v_nondet_tree_~n~0.base_636) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_7254) v_nondet_tree_~n~0.base_636 v_ArrVal_7255)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 12:14:23,222 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7428 (_ BitVec 1)) (v_ArrVal_7432 (_ BitVec 32)) (v_ArrVal_7430 (_ BitVec 32)) (v_nondet_tree_~n~0.base_654 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_655 (_ BitVec 32)) (v_ArrVal_7431 (_ BitVec 1)) (v_ArrVal_7429 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| v_nondet_tree_~n~0.base_654 v_ArrVal_7428))) (and (= (_ bv0 1) (select (store .cse0 v_nondet_tree_~n~0.base_655 v_ArrVal_7431) nondet_tree_~n~0.base)) (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_654) (_ bv0 1)) (= (select .cse0 v_nondet_tree_~n~0.base_655) (_ bv0 1)) (= (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_654 v_ArrVal_7429) v_nondet_tree_~n~0.base_655 v_ArrVal_7430) nondet_tree_~n~0.base v_ArrVal_7432) |c_#length|)))) (exists ((v_ArrVal_7253 (_ BitVec 1)) (v_ArrVal_7255 (_ BitVec 32)) (v_ArrVal_7254 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_636 (_ BitVec 32)) (v_nondet_tree_~n~0.base_637 (_ BitVec 32))) (and (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_637) (_ bv0 1)) (= (select (store |c_old(#valid)| v_nondet_tree_~n~0.base_637 v_ArrVal_7253) v_nondet_tree_~n~0.base_636) (_ bv0 1)) (= (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_637 v_ArrVal_7254) v_nondet_tree_~n~0.base_636 v_ArrVal_7255) nondet_tree_~n~0.base (_ bv12 32)) |c_#length|)))) is different from true [2022-11-16 12:14:23,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:14:23,315 INFO L93 Difference]: Finished difference Result 488 states and 787 transitions. [2022-11-16 12:14:23,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:14:23,320 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 13 states have call successors, (16), 3 states have call predecessors, (16), 9 states have return successors, (16), 10 states have call predecessors, (16), 13 states have call successors, (16) Word has length 77 [2022-11-16 12:14:23,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:14:23,323 INFO L225 Difference]: With dead ends: 488 [2022-11-16 12:14:23,323 INFO L226 Difference]: Without dead ends: 488 [2022-11-16 12:14:23,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=58, Invalid=64, Unknown=18, NotChecked=510, Total=650 [2022-11-16 12:14:23,324 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 117 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 3185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2782 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:14:23,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 360 Invalid, 3185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 364 Invalid, 0 Unknown, 2782 Unchecked, 0.9s Time] [2022-11-16 12:14:23,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-11-16 12:14:23,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 487. [2022-11-16 12:14:23,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 318 states have (on average 1.3396226415094339) internal successors, (426), 385 states have internal predecessors, (426), 63 states have call successors, (63), 27 states have call predecessors, (63), 46 states have return successors, (297), 74 states have call predecessors, (297), 63 states have call successors, (297) [2022-11-16 12:14:23,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 786 transitions. [2022-11-16 12:14:23,344 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 786 transitions. Word has length 77 [2022-11-16 12:14:23,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:14:23,344 INFO L495 AbstractCegarLoop]: Abstraction has 487 states and 786 transitions. [2022-11-16 12:14:23,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 13 states have call successors, (16), 3 states have call predecessors, (16), 9 states have return successors, (16), 10 states have call predecessors, (16), 13 states have call successors, (16) [2022-11-16 12:14:23,345 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 786 transitions. [2022-11-16 12:14:23,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-16 12:14:23,346 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:14:23,347 INFO L195 NwaCegarLoop]: trace histogram [10, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1] [2022-11-16 12:14:23,366 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (68)] Forceful destruction successful, exit code 0 [2022-11-16 12:14:23,577 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (69)] Forceful destruction successful, exit code 0 [2022-11-16 12:14:23,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,69 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt [2022-11-16 12:14:23,764 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 12:14:23,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:14:23,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1920692430, now seen corresponding path program 6 times [2022-11-16 12:14:23,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:14:23,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [278024163] [2022-11-16 12:14:23,764 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 12:14:23,765 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:14:23,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:14:23,765 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:14:23,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (70)] Waiting until timeout for monitored process [2022-11-16 12:14:24,883 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-11-16 12:14:24,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:14:24,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-16 12:14:24,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:14:24,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:14:24,994 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_7615 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_7615))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:14:25,030 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7615 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_7615)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:14:27,166 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7616 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_7616))) is different from true [2022-11-16 12:14:27,200 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7617 (_ BitVec 1))) (= (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_7617) |c_#valid|)) is different from true [2022-11-16 12:14:28,498 WARN L855 $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-11-16 12:14:28,530 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7616 (_ BitVec 1)) (v_nondet_tree_~n~0.base_673 (_ BitVec 32))) (= (store (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_7616) v_nondet_tree_~n~0.base_673 (_ bv1 1)) |c_#valid|)) is different from true [2022-11-16 12:14:31,052 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:14:31,222 INFO L321 Elim1Store]: treesize reduction 183, result has 20.8 percent of original size [2022-11-16 12:14:31,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 70 [2022-11-16 12:14:31,328 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 73 proven. 31 refuted. 0 times theorem prover too weak. 59 trivial. 85 not checked. [2022-11-16 12:14:31,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:14:35,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:14:35,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [278024163] [2022-11-16 12:14:35,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [278024163] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:14:35,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1554716957] [2022-11-16 12:14:35,744 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 12:14:35,744 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 12:14:35,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 12:14:35,745 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 12:14:35,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (71)] Waiting until timeout for monitored process [2022-11-16 12:14:36,889 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:14:36,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214905097] [2022-11-16 12:14:36,890 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 12:14:36,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:14:36,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:14:36,893 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:14:36,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-11-16 12:14:36,916 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d488d4-9674-47fa-9cab-62b9be24f738/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (71)] Forceful destruction successful, exit code 1 [2022-11-16 12:15:07,411 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-11-16 12:15:07,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:15:07,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-16 12:15:07,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:15:07,512 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_7945 (_ BitVec 1))) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_7945) |c_#valid|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:15:07,546 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7945 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_7945) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 12:15:07,610 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7945 (_ BitVec 1)) (v_nondet_tree_~n~0.base_700 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| c_nondet_tree_~n~0.base (_ bv1 1)))) (and (= (_ bv0 1) (select .cse0 v_nondet_tree_~n~0.base_700)) (= |c_#valid| (store .cse0 v_nondet_tree_~n~0.base_700 v_ArrVal_7945))))) is different from true [2022-11-16 12:15:07,638 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7946 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_7946))) is different from true [2022-11-16 12:15:07,670 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7947 (_ BitVec 1))) (= (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_7947) |c_#valid|)) is different from true [2022-11-16 12:15:15,780 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (= (bvadd (select |c_#valid| nondet_tree_~n~0.base) (_ bv1 1)) (_ bv0 1)) (exists ((v_ArrVal_7616 (_ BitVec 1)) (v_nondet_tree_~n~0.base_673 (_ BitVec 32)) (v_ArrVal_7945 (_ BitVec 1)) (v_nondet_tree_~n~0.base_702 (_ BitVec 32)) (v_nondet_tree_~n~0.base_700 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_nondet_tree_~n~0.base_702) (_ bv1 1))) (= (store (store (store .cse0 v_nondet_tree_~n~0.base_700 v_ArrVal_7945) v_nondet_tree_~n~0.base_702 v_ArrVal_7616) v_nondet_tree_~n~0.base_673 (_ bv1 1)) |c_#valid|) (= (_ bv0 1) (select .cse0 v_nondet_tree_~n~0.base_700))))))) is different from true [2022-11-16 12:15:15,836 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:15:15,836 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:15:15,956 INFO L321 Elim1Store]: treesize reduction 145, result has 20.3 percent of original size [2022-11-16 12:15:15,956 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 6 case distinctions, treesize of input 32 treesize of output 56 [2022-11-16 12:15:15,994 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 78 proven. 26 refuted. 0 times theorem prover too weak. 60 trivial. 84 not checked. [2022-11-16 12:15:15,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:15:16,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214905097] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:15:16,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:15:16,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 24 [2022-11-16 12:15:16,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387961063] [2022-11-16 12:15:16,783 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:15:16,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-16 12:15:16,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:15:16,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-16 12:15:16,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=195, Unknown=24, NotChecked=492, Total=812 [2022-11-16 12:15:16,784 INFO L87 Difference]: Start difference. First operand 487 states and 786 transitions. Second operand has 25 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 21 states have internal predecessors, (79), 15 states have call successors, (20), 2 states have call predecessors, (20), 9 states have return successors, (19), 16 states have call predecessors, (19), 15 states have call successors, (19)