./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/verifythis/tree_del_rec.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/verifythis/tree_del_rec.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 448d6e9f7f0c094a8335d652a2766ae983308e33ec1a543ceaed97ae79744722 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 15:51:43,279 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:51:43,281 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:51:43,324 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:51:43,325 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:51:43,328 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:51:43,331 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:51:43,334 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:51:43,336 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:51:43,341 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:51:43,342 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:51:43,343 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:51:43,343 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:51:43,344 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:51:43,345 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:51:43,346 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:51:43,347 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:51:43,348 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:51:43,349 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:51:43,356 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:51:43,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:51:43,362 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:51:43,364 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:51:43,365 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:51:43,377 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:51:43,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:51:43,378 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:51:43,380 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:51:43,381 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:51:43,382 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:51:43,382 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:51:43,383 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:51:43,384 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:51:43,385 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:51:43,386 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:51:43,386 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:51:43,387 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:51:43,387 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:51:43,387 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:51:43,388 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:51:43,389 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:51:43,389 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-11-25 15:51:43,432 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:51:43,432 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:51:43,433 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:51:43,433 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:51:43,434 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:51:43,434 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:51:43,435 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:51:43,435 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:51:43,435 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:51:43,436 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:51:43,437 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:51:43,437 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 15:51:43,437 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:51:43,437 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:51:43,437 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:51:43,438 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 15:51:43,438 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 15:51:43,438 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:51:43,438 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 15:51:43,438 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:51:43,439 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:51:43,439 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:51:43,439 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:51:43,439 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:51:43,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:51:43,440 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:51:43,440 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:51:43,440 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:51:43,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 15:51:43,441 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:51:43,441 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:51:43,441 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:51:43,442 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-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 -> 448d6e9f7f0c094a8335d652a2766ae983308e33ec1a543ceaed97ae79744722 [2022-11-25 15:51:43,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:51:43,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:51:43,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:51:43,741 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:51:43,742 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:51:43,743 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/verifythis/tree_del_rec.c [2022-11-25 15:51:46,800 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:51:47,075 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:51:47,076 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/sv-benchmarks/c/verifythis/tree_del_rec.c [2022-11-25 15:51:47,083 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/data/8d12f3cea/27c539477f0940b5b66592126b5ec163/FLAG622e57e47 [2022-11-25 15:51:47,096 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/data/8d12f3cea/27c539477f0940b5b66592126b5ec163 [2022-11-25 15:51:47,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:51:47,101 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:51:47,102 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:51:47,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:51:47,106 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:51:47,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:51:47" (1/1) ... [2022-11-25 15:51:47,108 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65fb268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:47, skipping insertion in model container [2022-11-25 15:51:47,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:51:47" (1/1) ... [2022-11-25 15:51:47,116 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:51:47,134 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:51:47,286 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/sv-benchmarks/c/verifythis/tree_del_rec.c[585,598] [2022-11-25 15:51:47,303 WARN L1576 CHandler]: Possible shadowing of function min [2022-11-25 15:51:47,305 WARN L1576 CHandler]: Possible shadowing of function min [2022-11-25 15:51:47,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:51:47,333 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-11-25 15:51:47,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@51ee39da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:47, skipping insertion in model container [2022-11-25 15:51:47,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:51:47,334 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-25 15:51:47,335 INFO L158 Benchmark]: Toolchain (without parser) took 234.12ms. Allocated memory is still 205.5MB. Free memory was 171.9MB in the beginning and 162.2MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 15:51:47,336 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 146.8MB. Free memory was 89.2MB in the beginning and 89.1MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:51:47,337 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.52ms. Allocated memory is still 205.5MB. Free memory was 171.9MB in the beginning and 162.2MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 15:51:47,338 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.23ms. Allocated memory is still 146.8MB. Free memory was 89.2MB in the beginning and 89.1MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 231.52ms. Allocated memory is still 205.5MB. Free memory was 171.9MB in the beginning and 162.2MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 28]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/verifythis/tree_del_rec.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 448d6e9f7f0c094a8335d652a2766ae983308e33ec1a543ceaed97ae79744722 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 15:51:49,611 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:51:49,614 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:51:49,655 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:51:49,656 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:51:49,660 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:51:49,662 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:51:49,667 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:51:49,670 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:51:49,675 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:51:49,676 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:51:49,677 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:51:49,677 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:51:49,678 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:51:49,679 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:51:49,680 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:51:49,681 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:51:49,682 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:51:49,683 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:51:49,685 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:51:49,690 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:51:49,693 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:51:49,695 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:51:49,696 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:51:49,711 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:51:49,711 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:51:49,712 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:51:49,713 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:51:49,713 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:51:49,714 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:51:49,715 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:51:49,715 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:51:49,716 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:51:49,717 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:51:49,718 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:51:49,732 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:51:49,733 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:51:49,733 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:51:49,734 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:51:49,734 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:51:49,735 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:51:49,739 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2022-11-25 15:51:49,777 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:51:49,777 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:51:49,778 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:51:49,779 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:51:49,780 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:51:49,780 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:51:49,781 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:51:49,781 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:51:49,782 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:51:49,782 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:51:49,783 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:51:49,783 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 15:51:49,784 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:51:49,784 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:51:49,784 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:51:49,784 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 15:51:49,785 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 15:51:49,785 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:51:49,785 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 15:51:49,786 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 15:51:49,786 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 15:51:49,786 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:51:49,786 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:51:49,787 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:51:49,787 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:51:49,787 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:51:49,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:51:49,788 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:51:49,788 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:51:49,789 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 15:51:49,789 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 15:51:49,789 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:51:49,790 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:51:49,790 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:51:49,790 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 15:51:49,791 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-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 -> 448d6e9f7f0c094a8335d652a2766ae983308e33ec1a543ceaed97ae79744722 [2022-11-25 15:51:50,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:51:50,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:51:50,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:51:50,239 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:51:50,239 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:51:50,241 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/verifythis/tree_del_rec.c [2022-11-25 15:51:53,502 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:51:53,690 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:51:53,691 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/sv-benchmarks/c/verifythis/tree_del_rec.c [2022-11-25 15:51:53,698 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/data/2a9d8c9fc/0a7ded565e1a4ecabee3aa4043d4b1e1/FLAGea133c2c5 [2022-11-25 15:51:53,716 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/data/2a9d8c9fc/0a7ded565e1a4ecabee3aa4043d4b1e1 [2022-11-25 15:51:53,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:51:53,727 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:51:53,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:51:53,730 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:51:53,735 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:51:53,736 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:51:53" (1/1) ... [2022-11-25 15:51:53,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dde4212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:53, skipping insertion in model container [2022-11-25 15:51:53,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:51:53" (1/1) ... [2022-11-25 15:51:53,745 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:51:53,770 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:51:53,972 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/sv-benchmarks/c/verifythis/tree_del_rec.c[585,598] [2022-11-25 15:51:53,995 WARN L1576 CHandler]: Possible shadowing of function min [2022-11-25 15:51:54,000 WARN L1576 CHandler]: Possible shadowing of function min [2022-11-25 15:51:54,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:51:54,053 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-25 15:51:54,065 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:51:54,076 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/sv-benchmarks/c/verifythis/tree_del_rec.c[585,598] [2022-11-25 15:51:54,088 WARN L1576 CHandler]: Possible shadowing of function min [2022-11-25 15:51:54,089 WARN L1576 CHandler]: Possible shadowing of function min [2022-11-25 15:51:54,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:51:54,113 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:51:54,131 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/sv-benchmarks/c/verifythis/tree_del_rec.c[585,598] [2022-11-25 15:51:54,144 WARN L1576 CHandler]: Possible shadowing of function min [2022-11-25 15:51:54,146 WARN L1576 CHandler]: Possible shadowing of function min [2022-11-25 15:51:54,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:51:54,183 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:51:54,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:54 WrapperNode [2022-11-25 15:51:54,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:51:54,185 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:51:54,185 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:51:54,185 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:51:54,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:54" (1/1) ... [2022-11-25 15:51:54,216 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:54" (1/1) ... [2022-11-25 15:51:54,246 INFO L138 Inliner]: procedures = 31, calls = 61, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 75 [2022-11-25 15:51:54,246 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:51:54,247 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:51:54,248 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:51:54,248 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:51:54,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:54" (1/1) ... [2022-11-25 15:51:54,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:54" (1/1) ... [2022-11-25 15:51:54,302 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:54" (1/1) ... [2022-11-25 15:51:54,303 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:54" (1/1) ... [2022-11-25 15:51:54,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:54" (1/1) ... [2022-11-25 15:51:54,316 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:54" (1/1) ... [2022-11-25 15:51:54,318 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:54" (1/1) ... [2022-11-25 15:51:54,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:54" (1/1) ... [2022-11-25 15:51:54,323 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:51:54,324 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:51:54,324 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:51:54,325 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:51:54,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:54" (1/1) ... [2022-11-25 15:51:54,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:51:54,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:51:54,371 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:51:54,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:51:54,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:51:54,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 15:51:54,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 15:51:54,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 15:51:54,419 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2022-11-25 15:51:54,419 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2022-11-25 15:51:54,420 INFO L130 BoogieDeclarations]: Found specification of procedure min [2022-11-25 15:51:54,420 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2022-11-25 15:51:54,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-25 15:51:54,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-25 15:51:54,421 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-25 15:51:54,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 15:51:54,421 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-11-25 15:51:54,421 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-11-25 15:51:54,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 15:51:54,422 INFO L130 BoogieDeclarations]: Found specification of procedure size [2022-11-25 15:51:54,422 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2022-11-25 15:51:54,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:51:54,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:51:54,423 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-25 15:51:54,423 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-25 15:51:54,423 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2022-11-25 15:51:54,424 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2022-11-25 15:51:54,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 15:51:54,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 15:51:54,537 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:51:54,539 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:51:55,327 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:51:55,348 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:51:55,349 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 15:51:55,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:51:55 BoogieIcfgContainer [2022-11-25 15:51:55,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:51:55,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:51:55,355 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:51:55,358 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:51:55,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:51:53" (1/3) ... [2022-11-25 15:51:55,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d2c0da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:51:55, skipping insertion in model container [2022-11-25 15:51:55,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:54" (2/3) ... [2022-11-25 15:51:55,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d2c0da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:51:55, skipping insertion in model container [2022-11-25 15:51:55,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:51:55" (3/3) ... [2022-11-25 15:51:55,363 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_rec.c [2022-11-25 15:51:55,381 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:51:55,382 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2022-11-25 15:51:55,440 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:51:55,447 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@19db1347, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:51:55,447 INFO L358 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2022-11-25 15:51:55,452 INFO L276 IsEmpty]: Start isEmpty. Operand has 174 states, 89 states have (on average 1.7640449438202248) internal successors, (157), 144 states have internal predecessors, (157), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-25 15:51:55,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 15:51:55,459 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:51:55,459 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 15:51:55,460 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-25 15:51:55,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:55,469 INFO L85 PathProgramCache]: Analyzing trace with hash 120433579, now seen corresponding path program 1 times [2022-11-25 15:51:55,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:51:55,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631931578] [2022-11-25 15:51:55,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:55,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-25 15:51:55,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:51:55,486 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:51:55,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-25 15:51:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:55,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 15:51:55,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:51:55,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 15:51:55,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:51:55,681 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:51:55,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:51:55,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631931578] [2022-11-25 15:51:55,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1631931578] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:51:55,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:51:55,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:51:55,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043446861] [2022-11-25 15:51:55,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:51:55,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:51:55,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:51:55,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:51:55,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:51:55,738 INFO L87 Difference]: Start difference. First operand has 174 states, 89 states have (on average 1.7640449438202248) internal successors, (157), 144 states have internal predecessors, (157), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) 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-25 15:51:56,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:51:56,078 INFO L93 Difference]: Finished difference Result 175 states and 200 transitions. [2022-11-25 15:51:56,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:51:56,081 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-25 15:51:56,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:51:56,092 INFO L225 Difference]: With dead ends: 175 [2022-11-25 15:51:56,093 INFO L226 Difference]: Without dead ends: 172 [2022-11-25 15:51:56,100 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-25 15:51:56,103 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 6 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 15:51:56,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 326 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 15:51:56,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-11-25 15:51:56,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2022-11-25 15:51:56,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 87 states have (on average 1.7011494252873562) internal successors, (148), 140 states have internal predecessors, (148), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-25 15:51:56,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 192 transitions. [2022-11-25 15:51:56,194 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 192 transitions. Word has length 5 [2022-11-25 15:51:56,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:51:56,194 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 192 transitions. [2022-11-25 15:51:56,195 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-25 15:51:56,195 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 192 transitions. [2022-11-25 15:51:56,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 15:51:56,196 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:51:56,196 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 15:51:56,219 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-25 15:51:56,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:51:56,415 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-25 15:51:56,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:56,416 INFO L85 PathProgramCache]: Analyzing trace with hash 120433580, now seen corresponding path program 1 times [2022-11-25 15:51:56,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:51:56,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42320742] [2022-11-25 15:51:56,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:56,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-25 15:51:56,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:51:56,418 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:51:56,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-25 15:51:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:56,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 15:51:56,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:51:56,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 15:51:56,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:51:56,530 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:51:56,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:51:56,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42320742] [2022-11-25 15:51:56,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42320742] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:51:56,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:51:56,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:51:56,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815647704] [2022-11-25 15:51:56,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:51:56,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:51:56,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:51:56,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:51:56,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:51:56,533 INFO L87 Difference]: Start difference. First operand 170 states and 192 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-25 15:51:56,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:51:56,819 INFO L93 Difference]: Finished difference Result 169 states and 191 transitions. [2022-11-25 15:51:56,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:51:56,820 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-25 15:51:56,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:51:56,821 INFO L225 Difference]: With dead ends: 169 [2022-11-25 15:51:56,822 INFO L226 Difference]: Without dead ends: 169 [2022-11-25 15:51:56,822 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-25 15:51:56,823 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 2 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 15:51:56,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 327 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 15:51:56,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-11-25 15:51:56,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-11-25 15:51:56,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 87 states have (on average 1.6896551724137931) internal successors, (147), 139 states have internal predecessors, (147), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-25 15:51:56,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 191 transitions. [2022-11-25 15:51:56,835 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 191 transitions. Word has length 5 [2022-11-25 15:51:56,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:51:56,835 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 191 transitions. [2022-11-25 15:51:56,836 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-25 15:51:56,836 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 191 transitions. [2022-11-25 15:51:56,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 15:51:56,836 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:51:56,837 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:51:56,852 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-25 15:51:57,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:51:57,048 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting minErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-25 15:51:57,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:57,048 INFO L85 PathProgramCache]: Analyzing trace with hash 854953177, now seen corresponding path program 1 times [2022-11-25 15:51:57,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:51:57,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1598752416] [2022-11-25 15:51:57,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:57,049 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:51:57,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:51:57,051 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:51:57,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-25 15:51:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:57,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 15:51:57,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:51:57,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:51:57,220 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:51:57,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:51:57,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1598752416] [2022-11-25 15:51:57,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1598752416] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:51:57,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:51:57,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 15:51:57,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951372963] [2022-11-25 15:51:57,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:51:57,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:51:57,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:51:57,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:51:57,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:51:57,224 INFO L87 Difference]: Start difference. First operand 169 states and 191 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-25 15:51:57,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:51:57,487 INFO L93 Difference]: Finished difference Result 233 states and 270 transitions. [2022-11-25 15:51:57,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 15:51:57,488 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-25 15:51:57,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:51:57,490 INFO L225 Difference]: With dead ends: 233 [2022-11-25 15:51:57,490 INFO L226 Difference]: Without dead ends: 233 [2022-11-25 15:51:57,491 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-25 15:51:57,496 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 91 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 15:51:57,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 1124 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 15:51:57,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-11-25 15:51:57,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 177. [2022-11-25 15:51:57,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 92 states have (on average 1.6521739130434783) internal successors, (152), 145 states have internal predecessors, (152), 23 states have call successors, (23), 8 states have call predecessors, (23), 9 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) [2022-11-25 15:51:57,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 201 transitions. [2022-11-25 15:51:57,525 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 201 transitions. Word has length 11 [2022-11-25 15:51:57,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:51:57,526 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 201 transitions. [2022-11-25 15:51:57,526 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-25 15:51:57,526 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 201 transitions. [2022-11-25 15:51:57,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 15:51:57,527 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:51:57,527 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:51:57,543 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-25 15:51:57,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:51:57,738 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-25 15:51:57,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:57,739 INFO L85 PathProgramCache]: Analyzing trace with hash 873486780, now seen corresponding path program 1 times [2022-11-25 15:51:57,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:51:57,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795948332] [2022-11-25 15:51:57,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:57,740 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:51:57,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:51:57,744 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:51:57,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-25 15:51:57,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:57,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 15:51:57,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:51:57,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 15:51:57,870 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-25 15:51:57,870 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:51:57,871 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:51:57,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795948332] [2022-11-25 15:51:57,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [795948332] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:51:57,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:51:57,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:51:57,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983993751] [2022-11-25 15:51:57,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:51:57,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:51:57,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:51:57,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:51:57,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:51:57,873 INFO L87 Difference]: Start difference. First operand 177 states and 201 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-25 15:51:58,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:51:58,411 INFO L93 Difference]: Finished difference Result 181 states and 205 transitions. [2022-11-25 15:51:58,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:51:58,412 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-25 15:51:58,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:51:58,414 INFO L225 Difference]: With dead ends: 181 [2022-11-25 15:51:58,414 INFO L226 Difference]: Without dead ends: 181 [2022-11-25 15:51:58,414 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-25 15:51:58,415 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 95 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 15:51:58,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 202 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 15:51:58,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-25 15:51:58,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2022-11-25 15:51:58,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 94 states have (on average 1.6595744680851063) internal successors, (156), 145 states have internal predecessors, (156), 23 states have call successors, (23), 8 states have call predecessors, (23), 9 states have return successors, (26), 25 states have call predecessors, (26), 23 states have call successors, (26) [2022-11-25 15:51:58,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 205 transitions. [2022-11-25 15:51:58,446 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 205 transitions. Word has length 11 [2022-11-25 15:51:58,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:51:58,447 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 205 transitions. [2022-11-25 15:51:58,447 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-25 15:51:58,447 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 205 transitions. [2022-11-25 15:51:58,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 15:51:58,448 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:51:58,448 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:51:58,464 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-25 15:51:58,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:51:58,649 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting nondet_treeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-25 15:51:58,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:58,649 INFO L85 PathProgramCache]: Analyzing trace with hash 873486781, now seen corresponding path program 1 times [2022-11-25 15:51:58,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:51:58,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584802358] [2022-11-25 15:51:58,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:58,650 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:51:58,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:51:58,652 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:51:58,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-25 15:51:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:58,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 15:51:58,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:51:58,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 15:51:58,781 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-25 15:51:58,781 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:51:58,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:51:58,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584802358] [2022-11-25 15:51:58,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1584802358] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:51:58,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:51:58,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:51:58,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109411528] [2022-11-25 15:51:58,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:51:58,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:51:58,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:51:58,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:51:58,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:51:58,784 INFO L87 Difference]: Start difference. First operand 179 states and 205 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-25 15:51:59,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:51:59,399 INFO L93 Difference]: Finished difference Result 185 states and 215 transitions. [2022-11-25 15:51:59,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:51:59,400 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-25 15:51:59,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:51:59,401 INFO L225 Difference]: With dead ends: 185 [2022-11-25 15:51:59,401 INFO L226 Difference]: Without dead ends: 185 [2022-11-25 15:51:59,402 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-25 15:51:59,402 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 100 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 15:51:59,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 177 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 15:51:59,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-25 15:51:59,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2022-11-25 15:51:59,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 96 states have (on average 1.6354166666666667) internal successors, (157), 147 states have internal predecessors, (157), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (28), 26 states have call predecessors, (28), 24 states have call successors, (28) [2022-11-25 15:51:59,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 209 transitions. [2022-11-25 15:51:59,421 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 209 transitions. Word has length 11 [2022-11-25 15:51:59,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:51:59,421 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 209 transitions. [2022-11-25 15:51:59,421 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-25 15:51:59,422 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 209 transitions. [2022-11-25 15:51:59,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 15:51:59,423 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:51:59,423 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:51:59,440 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-25 15:51:59,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:51:59,641 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting sizeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-25 15:51:59,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:59,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1280810199, now seen corresponding path program 1 times [2022-11-25 15:51:59,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:51:59,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1158251358] [2022-11-25 15:51:59,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:59,642 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:51:59,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:51:59,643 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:51:59,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-25 15:51:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:59,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 15:51:59,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:51:59,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:51:59,842 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:51:59,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:51:59,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1158251358] [2022-11-25 15:51:59,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1158251358] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:51:59,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:51:59,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 15:51:59,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972118154] [2022-11-25 15:51:59,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:51:59,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:51:59,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:51:59,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:51:59,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:51:59,845 INFO L87 Difference]: Start difference. First operand 182 states and 209 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-25 15:52:00,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:52:00,031 INFO L93 Difference]: Finished difference Result 242 states and 282 transitions. [2022-11-25 15:52:00,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 15:52:00,032 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-25 15:52:00,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:52:00,034 INFO L225 Difference]: With dead ends: 242 [2022-11-25 15:52:00,034 INFO L226 Difference]: Without dead ends: 242 [2022-11-25 15:52:00,034 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-25 15:52:00,035 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 90 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:52:00,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 1123 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:52:00,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-11-25 15:52:00,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 204. [2022-11-25 15:52:00,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 110 states have (on average 1.5909090909090908) internal successors, (175), 161 states have internal predecessors, (175), 31 states have call successors, (31), 9 states have call predecessors, (31), 10 states have return successors, (35), 33 states have call predecessors, (35), 31 states have call successors, (35) [2022-11-25 15:52:00,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 241 transitions. [2022-11-25 15:52:00,046 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 241 transitions. Word has length 17 [2022-11-25 15:52:00,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:52:00,047 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 241 transitions. [2022-11-25 15:52:00,047 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-25 15:52:00,047 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 241 transitions. [2022-11-25 15:52:00,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 15:52:00,048 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:52:00,048 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:52:00,066 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-25 15:52:00,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:52:00,260 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-25 15:52:00,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:52:00,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1539264760, now seen corresponding path program 1 times [2022-11-25 15:52:00,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:52:00,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1961088393] [2022-11-25 15:52:00,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:52:00,262 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:52:00,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:52:00,263 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:52:00,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-25 15:52:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:52:00,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 15:52:00,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:52:00,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 15:52:00,552 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (exists ((v_ArrVal_109 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_109))))) is different from true [2022-11-25 15:52:00,589 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_109 (_ BitVec 1))) (and (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_109)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 15:52:00,682 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 15:52:00,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 15:52:00,691 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-25 15:52:00,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:52:00,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:52:00,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1961088393] [2022-11-25 15:52:00,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1961088393] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:52:00,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [725861406] [2022-11-25 15:52:00,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:52:00,838 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 15:52:00,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 15:52:00,840 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 15:52:00,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-11-25 15:52:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:52:01,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 15:52:01,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:52:01,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 15:52:01,224 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |c_#valid|)) is different from true [2022-11-25 15:52:01,299 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 15:52:01,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 15:52:01,308 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-25 15:52:01,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:52:01,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [725861406] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:52:01,480 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:52:01,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2022-11-25 15:52:01,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820147533] [2022-11-25 15:52:01,480 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:52:01,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:52:01,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:52:01,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:52:01,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=15, Unknown=3, NotChecked=24, Total=56 [2022-11-25 15:52:01,482 INFO L87 Difference]: Start difference. First operand 204 states and 241 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-25 15:52:04,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:52:04,073 INFO L93 Difference]: Finished difference Result 211 states and 251 transitions. [2022-11-25 15:52:04,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:52:04,074 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-25 15:52:04,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:52:04,075 INFO L225 Difference]: With dead ends: 211 [2022-11-25 15:52:04,075 INFO L226 Difference]: Without dead ends: 211 [2022-11-25 15:52:04,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=18, Invalid=20, Unknown=4, NotChecked=30, Total=72 [2022-11-25 15:52:04,076 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 100 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 596 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 15:52:04,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 201 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 269 Invalid, 0 Unknown, 596 Unchecked, 0.5s Time] [2022-11-25 15:52:04,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-11-25 15:52:04,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2022-11-25 15:52:04,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 113 states have (on average 1.584070796460177) internal successors, (179), 164 states have internal predecessors, (179), 31 states have call successors, (31), 9 states have call predecessors, (31), 11 states have return successors, (39), 34 states have call predecessors, (39), 31 states have call successors, (39) [2022-11-25 15:52:04,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 249 transitions. [2022-11-25 15:52:04,086 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 249 transitions. Word has length 29 [2022-11-25 15:52:04,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:52:04,087 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 249 transitions. [2022-11-25 15:52:04,087 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-25 15:52:04,087 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 249 transitions. [2022-11-25 15:52:04,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-25 15:52:04,088 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:52:04,088 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:52:04,097 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2022-11-25 15:52:04,306 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-25 15:52:04,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:52:04,497 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting nondet_treeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-25 15:52:04,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:52:04,498 INFO L85 PathProgramCache]: Analyzing trace with hash -417761545, now seen corresponding path program 1 times [2022-11-25 15:52:04,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:52:04,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [381371790] [2022-11-25 15:52:04,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:52:04,498 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:52:04,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:52:04,499 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:52:04,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-25 15:52:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:52:04,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-25 15:52:04,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:52:04,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 15:52:04,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 15:52:04,810 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_250 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_250) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 15:52:04,879 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_250 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_250) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 15:52:04,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:52:04,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 15:52:04,977 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 15:52:04,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 15:52:04,995 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-25 15:52:04,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:52:05,316 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:52:05,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [381371790] [2022-11-25 15:52:05,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [381371790] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:52:05,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [365690346] [2022-11-25 15:52:05,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:52:05,316 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 15:52:05,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 15:52:05,318 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 15:52:05,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-11-25 15:52:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:52:05,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-25 15:52:05,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:52:05,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 15:52:05,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 15:52:05,712 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_325 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_325) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 15:52:05,747 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_325 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_325) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 15:52:05,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:52:05,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 15:52:05,864 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 15:52:05,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 15:52:05,870 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-25 15:52:05,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:52:06,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [365690346] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:52:06,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:52:06,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-11-25 15:52:06,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459888966] [2022-11-25 15:52:06,062 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:52:06,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 15:52:06,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:52:06,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 15:52:06,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=42, Unknown=4, NotChecked=60, Total=132 [2022-11-25 15:52:06,063 INFO L87 Difference]: Start difference. First operand 208 states and 249 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-25 15:52:06,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:52:06,863 INFO L93 Difference]: Finished difference Result 215 states and 262 transitions. [2022-11-25 15:52:06,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:52:06,864 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-25 15:52:06,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:52:06,865 INFO L225 Difference]: With dead ends: 215 [2022-11-25 15:52:06,865 INFO L226 Difference]: Without dead ends: 215 [2022-11-25 15:52:06,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=52, Unknown=4, NotChecked=68, Total=156 [2022-11-25 15:52:06,866 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 196 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 830 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 15:52:06,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 177 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 309 Invalid, 0 Unknown, 830 Unchecked, 0.7s Time] [2022-11-25 15:52:06,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-11-25 15:52:06,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2022-11-25 15:52:06,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 115 states have (on average 1.565217391304348) internal successors, (180), 166 states have internal predecessors, (180), 32 states have call successors, (32), 9 states have call predecessors, (32), 11 states have return successors, (42), 35 states have call predecessors, (42), 32 states have call successors, (42) [2022-11-25 15:52:06,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 254 transitions. [2022-11-25 15:52:06,877 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 254 transitions. Word has length 35 [2022-11-25 15:52:06,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:52:06,877 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 254 transitions. [2022-11-25 15:52:06,877 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-25 15:52:06,877 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 254 transitions. [2022-11-25 15:52:06,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 15:52:06,878 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:52:06,879 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-25 15:52:06,902 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-25 15:52:07,098 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2022-11-25 15:52:07,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt [2022-11-25 15:52:07,295 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting minErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-25 15:52:07,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:52:07,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1668050227, now seen corresponding path program 1 times [2022-11-25 15:52:07,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:52:07,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1873496852] [2022-11-25 15:52:07,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:52:07,296 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:52:07,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:52:07,298 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:52:07,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-25 15:52:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:52:07,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 15:52:07,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:52:07,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 15:52:07,554 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-25 15:52:07,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:52:07,763 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-25 15:52:07,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:52:07,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1873496852] [2022-11-25 15:52:07,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1873496852] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:52:07,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:52:07,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-11-25 15:52:07,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328307198] [2022-11-25 15:52:07,765 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:52:07,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 15:52:07,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:52:07,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 15:52:07,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:52:07,766 INFO L87 Difference]: Start difference. First operand 211 states and 254 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-25 15:52:09,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:52:09,414 INFO L93 Difference]: Finished difference Result 228 states and 276 transitions. [2022-11-25 15:52:09,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 15:52:09,417 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-25 15:52:09,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:52:09,418 INFO L225 Difference]: With dead ends: 228 [2022-11-25 15:52:09,418 INFO L226 Difference]: Without dead ends: 228 [2022-11-25 15:52:09,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-11-25 15:52:09,419 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 265 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-25 15:52:09,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 559 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-25 15:52:09,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-11-25 15:52:09,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 220. [2022-11-25 15:52:09,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 125 states have (on average 1.528) internal successors, (191), 173 states have internal predecessors, (191), 34 states have call successors, (34), 10 states have call predecessors, (34), 12 states have return successors, (44), 36 states have call predecessors, (44), 34 states have call successors, (44) [2022-11-25 15:52:09,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 269 transitions. [2022-11-25 15:52:09,435 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 269 transitions. Word has length 25 [2022-11-25 15:52:09,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:52:09,435 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 269 transitions. [2022-11-25 15:52:09,435 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-25 15:52:09,435 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 269 transitions. [2022-11-25 15:52:09,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 15:52:09,438 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:52:09,438 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-25 15:52:09,463 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-11-25 15:52:09,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:52:09,650 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting minErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-25 15:52:09,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:52:09,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1668050226, now seen corresponding path program 1 times [2022-11-25 15:52:09,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:52:09,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [537129045] [2022-11-25 15:52:09,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:52:09,651 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:52:09,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:52:09,653 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:52:09,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-25 15:52:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:52:09,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-25 15:52:09,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:52:09,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 15:52:09,953 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-25 15:52:09,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:52:11,206 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-25 15:52:11,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:52:11,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [537129045] [2022-11-25 15:52:11,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [537129045] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:52:11,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:52:11,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2022-11-25 15:52:11,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326451219] [2022-11-25 15:52:11,207 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:52:11,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-25 15:52:11,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:52:11,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 15:52:11,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-11-25 15:52:11,209 INFO L87 Difference]: Start difference. First operand 220 states and 269 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-25 15:52:16,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:52:16,445 INFO L93 Difference]: Finished difference Result 245 states and 305 transitions. [2022-11-25 15:52:16,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 15:52:16,446 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-25 15:52:16,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:52:16,448 INFO L225 Difference]: With dead ends: 245 [2022-11-25 15:52:16,448 INFO L226 Difference]: Without dead ends: 245 [2022-11-25 15:52:16,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2022-11-25 15:52:16,449 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 259 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 1552 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 1625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-25 15:52:16,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 597 Invalid, 1625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1552 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-11-25 15:52:16,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-11-25 15:52:16,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 236. [2022-11-25 15:52:16,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 137 states have (on average 1.5036496350364963) internal successors, (206), 185 states have internal predecessors, (206), 37 states have call successors, (37), 11 states have call predecessors, (37), 13 states have return successors, (47), 39 states have call predecessors, (47), 37 states have call successors, (47) [2022-11-25 15:52:16,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 290 transitions. [2022-11-25 15:52:16,460 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 290 transitions. Word has length 25 [2022-11-25 15:52:16,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:52:16,460 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 290 transitions. [2022-11-25 15:52:16,460 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-25 15:52:16,461 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 290 transitions. [2022-11-25 15:52:16,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 15:52:16,462 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:52:16,462 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-25 15:52:16,474 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-25 15:52:16,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:52:16,674 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting tree_inorderErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-25 15:52:16,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:52:16,674 INFO L85 PathProgramCache]: Analyzing trace with hash 369889479, now seen corresponding path program 1 times [2022-11-25 15:52:16,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:52:16,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [893958008] [2022-11-25 15:52:16,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:52:16,675 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:52:16,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:52:16,675 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:52:16,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-25 15:52:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:52:16,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 15:52:16,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:52:16,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:52:16,788 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:52:16,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:52:16,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [893958008] [2022-11-25 15:52:16,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [893958008] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:52:16,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:52:16,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:52:16,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948300749] [2022-11-25 15:52:16,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:52:16,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:52:16,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:52:16,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:52:16,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:52:16,791 INFO L87 Difference]: Start difference. First operand 236 states and 290 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-25 15:52:16,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:52:16,816 INFO L93 Difference]: Finished difference Result 226 states and 271 transitions. [2022-11-25 15:52:16,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:52:16,817 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-25 15:52:16,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:52:16,819 INFO L225 Difference]: With dead ends: 226 [2022-11-25 15:52:16,819 INFO L226 Difference]: Without dead ends: 210 [2022-11-25 15:52:16,820 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-25 15:52:16,820 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 0 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 736 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-25 15:52:16,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 736 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:52:16,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-11-25 15:52:16,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2022-11-25 15:52:16,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 120 states have (on average 1.5416666666666667) internal successors, (185), 169 states have internal predecessors, (185), 29 states have call successors, (29), 9 states have call predecessors, (29), 12 states have return successors, (41), 31 states have call predecessors, (41), 29 states have call successors, (41) [2022-11-25 15:52:16,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 255 transitions. [2022-11-25 15:52:16,832 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 255 transitions. Word has length 30 [2022-11-25 15:52:16,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:52:16,834 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 255 transitions. [2022-11-25 15:52:16,834 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-25 15:52:16,834 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 255 transitions. [2022-11-25 15:52:16,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-25 15:52:16,835 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:52:16,835 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-25 15:52:16,850 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-11-25 15:52:17,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:52:17,046 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting sizeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-25 15:52:17,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:52:17,047 INFO L85 PathProgramCache]: Analyzing trace with hash -648076771, now seen corresponding path program 1 times [2022-11-25 15:52:17,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:52:17,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1613417271] [2022-11-25 15:52:17,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:52:17,047 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:52:17,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:52:17,049 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:52:17,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-25 15:52:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:52:17,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 15:52:17,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:52:17,257 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-25 15:52:17,257 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:52:17,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:52:17,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1613417271] [2022-11-25 15:52:17,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1613417271] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:52:17,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:52:17,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 15:52:17,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580322063] [2022-11-25 15:52:17,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:52:17,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 15:52:17,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:52:17,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 15:52:17,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:52:17,259 INFO L87 Difference]: Start difference. First operand 210 states and 255 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-25 15:52:17,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:52:17,591 INFO L93 Difference]: Finished difference Result 216 states and 264 transitions. [2022-11-25 15:52:17,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 15:52:17,592 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-25 15:52:17,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:52:17,593 INFO L225 Difference]: With dead ends: 216 [2022-11-25 15:52:17,593 INFO L226 Difference]: Without dead ends: 212 [2022-11-25 15:52:17,593 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-25 15:52:17,594 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 107 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 15:52:17,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1017 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 15:52:17,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-11-25 15:52:17,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2022-11-25 15:52:17,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 120 states have (on average 1.525) internal successors, (183), 169 states have internal predecessors, (183), 29 states have call successors, (29), 9 states have call predecessors, (29), 12 states have return successors, (41), 31 states have call predecessors, (41), 29 states have call successors, (41) [2022-11-25 15:52:17,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 253 transitions. [2022-11-25 15:52:17,603 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 253 transitions. Word has length 31 [2022-11-25 15:52:17,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:52:17,604 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 253 transitions. [2022-11-25 15:52:17,604 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-25 15:52:17,604 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 253 transitions. [2022-11-25 15:52:17,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-25 15:52:17,605 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:52:17,605 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-25 15:52:17,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-25 15:52:17,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:52:17,817 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting minErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-25 15:52:17,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:52:17,817 INFO L85 PathProgramCache]: Analyzing trace with hash -2088825952, now seen corresponding path program 1 times [2022-11-25 15:52:17,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:52:17,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [625788990] [2022-11-25 15:52:17,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:52:17,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:52:17,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:52:17,821 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:52:17,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-25 15:52:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:52:17,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-25 15:52:17,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:52:18,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 15:52:18,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 15:52:18,081 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-25 15:52:18,091 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-25 15:52:18,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 15:52:18,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 15:52:18,439 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-25 15:52:18,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:52:19,456 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-25 15:52:19,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:52:19,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [625788990] [2022-11-25 15:52:19,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [625788990] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:52:19,457 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:52:19,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2022-11-25 15:52:19,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239919621] [2022-11-25 15:52:19,457 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:52:19,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 15:52:19,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:52:19,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 15:52:19,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2022-11-25 15:52:19,458 INFO L87 Difference]: Start difference. First operand 210 states and 253 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-25 15:52:21,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:52:21,972 INFO L93 Difference]: Finished difference Result 240 states and 295 transitions. [2022-11-25 15:52:21,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 15:52:21,973 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-25 15:52:21,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:52:21,983 INFO L225 Difference]: With dead ends: 240 [2022-11-25 15:52:21,983 INFO L226 Difference]: Without dead ends: 240 [2022-11-25 15:52:21,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2022-11-25 15:52:21,984 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 218 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:52:21,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 1454 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-25 15:52:21,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-11-25 15:52:21,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 214. [2022-11-25 15:52:21,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 123 states have (on average 1.5121951219512195) internal successors, (186), 172 states have internal predecessors, (186), 29 states have call successors, (29), 10 states have call predecessors, (29), 13 states have return successors, (41), 31 states have call predecessors, (41), 29 states have call successors, (41) [2022-11-25 15:52:22,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 256 transitions. [2022-11-25 15:52:22,001 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 256 transitions. Word has length 31 [2022-11-25 15:52:22,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:52:22,002 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 256 transitions. [2022-11-25 15:52:22,003 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-25 15:52:22,003 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 256 transitions. [2022-11-25 15:52:22,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-25 15:52:22,004 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:52:22,004 INFO L195 NwaCegarLoop]: trace histogram [7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1] [2022-11-25 15:52:22,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-25 15:52:22,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:52:22,217 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting nondet_treeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-25 15:52:22,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:52:22,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1545271268, now seen corresponding path program 1 times [2022-11-25 15:52:22,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:52:22,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119187913] [2022-11-25 15:52:22,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:52:22,219 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:52:22,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:52:22,220 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:52:22,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-25 15:52:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:52:22,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-25 15:52:22,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:52:22,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 15:52:22,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 15:52:22,695 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_582 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_582) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 15:52:22,737 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_582 (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_582) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 15:52:22,762 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) |c_#length|)) is different from true [2022-11-25 15:52:22,830 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_39 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_582 (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| v_nondet_tree_~n~0.base_39 v_ArrVal_582) nondet_tree_~n~0.base (_ bv12 32))) (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_39) (_ bv0 1)))) is different from true [2022-11-25 15:52:22,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:52:22,898 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-25 15:52:22,898 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-25 15:52:22,916 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 15:52:22,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 15:52:22,947 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 48 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 40 not checked. [2022-11-25 15:52:22,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:52:23,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:52:23,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119187913] [2022-11-25 15:52:23,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119187913] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:52:23,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1383166203] [2022-11-25 15:52:23,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:52:23,252 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 15:52:23,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 15:52:23,254 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 15:52:23,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2022-11-25 15:52:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:52:23,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-25 15:52:23,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:52:23,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 5 [2022-11-25 15:52:23,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 15:52:23,862 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_694 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_694) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 15:52:23,895 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_694 (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_694) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 15:52:23,981 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_50 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_694 (_ BitVec 32))) (and (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_50) (_ bv0 1)) (= (store (store |c_old(#length)| v_nondet_tree_~n~0.base_50 v_ArrVal_694) nondet_tree_~n~0.base (_ bv12 32)) |c_#length|))) is different from true [2022-11-25 15:52:24,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:52:24,048 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-25 15:52:24,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 23 [2022-11-25 15:52:24,067 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 15:52:24,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 15:52:24,087 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 48 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 40 not checked. [2022-11-25 15:52:24,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:52:24,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1383166203] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:52:24,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:52:24,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-11-25 15:52:24,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359299612] [2022-11-25 15:52:24,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:52:24,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 15:52:24,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:52:24,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 15:52:24,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=45, Unknown=7, NotChecked=126, Total=210 [2022-11-25 15:52:24,864 INFO L87 Difference]: Start difference. First operand 214 states and 256 transitions. Second operand has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 7 states have call successors, (11), 3 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2022-11-25 15:52:32,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:52:32,593 INFO L93 Difference]: Finished difference Result 227 states and 282 transitions. [2022-11-25 15:52:32,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 15:52:32,594 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 7 states have call successors, (11), 3 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) Word has length 55 [2022-11-25 15:52:32,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:52:32,595 INFO L225 Difference]: With dead ends: 227 [2022-11-25 15:52:32,596 INFO L226 Difference]: Without dead ends: 227 [2022-11-25 15:52:32,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 99 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=57, Invalid=92, Unknown=11, NotChecked=182, Total=342 [2022-11-25 15:52:32,596 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 189 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 1846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1472 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 15:52:32,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 176 Invalid, 1846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 318 Invalid, 0 Unknown, 1472 Unchecked, 0.8s Time] [2022-11-25 15:52:32,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-11-25 15:52:32,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 218. [2022-11-25 15:52:32,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 126 states have (on average 1.5) internal successors, (189), 175 states have internal predecessors, (189), 29 states have call successors, (29), 10 states have call predecessors, (29), 14 states have return successors, (46), 32 states have call predecessors, (46), 29 states have call successors, (46) [2022-11-25 15:52:32,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 264 transitions. [2022-11-25 15:52:32,608 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 264 transitions. Word has length 55 [2022-11-25 15:52:32,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:52:32,610 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 264 transitions. [2022-11-25 15:52:32,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 7 states have call successors, (11), 3 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2022-11-25 15:52:32,611 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 264 transitions. [2022-11-25 15:52:32,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-25 15:52:32,611 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:52:32,611 INFO L195 NwaCegarLoop]: trace histogram [7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1] [2022-11-25 15:52:32,628 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-25 15:52:32,835 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2022-11-25 15:52:33,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt [2022-11-25 15:52:33,026 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting nondet_treeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-25 15:52:33,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:52:33,027 INFO L85 PathProgramCache]: Analyzing trace with hash 104860, now seen corresponding path program 2 times [2022-11-25 15:52:33,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:52:33,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [620006615] [2022-11-25 15:52:33,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:52:33,027 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:52:33,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:52:33,028 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:52:33,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-25 15:52:33,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 15:52:33,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:52:33,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-25 15:52:33,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:52:33,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 15:52:33,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 15:52:33,493 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_806 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_806) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 15:52:33,528 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) |c_#length|)) is different from true [2022-11-25 15:52:33,591 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_61 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_806 (_ BitVec 32))) (and (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_61) (_ bv0 1)) (= (store (store |c_old(#length)| v_nondet_tree_~n~0.base_61 v_ArrVal_806) nondet_tree_~n~0.base (_ bv12 32)) |c_#length|))) is different from true [2022-11-25 15:52:33,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:52:33,699 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-25 15:52:33,700 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-25 15:52:33,720 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 15:52:33,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 15:52:33,754 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 48 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 40 not checked. [2022-11-25 15:52:33,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:52:36,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:52:36,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [620006615] [2022-11-25 15:52:36,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [620006615] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:52:36,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [53960685] [2022-11-25 15:52:36,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:52:36,085 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 15:52:36,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 15:52:36,086 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 15:52:36,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-11-25 15:52:36,499 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 15:52:36,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:52:36,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-25 15:52:36,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:52:36,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 15:52:36,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 15:52:36,633 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_918 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_918))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 15:52:36,709 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_72 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_918 (_ BitVec 32))) (and (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_72) (_ bv0 1)) (= (store (store |c_old(#length)| v_nondet_tree_~n~0.base_72 v_ArrVal_918) nondet_tree_~n~0.base (_ bv12 32)) |c_#length|))) is different from true [2022-11-25 15:52:36,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:52:36,821 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-25 15:52:36,821 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-25 15:52:36,840 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 15:52:36,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 15:52:36,862 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 48 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 40 not checked. [2022-11-25 15:52:36,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:52:37,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [53960685] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:52:37,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:52:37,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-11-25 15:52:37,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777503735] [2022-11-25 15:52:37,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:52:37,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 15:52:37,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:52:37,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 15:52:37,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=43, Unknown=5, NotChecked=80, Total=156 [2022-11-25 15:52:37,276 INFO L87 Difference]: Start difference. First operand 218 states and 264 transitions. Second operand has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 7 states have call successors, (11), 3 states have call predecessors, (11), 6 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2022-11-25 15:52:45,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:52:45,124 INFO L93 Difference]: Finished difference Result 234 states and 300 transitions. [2022-11-25 15:52:45,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 15:52:45,125 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 7 states have call successors, (11), 3 states have call predecessors, (11), 6 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) Word has length 55 [2022-11-25 15:52:45,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:52:45,126 INFO L225 Difference]: With dead ends: 234 [2022-11-25 15:52:45,127 INFO L226 Difference]: Without dead ends: 234 [2022-11-25 15:52:45,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=53, Invalid=90, Unknown=9, NotChecked=120, Total=272 [2022-11-25 15:52:45,128 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 177 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 1625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1086 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-25 15:52:45,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 219 Invalid, 1625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 483 Invalid, 0 Unknown, 1086 Unchecked, 1.2s Time] [2022-11-25 15:52:45,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-11-25 15:52:45,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 228. [2022-11-25 15:52:45,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 133 states have (on average 1.4736842105263157) internal successors, (196), 182 states have internal predecessors, (196), 31 states have call successors, (31), 10 states have call predecessors, (31), 15 states have return successors, (61), 35 states have call predecessors, (61), 31 states have call successors, (61) [2022-11-25 15:52:45,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 288 transitions. [2022-11-25 15:52:45,140 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 288 transitions. Word has length 55 [2022-11-25 15:52:45,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:52:45,141 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 288 transitions. [2022-11-25 15:52:45,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 7 states have call successors, (11), 3 states have call predecessors, (11), 6 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2022-11-25 15:52:45,141 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 288 transitions. [2022-11-25 15:52:45,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 15:52:45,142 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:52:45,142 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-25 15:52:45,159 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-25 15:52:45,354 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2022-11-25 15:52:45,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt [2022-11-25 15:52:45,551 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting minErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-25 15:52:45,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:52:45,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1786565566, now seen corresponding path program 2 times [2022-11-25 15:52:45,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:52:45,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584511105] [2022-11-25 15:52:45,552 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:52:45,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-25 15:52:45,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:52:45,553 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:52:45,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-11-25 15:52:45,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 15:52:45,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:52:45,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-25 15:52:45,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:52:45,929 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-25 15:52:45,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:52:46,620 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-25 15:52:46,809 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-25 15:52:46,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:52:46,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584511105] [2022-11-25 15:52:46,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1584511105] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:52:46,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:52:46,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2022-11-25 15:52:46,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34201520] [2022-11-25 15:52:46,810 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:52:46,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-25 15:52:46,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:52:46,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 15:52:46,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2022-11-25 15:52:46,811 INFO L87 Difference]: Start difference. First operand 228 states and 288 transitions. Second operand has 16 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-25 15:52:49,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:52:49,668 INFO L93 Difference]: Finished difference Result 230 states and 291 transitions. [2022-11-25 15:52:49,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 15:52:49,668 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 39 [2022-11-25 15:52:49,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:52:49,672 INFO L225 Difference]: With dead ends: 230 [2022-11-25 15:52:49,672 INFO L226 Difference]: Without dead ends: 230 [2022-11-25 15:52:49,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2022-11-25 15:52:49,673 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 76 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-25 15:52:49,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1333 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-25 15:52:49,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-11-25 15:52:49,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2022-11-25 15:52:49,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 133 states have (on average 1.4511278195488722) internal successors, (193), 182 states have internal predecessors, (193), 31 states have call successors, (31), 10 states have call predecessors, (31), 15 states have return successors, (61), 35 states have call predecessors, (61), 31 states have call successors, (61) [2022-11-25 15:52:49,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 285 transitions. [2022-11-25 15:52:49,687 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 285 transitions. Word has length 39 [2022-11-25 15:52:49,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:52:49,689 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 285 transitions. [2022-11-25 15:52:49,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-25 15:52:49,689 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 285 transitions. [2022-11-25 15:52:49,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-25 15:52:49,690 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:52:49,690 INFO L195 NwaCegarLoop]: trace histogram [7, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2022-11-25 15:52:49,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-11-25 15:52:49,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:52:49,903 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting nondet_treeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-25 15:52:49,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:52:49,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1703173775, now seen corresponding path program 2 times [2022-11-25 15:52:49,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:52:49,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286263289] [2022-11-25 15:52:49,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:52:49,903 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:52:49,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:52:49,904 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:52:49,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-25 15:52:50,257 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 15:52:50,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:52:50,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-25 15:52:50,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:52:50,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 15:52:50,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 15:52:50,367 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1105 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1105))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 15:52:50,416 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1105 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1105)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 15:52:50,446 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) |c_#length|)) is different from true [2022-11-25 15:52:50,546 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_93 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (= |c_#length| (store (store |c_old(#length)| v_nondet_tree_~n~0.base_93 (_ bv12 32)) nondet_tree_~n~0.base (_ bv12 32)))) is different from true [2022-11-25 15:52:50,585 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1105 (_ BitVec 32)) (v_nondet_tree_~n~0.base_94 (_ BitVec 32)) (v_nondet_tree_~n~0.base_93 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_94 v_ArrVal_1105) v_nondet_tree_~n~0.base_93 (_ bv12 32)) nondet_tree_~n~0.base (_ bv12 32)) |c_#length|) (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_94) (_ bv0 1)))) is different from true [2022-11-25 15:52:50,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:52:50,729 INFO L321 Elim1Store]: treesize reduction 67, result has 25.6 percent of original size [2022-11-25 15:52:50,730 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-25 15:52:50,749 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 15:52:50,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 15:52:50,804 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 60 not checked. [2022-11-25 15:52:50,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:52:53,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:52:53,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286263289] [2022-11-25 15:52:53,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [286263289] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:52:53,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [904730907] [2022-11-25 15:52:53,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:52:53,326 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 15:52:53,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 15:52:53,327 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 15:52:53,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2022-11-25 15:52:53,868 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 15:52:53,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:52:53,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-25 15:52:53,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:52:53,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 15:52:53,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 15:52:53,985 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1236 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1236))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (exists ((v_ArrVal_1237 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_1237))))) is different from true [2022-11-25 15:52:54,056 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1236 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_1237 (_ BitVec 1))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1236)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_1237)))) is different from true [2022-11-25 15:52:54,106 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1238 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1238))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 15:52:54,150 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1238 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1238)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 15:52:54,247 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1238 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_114 (_ BitVec 32))) (and (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_114) (_ bv0 1)) (= (store (store |c_old(#length)| v_nondet_tree_~n~0.base_114 v_ArrVal_1238) nondet_tree_~n~0.base (_ bv12 32)) |c_#length|))) is different from true [2022-11-25 15:52:54,303 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1236 (_ BitVec 32)) (v_ArrVal_1238 (_ BitVec 32)) (v_nondet_tree_~n~0.base_115 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_1237 (_ BitVec 1)) (v_nondet_tree_~n~0.base_114 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_115)) (= (_ bv0 1) (select (store |c_old(#valid)| v_nondet_tree_~n~0.base_115 v_ArrVal_1237) v_nondet_tree_~n~0.base_114)) (= |c_#length| (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_115 v_ArrVal_1236) v_nondet_tree_~n~0.base_114 v_ArrVal_1238) nondet_tree_~n~0.base (_ bv12 32))))) is different from true [2022-11-25 15:52:54,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:52:54,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:52:54,458 INFO L321 Elim1Store]: treesize reduction 47, result has 36.5 percent of original size [2022-11-25 15:52:54,459 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-25 15:52:54,528 INFO L321 Elim1Store]: treesize reduction 17, result has 45.2 percent of original size [2022-11-25 15:52:54,528 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-25 15:52:54,573 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 26 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 66 not checked. [2022-11-25 15:52:54,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:53:05,259 WARN L233 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:53:05,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [904730907] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:53:05,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:53:05,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 16 [2022-11-25 15:53:05,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650409749] [2022-11-25 15:53:05,260 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:53:05,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-25 15:53:05,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:53:05,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 15:53:05,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=58, Unknown=14, NotChecked=264, Total=380 [2022-11-25 15:53:05,262 INFO L87 Difference]: Start difference. First operand 228 states and 285 transitions. Second operand has 17 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 9 states have call successors, (11), 3 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2022-11-25 15:53:33,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:53:33,059 INFO L93 Difference]: Finished difference Result 242 states and 318 transitions. [2022-11-25 15:53:33,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 15:53:33,060 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 9 states have call successors, (11), 3 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) Word has length 57 [2022-11-25 15:53:33,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:53:33,062 INFO L225 Difference]: With dead ends: 242 [2022-11-25 15:53:33,062 INFO L226 Difference]: Without dead ends: 242 [2022-11-25 15:53:33,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 38.8s TimeCoverageRelationStatistics Valid=83, Invalid=142, Unknown=29, NotChecked=396, Total=650 [2022-11-25 15:53:33,063 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 120 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 2761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2328 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-25 15:53:33,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 207 Invalid, 2761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 397 Invalid, 0 Unknown, 2328 Unchecked, 1.5s Time] [2022-11-25 15:53:33,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-11-25 15:53:33,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 232. [2022-11-25 15:53:33,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 136 states have (on average 1.4411764705882353) internal successors, (196), 185 states have internal predecessors, (196), 31 states have call successors, (31), 10 states have call predecessors, (31), 16 states have return successors, (68), 36 states have call predecessors, (68), 31 states have call successors, (68) [2022-11-25 15:53:33,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 295 transitions. [2022-11-25 15:53:33,086 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 295 transitions. Word has length 57 [2022-11-25 15:53:33,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:53:33,086 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 295 transitions. [2022-11-25 15:53:33,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 9 states have call successors, (11), 3 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2022-11-25 15:53:33,087 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 295 transitions. [2022-11-25 15:53:33,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-25 15:53:33,088 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:53:33,088 INFO L195 NwaCegarLoop]: trace histogram [9, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 1, 1, 1, 1] [2022-11-25 15:53:33,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-25 15:53:33,314 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2022-11-25 15:53:33,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt [2022-11-25 15:53:33,509 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting nondet_treeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-25 15:53:33,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:53:33,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1873527920, now seen corresponding path program 3 times [2022-11-25 15:53:33,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:53:33,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1574380489] [2022-11-25 15:53:33,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 15:53:33,510 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:53:33,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:53:33,511 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:53:33,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-11-25 15:53:34,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-11-25 15:53:34,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:53:34,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-25 15:53:34,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:53:34,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 15:53:34,498 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1391 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1391) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 15:53:34,532 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_1391 (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1391) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 15:53:34,610 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1389 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_1391 (_ BitVec 32)) (v_nondet_tree_~n~0.base_135 (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1389) v_nondet_tree_~n~0.base_135 v_ArrVal_1391) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= (select (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) v_nondet_tree_~n~0.base_135) (_ bv0 1)))) is different from true [2022-11-25 15:53:36,887 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1389 (_ BitVec 32)) (v_ArrVal_1388 (_ BitVec 32)) (|nondet_tree_#res.base| (_ BitVec 32)) (v_ArrVal_1391 (_ BitVec 32)) (v_nondet_tree_~n~0.base_135 (_ BitVec 32)) (v_nondet_tree_~n~0.base_136 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |nondet_tree_#res.base| (_ bv1 1)))) (and (= (_ bv0 1) (select (store .cse0 v_nondet_tree_~n~0.base_136 (_ bv1 1)) v_nondet_tree_~n~0.base_135)) (= (_ bv0 1) (select |c_old(#valid)| |nondet_tree_#res.base|)) (= (store (store (store |c_old(#length)| |nondet_tree_#res.base| v_ArrVal_1388) v_nondet_tree_~n~0.base_136 v_ArrVal_1389) v_nondet_tree_~n~0.base_135 v_ArrVal_1391) |c_#length|) (= (_ bv0 1) (select .cse0 v_nondet_tree_~n~0.base_136))))) is different from true [2022-11-25 15:53:36,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:53:36,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:53:36,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:53:36,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:53:36,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:53:36,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:53:36,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2022-11-25 15:53:37,021 INFO L321 Elim1Store]: treesize reduction 48, result has 21.3 percent of original size [2022-11-25 15:53:37,021 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 35 treesize of output 39 [2022-11-25 15:53:37,033 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 70 proven. 31 refuted. 0 times theorem prover too weak. 27 trivial. 68 not checked. [2022-11-25 15:53:37,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:53:39,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:53:39,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1574380489] [2022-11-25 15:53:39,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1574380489] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:53:39,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [745466711] [2022-11-25 15:53:39,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 15:53:39,981 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 15:53:39,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 15:53:39,982 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 15:53:40,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2022-11-25 15:53:41,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-11-25 15:53:41,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:53:41,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-25 15:53:41,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:53:41,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-25 15:53:41,494 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1389 (_ 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_1389) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 15:53:54,199 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1389 (_ BitVec 32)) (v_ArrVal_1388 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_1550 (_ BitVec 32)) (|nondet_tree_#t~ret8.base| (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)))) (and (= (store (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1389) |c_nondet_tree_#t~ret9.base| v_ArrVal_1388) |nondet_tree_#t~ret8.base| v_ArrVal_1550) |c_#length|) (= (_ bv0 1) (select .cse0 |c_nondet_tree_#t~ret9.base|)) (= (_ bv0 1) (select (store .cse0 |c_nondet_tree_#t~ret9.base| (_ bv1 1)) |nondet_tree_#t~ret8.base|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-25 15:53:54,235 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1389 (_ BitVec 32)) (v_ArrVal_1388 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (|nondet_tree_#t~ret9.base| (_ BitVec 32)) (v_ArrVal_1550 (_ BitVec 32)) (|nondet_tree_#t~ret8.base| (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)))) (and (= (_ bv0 1) (select .cse0 |nondet_tree_#t~ret9.base|)) (= (_ bv0 1) (select (store .cse0 |nondet_tree_#t~ret9.base| (_ bv1 1)) |nondet_tree_#t~ret8.base|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= (store (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1389) |nondet_tree_#t~ret9.base| v_ArrVal_1388) |nondet_tree_#t~ret8.base| v_ArrVal_1550) |c_#length|)))) is different from true [2022-11-25 15:53:54,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:53:54,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:53:54,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:53:54,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:53:54,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:53:54,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:53:54,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2022-11-25 15:53:54,373 INFO L321 Elim1Store]: treesize reduction 48, result has 21.3 percent of original size [2022-11-25 15:53:54,373 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 35 treesize of output 39 [2022-11-25 15:53:54,381 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 73 proven. 68 refuted. 0 times theorem prover too weak. 27 trivial. 28 not checked. [2022-11-25 15:53:54,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:54:09,521 WARN L233 SmtUtils]: Spent 6.23s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:54:09,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [745466711] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:54:09,522 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:54:09,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 20 [2022-11-25 15:54:09,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145015157] [2022-11-25 15:54:09,522 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:54:09,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-25 15:54:09,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:54:09,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-25 15:54:09,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=230, Unknown=16, NotChecked=252, Total=552 [2022-11-25 15:54:09,524 INFO L87 Difference]: Start difference. First operand 232 states and 295 transitions. Second operand has 21 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 11 states have call successors, (15), 3 states have call predecessors, (15), 9 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16) [2022-11-25 15:54:11,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:54:13,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:54:19,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:54:21,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:54:23,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:54:25,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:54:27,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:54:29,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:54:35,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:54:37,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:54:39,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:54:41,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:54:43,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:54:45,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:54:51,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:54:53,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:54:55,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:54:58,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:55:00,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:55:08,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:55:10,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:55:12,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:55:17,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:55:23,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:55:25,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:55:36,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:55:38,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:55:41,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:55:49,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:56:44,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:56:46,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:56:49,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:56:49,525 INFO L93 Difference]: Finished difference Result 249 states and 340 transitions. [2022-11-25 15:56:49,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 15:56:49,526 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 11 states have call successors, (15), 3 states have call predecessors, (15), 9 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16) Word has length 69 [2022-11-25 15:56:49,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:56:49,528 INFO L225 Difference]: With dead ends: 249 [2022-11-25 15:56:49,528 INFO L226 Difference]: Without dead ends: 249 [2022-11-25 15:56:49,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 122 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 118.1s TimeCoverageRelationStatistics Valid=124, Invalid=464, Unknown=40, NotChecked=364, Total=992 [2022-11-25 15:56:49,529 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 199 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 1565 mSolverCounterSat, 70 mSolverCounterUnsat, 63 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 72.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 3284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1565 IncrementalHoareTripleChecker+Invalid, 63 IncrementalHoareTripleChecker+Unknown, 1586 IncrementalHoareTripleChecker+Unchecked, 73.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:56:49,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 454 Invalid, 3284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1565 Invalid, 63 Unknown, 1586 Unchecked, 73.1s Time] [2022-11-25 15:56:49,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-11-25 15:56:49,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 228. [2022-11-25 15:56:49,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 133 states have (on average 1.4511278195488722) internal successors, (193), 182 states have internal predecessors, (193), 31 states have call successors, (31), 10 states have call predecessors, (31), 15 states have return successors, (61), 35 states have call predecessors, (61), 31 states have call successors, (61) [2022-11-25 15:56:49,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 285 transitions. [2022-11-25 15:56:49,542 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 285 transitions. Word has length 69 [2022-11-25 15:56:49,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:56:49,543 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 285 transitions. [2022-11-25 15:56:49,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 11 states have call successors, (15), 3 states have call predecessors, (15), 9 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16) [2022-11-25 15:56:49,543 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 285 transitions. [2022-11-25 15:56:49,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-25 15:56:49,544 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:56:49,545 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-25 15:56:49,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-11-25 15:56:49,772 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2022-11-25 15:56:49,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt [2022-11-25 15:56:49,959 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting minErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-25 15:56:49,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:56:49,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1322566655, now seen corresponding path program 1 times [2022-11-25 15:56:49,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:56:49,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1616398798] [2022-11-25 15:56:49,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:56:49,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:56:49,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:56:49,961 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:56:49,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-11-25 15:56:50,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:56:50,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-25 15:56:50,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:56:50,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 15:56:50,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 15:56:50,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 15:56:50,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 15:56:50,922 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-25 15:56:50,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:56:51,418 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-25 15:56:51,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:56:51,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1616398798] [2022-11-25 15:56:51,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1616398798] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:56:51,419 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:56:51,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 14 [2022-11-25 15:56:51,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390821719] [2022-11-25 15:56:51,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:56:51,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 15:56:51,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:56:51,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 15:56:51,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-11-25 15:56:51,420 INFO L87 Difference]: Start difference. First operand 228 states and 285 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-25 15:56:53,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:56:55,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:56:58,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:57:01,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:57:03,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:57:05,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:57:07,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:57:10,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:57:10,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:57:10,079 INFO L93 Difference]: Finished difference Result 361 states and 459 transitions. [2022-11-25 15:57:10,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 15:57:10,080 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-25 15:57:10,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:57:10,083 INFO L225 Difference]: With dead ends: 361 [2022-11-25 15:57:10,083 INFO L226 Difference]: Without dead ends: 361 [2022-11-25 15:57:10,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-11-25 15:57:10,084 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 122 mSDsluCounter, 1982 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 19 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 2175 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:57:10,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 2175 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 492 Invalid, 8 Unknown, 0 Unchecked, 18.1s Time] [2022-11-25 15:57:10,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-11-25 15:57:10,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 310. [2022-11-25 15:57:10,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 192 states have (on average 1.421875) internal successors, (273), 242 states have internal predecessors, (273), 43 states have call successors, (43), 17 states have call predecessors, (43), 26 states have return successors, (98), 50 states have call predecessors, (98), 43 states have call successors, (98) [2022-11-25 15:57:10,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 414 transitions. [2022-11-25 15:57:10,099 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 414 transitions. Word has length 38 [2022-11-25 15:57:10,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:57:10,099 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 414 transitions. [2022-11-25 15:57:10,100 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-25 15:57:10,100 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 414 transitions. [2022-11-25 15:57:10,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-25 15:57:10,101 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:57:10,101 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-25 15:57:10,120 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-11-25 15:57:10,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:57:10,315 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting minErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-25 15:57:10,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:57:10,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1592442388, now seen corresponding path program 2 times [2022-11-25 15:57:10,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:57:10,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351283127] [2022-11-25 15:57:10,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:57:10,316 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:57:10,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:57:10,318 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:57:10,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-11-25 15:57:10,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 15:57:10,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:57:10,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-25 15:57:10,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:57:10,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 15:57:10,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 15:57:10,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 15:57:11,392 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1682 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| nondet_tree_~n~0.base v_ArrVal_1682) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1681 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| nondet_tree_~n~0.base v_ArrVal_1681))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 15:57:11,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:57:11,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 15:57:11,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:57:11,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 15:57:11,467 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 15:57:11,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 15:57:11,535 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-25 15:57:11,549 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-25 15:57:11,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 15:57:11,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 15:57:12,177 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 9 not checked. [2022-11-25 15:57:12,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:57:15,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:57:15,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351283127] [2022-11-25 15:57:15,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1351283127] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:57:15,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1554396319] [2022-11-25 15:57:15,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:57:15,609 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 15:57:15,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 15:57:15,610 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 15:57:15,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2022-11-25 15:57:16,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 15:57:16,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:57:16,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-25 15:57:16,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:57:16,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 15:57:16,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 15:57:16,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 15:57:16,428 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1794 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| nondet_tree_~n~0.base v_ArrVal_1794))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (exists ((v_ArrVal_1793 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| nondet_tree_~n~0.base v_ArrVal_1793) |c_#memory_$Pointer$.base|)))) is different from true [2022-11-25 15:57:16,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:57:16,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 15:57:16,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:57:16,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 15:57:16,505 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 15:57:16,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 15:57:16,523 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-25 15:57:16,533 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-25 15:57:16,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 15:57:16,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 15:57:16,743 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 9 not checked. [2022-11-25 15:57:16,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:57:19,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1554396319] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:57:19,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:57:19,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2022-11-25 15:57:19,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618393612] [2022-11-25 15:57:19,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:57:19,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-25 15:57:19,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:57:19,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-25 15:57:19,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=636, Unknown=4, NotChecked=102, Total=812 [2022-11-25 15:57:19,079 INFO L87 Difference]: Start difference. First operand 310 states and 414 transitions. Second operand has 22 states, 20 states have (on average 1.7) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-25 15:57:25,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:57:25,155 INFO L93 Difference]: Finished difference Result 369 states and 498 transitions. [2022-11-25 15:57:25,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 15:57:25,156 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 1.7) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 45 [2022-11-25 15:57:25,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:57:25,158 INFO L225 Difference]: With dead ends: 369 [2022-11-25 15:57:25,159 INFO L226 Difference]: Without dead ends: 369 [2022-11-25 15:57:25,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 90 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=197, Invalid=1611, Unknown=6, NotChecked=166, Total=1980 [2022-11-25 15:57:25,160 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 254 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 1710 mSolverCounterSat, 95 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 2300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1710 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 477 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-25 15:57:25,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 1098 Invalid, 2300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1710 Invalid, 18 Unknown, 477 Unchecked, 4.5s Time] [2022-11-25 15:57:25,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-11-25 15:57:25,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 332. [2022-11-25 15:57:25,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 208 states have (on average 1.3990384615384615) internal successors, (291), 259 states have internal predecessors, (291), 46 states have call successors, (46), 19 states have call predecessors, (46), 29 states have return successors, (105), 53 states have call predecessors, (105), 46 states have call successors, (105) [2022-11-25 15:57:25,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 442 transitions. [2022-11-25 15:57:25,177 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 442 transitions. Word has length 45 [2022-11-25 15:57:25,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:57:25,177 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 442 transitions. [2022-11-25 15:57:25,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 1.7) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-25 15:57:25,178 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 442 transitions. [2022-11-25 15:57:25,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-25 15:57:25,180 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:57:25,180 INFO L195 NwaCegarLoop]: trace histogram [18, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 7, 7, 1, 1, 1, 1] [2022-11-25 15:57:25,186 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2022-11-25 15:57:25,396 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-11-25 15:57:25,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:57:25,586 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting nondet_treeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-25 15:57:25,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:57:25,586 INFO L85 PathProgramCache]: Analyzing trace with hash -579793882, now seen corresponding path program 4 times [2022-11-25 15:57:25,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:57:25,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029293496] [2022-11-25 15:57:25,587 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 15:57:25,587 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:57:25,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:57:25,588 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:57:25,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-11-25 15:57:26,751 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 15:57:26,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:57:26,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 899 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-25 15:57:26,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:57:26,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 15:57:26,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 15:57:26,919 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2113 (_ BitVec 1))) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_2113) |c_#valid|)) (exists ((v_ArrVal_2112 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2112) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 15:57:26,998 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2113 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2112 (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2112) |c_#length|) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_2113) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 15:57:27,180 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 15:57:27,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 15:57:27,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 15:57:27,251 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2114 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2114) |c_#length|)) (exists ((v_ArrVal_2115 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_2115))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 15:57:27,306 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2116 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2116) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 15:57:27,362 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2116 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2116) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 15:57:27,476 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2114 (_ BitVec 32)) (v_ArrVal_2116 (_ BitVec 32)) (v_nondet_tree_~n~0.base_197 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2115 (_ BitVec 1))) (and (= (_ bv0 1) (select (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_2115) v_nondet_tree_~n~0.base_197)) (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2114) v_nondet_tree_~n~0.base_197 v_ArrVal_2116) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 15:57:27,706 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) |c_#length|)) is different from true [2022-11-25 15:57:27,847 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2117 (_ BitVec 32)) (v_nondet_tree_~n~0.base_198 (_ 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_2117) v_nondet_tree_~n~0.base_198 (_ bv12 32))))) is different from true [2022-11-25 15:57:28,010 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2117 (_ BitVec 32)) (v_nondet_tree_~n~0.base_199 (_ BitVec 32)) (v_nondet_tree_~n~0.base_198 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2120 (_ BitVec 32))) (and (bvule (_ bv12 32) (select |c_#length| nondet_tree_~n~0.base)) (bvule (_ bv12 32) (select |c_#length| v_nondet_tree_~n~0.base_199)) (= |c_#length| (store (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2120) v_nondet_tree_~n~0.base_199 v_ArrVal_2117) v_nondet_tree_~n~0.base_198 (_ bv12 32))))) is different from true [2022-11-25 15:57:28,139 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2114 (_ BitVec 32)) (v_ArrVal_2117 (_ BitVec 32)) (v_ArrVal_2116 (_ BitVec 32)) (v_nondet_tree_~n~0.base_199 (_ BitVec 32)) (v_nondet_tree_~n~0.base_200 (_ BitVec 32)) (v_nondet_tree_~n~0.base_197 (_ BitVec 32)) (v_nondet_tree_~n~0.base_198 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2120 (_ BitVec 32)) (v_ArrVal_2115 (_ BitVec 1))) (and (= (select (store |c_old(#valid)| v_nondet_tree_~n~0.base_200 v_ArrVal_2115) v_nondet_tree_~n~0.base_197) (_ bv0 1)) (bvule (_ bv12 32) (select |c_#length| nondet_tree_~n~0.base)) (bvule (_ bv12 32) (select |c_#length| v_nondet_tree_~n~0.base_199)) (= (store (store (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_200 v_ArrVal_2114) v_nondet_tree_~n~0.base_197 v_ArrVal_2116) nondet_tree_~n~0.base v_ArrVal_2120) v_nondet_tree_~n~0.base_199 v_ArrVal_2117) v_nondet_tree_~n~0.base_198 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_200)))) is different from true [2022-11-25 15:57:28,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:57:28,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:57:28,843 INFO L321 Elim1Store]: treesize reduction 172, result has 28.0 percent of original size [2022-11-25 15:57:28,844 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 5 case distinctions, treesize of input 24 treesize of output 75 [2022-11-25 15:57:28,967 INFO L321 Elim1Store]: treesize reduction 17, result has 45.2 percent of original size [2022-11-25 15:57:28,968 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-25 15:57:29,140 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 349 proven. 82 refuted. 2 times theorem prover too weak. 135 trivial. 267 not checked. [2022-11-25 15:57:29,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:57:33,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:57:33,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029293496] [2022-11-25 15:57:33,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2029293496] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:57:33,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [481410644] [2022-11-25 15:57:33,072 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 15:57:33,072 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 15:57:33,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 15:57:33,073 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 15:57:33,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2022-11-25 15:57:35,962 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 15:57:35,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:57:36,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 899 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-25 15:57:36,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:57:36,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 15:57:36,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 15:57:36,126 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2424 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2424) |c_#length|)) (exists ((v_ArrVal_2423 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_2423))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 15:57:36,201 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2424 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2423 (_ BitVec 1))) (and (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_2423)) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2424) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 15:57:36,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:57:36,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 15:57:36,408 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 15:57:36,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 15:57:36,772 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2428 (_ 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_2428)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 15:57:37,463 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2431 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2431) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 15:57:37,517 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2431 (_ 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_2431) |c_#length|))) is different from true [2022-11-25 15:57:37,647 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_240 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2431 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_240)) (= |c_#length| (store (store |c_old(#length)| v_nondet_tree_~n~0.base_240 v_ArrVal_2431) nondet_tree_~n~0.base (_ bv12 32))))) is different from true [2022-11-25 15:57:37,721 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_240 (_ BitVec 32)) (v_nondet_tree_~n~0.base_241 (_ BitVec 32)) (v_ArrVal_2428 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2431 (_ BitVec 32))) (and (= (select (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) v_nondet_tree_~n~0.base_240) (_ bv0 1)) (= (store (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2428) v_nondet_tree_~n~0.base_240 v_ArrVal_2431) v_nondet_tree_~n~0.base_241 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 15:57:38,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:57:38,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:57:38,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:57:38,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:57:38,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:57:38,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:57:38,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:57:38,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:57:38,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:57:38,744 INFO L321 Elim1Store]: treesize reduction 67, result has 40.2 percent of original size [2022-11-25 15:57:38,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 53 [2022-11-25 15:57:38,954 INFO L321 Elim1Store]: treesize reduction 79, result has 21.8 percent of original size [2022-11-25 15:57:38,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 105 treesize of output 116 [2022-11-25 15:57:39,305 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 349 proven. 105 refuted. 0 times theorem prover too weak. 134 trivial. 247 not checked. [2022-11-25 15:57:39,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:57:55,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [481410644] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:57:55,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:57:55,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 31 [2022-11-25 15:57:55,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185916497] [2022-11-25 15:57:55,298 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:57:55,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-25 15:57:55,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:57:55,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-25 15:57:55,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=266, Unknown=30, NotChecked=816, Total=1190 [2022-11-25 15:57:55,300 INFO L87 Difference]: Start difference. First operand 332 states and 442 transitions. Second operand has 32 states, 31 states have (on average 3.225806451612903) internal successors, (100), 27 states have internal predecessors, (100), 18 states have call successors, (23), 3 states have call predecessors, (23), 14 states have return successors, (26), 19 states have call predecessors, (26), 18 states have call successors, (26) [2022-11-25 15:57:57,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:58:01,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:58:03,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:58:05,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:58:07,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:58:11,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:58:13,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:58:15,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:58:18,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:58:22,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:58:27,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:58:29,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:58:32,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:58:38,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:58:40,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:58:42,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:58:47,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:58:51,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:58:58,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:59:00,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:59:02,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:59:10,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:59:13,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:59:22,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:59:24,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:59:25,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:59:34,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:59:43,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:59:44,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:59:47,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:59:55,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:59:58,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:00:08,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:00:11,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:00:13,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:00:15,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:00:29,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:00:31,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:00:33,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:00:53,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:01:12,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:01:14,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:01:17,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:01:20,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:01:22,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:01:25,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:01:51,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:01:54,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:01:57,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:01:59,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:02:02,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 16:02:06,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:02:06,275 INFO L93 Difference]: Finished difference Result 382 states and 597 transitions. [2022-11-25 16:02:06,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 16:02:06,278 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.225806451612903) internal successors, (100), 27 states have internal predecessors, (100), 18 states have call successors, (23), 3 states have call predecessors, (23), 14 states have return successors, (26), 19 states have call predecessors, (26), 18 states have call successors, (26) Word has length 135 [2022-11-25 16:02:06,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:02:06,281 INFO L225 Difference]: With dead ends: 382 [2022-11-25 16:02:06,281 INFO L226 Difference]: Without dead ends: 382 [2022-11-25 16:02:06,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 237 SyntacticMatches, 11 SemanticMatches, 44 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 144.6s TimeCoverageRelationStatistics Valid=189, Invalid=622, Unknown=69, NotChecked=1190, Total=2070 [2022-11-25 16:02:06,283 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 186 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 1994 mSolverCounterSat, 102 mSolverCounterUnsat, 140 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 123.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 6400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1994 IncrementalHoareTripleChecker+Invalid, 140 IncrementalHoareTripleChecker+Unknown, 4164 IncrementalHoareTripleChecker+Unchecked, 124.6s IncrementalHoareTripleChecker+Time [2022-11-25 16:02:06,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 493 Invalid, 6400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1994 Invalid, 140 Unknown, 4164 Unchecked, 124.6s Time] [2022-11-25 16:02:06,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-11-25 16:02:06,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 347. [2022-11-25 16:02:06,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 219 states have (on average 1.3789954337899544) internal successors, (302), 270 states have internal predecessors, (302), 47 states have call successors, (47), 19 states have call predecessors, (47), 32 states have return successors, (137), 57 states have call predecessors, (137), 47 states have call successors, (137) [2022-11-25 16:02:06,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 486 transitions. [2022-11-25 16:02:06,303 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 486 transitions. Word has length 135 [2022-11-25 16:02:06,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:02:06,304 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 486 transitions. [2022-11-25 16:02:06,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.225806451612903) internal successors, (100), 27 states have internal predecessors, (100), 18 states have call successors, (23), 3 states have call predecessors, (23), 14 states have return successors, (26), 19 states have call predecessors, (26), 18 states have call successors, (26) [2022-11-25 16:02:06,304 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 486 transitions. [2022-11-25 16:02:06,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-25 16:02:06,306 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:02:06,306 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-25 16:02:06,335 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-11-25 16:02:06,539 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2022-11-25 16:02:06,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt [2022-11-25 16:02:06,729 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting minErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-25 16:02:06,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:02:06,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1134522260, now seen corresponding path program 3 times [2022-11-25 16:02:06,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:02:06,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1126814628] [2022-11-25 16:02:06,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 16:02:06,731 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:02:06,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:02:06,732 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 16:02:06,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-11-25 16:02:07,052 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 16:02:07,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:02:07,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-25 16:02:07,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:02:07,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 16:02:07,277 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-25 16:02:07,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-25 16:02:07,766 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 14 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 16:02:07,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:02:08,912 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 16:02:08,912 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 16:02:08,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1126814628] [2022-11-25 16:02:08,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1126814628] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:02:08,912 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 16:02:08,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2022-11-25 16:02:08,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155002154] [2022-11-25 16:02:08,913 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 16:02:08,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 16:02:08,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 16:02:08,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 16:02:08,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2022-11-25 16:02:08,914 INFO L87 Difference]: Start difference. First operand 347 states and 486 transitions. Second operand has 18 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-25 16:02:17,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:02:17,155 INFO L93 Difference]: Finished difference Result 391 states and 546 transitions. [2022-11-25 16:02:17,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 16:02:17,157 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 45 [2022-11-25 16:02:17,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:02:17,160 INFO L225 Difference]: With dead ends: 391 [2022-11-25 16:02:17,160 INFO L226 Difference]: Without dead ends: 391 [2022-11-25 16:02:17,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=154, Invalid=902, Unknown=0, NotChecked=0, Total=1056 [2022-11-25 16:02:17,162 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 204 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 2558 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 2627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:02:17,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 1112 Invalid, 2627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2558 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2022-11-25 16:02:17,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-11-25 16:02:17,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 361. [2022-11-25 16:02:17,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 230 states have (on average 1.3869565217391304) internal successors, (319), 281 states have internal predecessors, (319), 49 states have call successors, (49), 20 states have call predecessors, (49), 33 states have return successors, (139), 59 states have call predecessors, (139), 49 states have call successors, (139) [2022-11-25 16:02:17,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 507 transitions. [2022-11-25 16:02:17,179 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 507 transitions. Word has length 45 [2022-11-25 16:02:17,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:02:17,180 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 507 transitions. [2022-11-25 16:02:17,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-25 16:02:17,180 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 507 transitions. [2022-11-25 16:02:17,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-25 16:02:17,181 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:02:17,182 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-25 16:02:17,203 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-11-25 16:02:17,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:02:17,398 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting minErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-25 16:02:17,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:02:17,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1134522261, now seen corresponding path program 1 times [2022-11-25 16:02:17,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:02:17,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [670308854] [2022-11-25 16:02:17,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:02:17,399 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:02:17,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:02:17,400 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 16:02:17,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-11-25 16:02:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:02:17,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-25 16:02:17,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:02:17,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 16:02:17,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 16:02:17,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 16:02:18,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-25 16:02:18,082 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-25 16:02:18,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 16:02:18,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-25 16:02:18,755 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-25 16:02:18,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:02:25,111 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-25 16:02:25,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 16:02:25,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [670308854] [2022-11-25 16:02:25,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [670308854] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:02:25,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 16:02:25,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2022-11-25 16:02:25,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99250850] [2022-11-25 16:02:25,112 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 16:02:25,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-25 16:02:25,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 16:02:25,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-25 16:02:25,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=797, Unknown=0, NotChecked=0, Total=870 [2022-11-25 16:02:25,114 INFO L87 Difference]: Start difference. First operand 361 states and 507 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-25 16:02:45,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:02:45,875 INFO L93 Difference]: Finished difference Result 409 states and 573 transitions. [2022-11-25 16:02:45,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 16:02:45,876 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-25 16:02:45,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:02:45,880 INFO L225 Difference]: With dead ends: 409 [2022-11-25 16:02:45,880 INFO L226 Difference]: Without dead ends: 409 [2022-11-25 16:02:45,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=179, Invalid=1543, Unknown=0, NotChecked=0, Total=1722 [2022-11-25 16:02:45,882 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 403 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 3749 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 3901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 3749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.7s IncrementalHoareTripleChecker+Time [2022-11-25 16:02:45,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 1155 Invalid, 3901 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [152 Valid, 3749 Invalid, 0 Unknown, 0 Unchecked, 18.7s Time] [2022-11-25 16:02:45,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-11-25 16:02:45,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 391. [2022-11-25 16:02:45,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 253 states have (on average 1.3715415019762847) internal successors, (347), 304 states have internal predecessors, (347), 54 states have call successors, (54), 22 states have call predecessors, (54), 35 states have return successors, (144), 64 states have call predecessors, (144), 54 states have call successors, (144) [2022-11-25 16:02:45,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 545 transitions. [2022-11-25 16:02:45,908 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 545 transitions. Word has length 45 [2022-11-25 16:02:45,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:02:45,908 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 545 transitions. [2022-11-25 16:02:45,909 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-25 16:02:45,909 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 545 transitions. [2022-11-25 16:02:45,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-11-25 16:02:45,913 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:02:45,913 INFO L195 NwaCegarLoop]: trace histogram [21, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 1, 1, 1, 1] [2022-11-25 16:02:45,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-11-25 16:02:46,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:02:46,128 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting nondet_treeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-25 16:02:46,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:02:46,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1300883128, now seen corresponding path program 5 times [2022-11-25 16:02:46,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:02:46,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664149607] [2022-11-25 16:02:46,129 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 16:02:46,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:02:46,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:02:46,134 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 16:02:46,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-11-25 16:02:49,793 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2022-11-25 16:02:49,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:02:49,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 1009 conjuncts, 94 conjunts are in the unsatisfiable core [2022-11-25 16:02:49,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:02:49,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 16:02:49,977 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2923 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2923) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 16:02:50,033 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2923 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2923) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 16:02:50,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:02:50,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 16:02:50,155 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 16:02:50,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 16:02:50,279 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2927 (_ BitVec 1))) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_2927) |c_#valid|)) (exists ((v_ArrVal_2926 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2926))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 16:02:50,348 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2927 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2926 (_ BitVec 32))) (and (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_2927) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2926)))) is different from true [2022-11-25 16:02:52,730 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (exists ((v_ArrVal_2930 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2930) |c_#length|)) (exists ((v_ArrVal_2931 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_2931))))) is different from true [2022-11-25 16:02:52,816 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2930 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2931 (_ BitVec 1))) (and (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_2931)) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2930) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 16:02:55,129 WARN L859 $PredicateComparison]: unable to prove that (exists ((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 (_ bv12 32)) |c_#length|))) is different from true [2022-11-25 16:02:55,218 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2934 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2934))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 16:02:55,297 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2934 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2934)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-25 16:02:55,332 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) |c_#length|)) is different from true [2022-11-25 16:02:55,422 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2934 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_304 (_ BitVec 32))) (and (= (store (store |c_old(#length)| v_nondet_tree_~n~0.base_304 v_ArrVal_2934) nondet_tree_~n~0.base (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_304)))) is different from true [2022-11-25 16:02:55,489 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2934 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_304 (_ BitVec 32)) (v_nondet_tree_~n~0.base_305 (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| v_nondet_tree_~n~0.base_305 (_ bv1 1)) v_nondet_tree_~n~0.base_304)) (= (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_305 (_ bv12 32)) v_nondet_tree_~n~0.base_304 v_ArrVal_2934) nondet_tree_~n~0.base (_ bv12 32)) |c_#length|))) is different from true [2022-11-25 16:02:55,746 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2928 (_ BitVec 1)) (v_ArrVal_2930 (_ BitVec 32)) (v_ArrVal_2934 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2931 (_ BitVec 1)) (v_nondet_tree_~n~0.base_303 (_ BitVec 32)) (v_nondet_tree_~n~0.base_306 (_ BitVec 32)) (v_ArrVal_2929 (_ BitVec 32)) (v_nondet_tree_~n~0.base_304 (_ BitVec 32)) (v_nondet_tree_~n~0.base_305 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_2928))) (and (bvule (_ bv12 32) (select |c_#length| nondet_tree_~n~0.base)) (= (_ bv0 1) (select .cse0 v_nondet_tree_~n~0.base_303)) (= (store (store (store (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2929) v_nondet_tree_~n~0.base_303 v_ArrVal_2930) v_nondet_tree_~n~0.base_305 (_ bv12 32)) v_nondet_tree_~n~0.base_304 v_ArrVal_2934) v_nondet_tree_~n~0.base_306 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select (store (store .cse0 v_nondet_tree_~n~0.base_303 v_ArrVal_2931) v_nondet_tree_~n~0.base_305 (_ bv1 1)) v_nondet_tree_~n~0.base_304))))) is different from true [2022-11-25 16:02:58,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:02:58,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:02:58,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:02:58,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:02:59,591 INFO L321 Elim1Store]: treesize reduction 379, result has 19.7 percent of original size [2022-11-25 16:02:59,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 30 treesize of output 101 [2022-11-25 16:03:00,172 INFO L321 Elim1Store]: treesize reduction 22, result has 78.2 percent of original size [2022-11-25 16:03:00,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 15258 treesize of output 15200 [2022-11-25 16:03:04,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1084 backedges. 323 proven. 138 refuted. 1 times theorem prover too weak. 167 trivial. 455 not checked. [2022-11-25 16:03:04,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:03:09,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 16:03:09,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664149607] [2022-11-25 16:03:09,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1664149607] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:03:09,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1831729729] [2022-11-25 16:03:09,868 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 16:03:09,868 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 16:03:09,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 16:03:09,870 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 16:03:09,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2022-11-25 16:03:10,506 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:03:10,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102954046] [2022-11-25 16:03:10,507 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 16:03:10,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:03:10,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:03:10,511 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:03:10,512 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (34)] Ended with exit code 1 [2022-11-25 16:03:10,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01f4c895-e636-4aec-9a51-74ebc4dc6139/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process