./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 --- 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 18:03:25,407 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:03:25,410 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:03:25,442 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:03:25,445 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:03:25,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:03:25,452 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:03:25,456 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:03:25,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:03:25,464 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:03:25,466 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:03:25,469 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:03:25,469 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:03:25,474 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:03:25,475 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:03:25,478 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:03:25,479 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:03:25,481 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:03:25,482 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:03:25,489 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:03:25,491 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:03:25,493 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:03:25,495 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:03:25,496 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:03:25,506 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:03:25,507 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:03:25,507 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:03:25,509 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:03:25,510 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:03:25,512 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:03:25,513 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:03:25,514 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:03:25,516 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:03:25,517 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:03:25,518 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:03:25,518 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:03:25,519 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:03:25,519 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:03:25,519 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:03:25,520 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:03:25,521 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:03:25,522 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 18:03:25,560 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:03:25,560 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:03:25,560 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:03:25,561 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:03:25,561 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:03:25,562 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:03:25,563 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:03:25,563 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:03:25,563 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:03:25,563 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:03:25,564 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:03:25,565 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 18:03:25,565 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:03:25,565 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:03:25,565 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:03:25,566 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 18:03:25,566 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 18:03:25,566 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 18:03:25,566 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:03:25,567 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 18:03:25,567 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:03:25,567 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:03:25,567 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:03:25,568 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:03:25,568 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:03:25,568 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:03:25,568 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:03:25,568 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:03:25,569 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:03:25,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:03:25,569 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:03:25,569 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:03:25,570 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:03:25,570 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_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 [2022-11-25 18:03:25,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:03:25,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:03:25,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:03:25,888 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:03:25,889 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:03:25,890 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2022-11-25 18:03:29,056 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:03:29,393 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:03:29,393 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2022-11-25 18:03:29,404 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/data/81e9a31d2/79fff42a4c80498ca766c0a071eaac0d/FLAG3e5ce9ae3 [2022-11-25 18:03:29,420 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/data/81e9a31d2/79fff42a4c80498ca766c0a071eaac0d [2022-11-25 18:03:29,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:03:29,424 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:03:29,426 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:03:29,426 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:03:29,430 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:03:29,431 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:03:29" (1/1) ... [2022-11-25 18:03:29,432 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@549b71eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:29, skipping insertion in model container [2022-11-25 18:03:29,432 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:03:29" (1/1) ... [2022-11-25 18:03:29,441 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:03:29,471 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:03:29,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:03:29,802 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 18:03:29,803 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@91cf6f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:29, skipping insertion in model container [2022-11-25 18:03:29,803 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:03:29,804 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-25 18:03:29,808 INFO L158 Benchmark]: Toolchain (without parser) took 382.21ms. Allocated memory is still 161.5MB. Free memory was 131.3MB in the beginning and 119.4MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 18:03:29,808 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 121.6MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:03:29,809 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.11ms. Allocated memory is still 161.5MB. Free memory was 130.8MB in the beginning and 119.4MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 18:03:29,811 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.30ms. Allocated memory is still 121.6MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 378.11ms. Allocated memory is still 161.5MB. Free memory was 130.8MB in the beginning and 119.4MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 555]: 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_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 --- 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 18:03:32,182 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:03:32,185 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:03:32,229 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:03:32,230 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:03:32,234 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:03:32,237 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:03:32,241 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:03:32,244 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:03:32,250 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:03:32,251 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:03:32,254 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:03:32,254 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:03:32,257 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:03:32,258 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:03:32,266 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:03:32,267 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:03:32,268 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:03:32,270 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:03:32,275 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:03:32,277 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:03:32,281 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:03:32,282 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:03:32,283 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:03:32,294 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:03:32,295 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:03:32,295 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:03:32,297 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:03:32,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:03:32,299 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:03:32,300 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:03:32,301 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:03:32,303 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:03:32,304 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:03:32,325 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:03:32,325 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:03:32,326 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:03:32,326 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:03:32,327 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:03:32,328 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:03:32,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:03:32,334 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-25 18:03:32,376 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:03:32,377 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:03:32,378 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:03:32,379 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:03:32,380 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:03:32,380 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:03:32,381 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:03:32,381 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:03:32,381 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:03:32,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:03:32,383 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:03:32,383 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 18:03:32,383 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:03:32,384 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:03:32,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:03:32,384 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 18:03:32,384 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 18:03:32,385 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 18:03:32,385 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:03:32,385 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 18:03:32,385 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 18:03:32,385 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 18:03:32,386 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:03:32,386 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:03:32,386 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:03:32,387 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:03:32,387 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:03:32,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:03:32,387 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:03:32,388 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:03:32,388 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 18:03:32,388 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 18:03:32,388 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:03:32,389 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:03:32,389 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:03:32,389 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 18:03:32,389 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_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 [2022-11-25 18:03:32,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:03:32,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:03:32,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:03:32,840 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:03:32,841 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:03:32,842 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2022-11-25 18:03:36,185 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:03:36,436 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:03:36,437 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2022-11-25 18:03:36,449 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/data/66fdab3ab/328bad7828a746798d7db804c48781f6/FLAG63f249c31 [2022-11-25 18:03:36,467 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/data/66fdab3ab/328bad7828a746798d7db804c48781f6 [2022-11-25 18:03:36,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:03:36,471 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:03:36,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:03:36,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:03:36,477 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:03:36,478 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:03:36" (1/1) ... [2022-11-25 18:03:36,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56c9c626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:36, skipping insertion in model container [2022-11-25 18:03:36,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:03:36" (1/1) ... [2022-11-25 18:03:36,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:03:36,528 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:03:36,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:03:36,859 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-25 18:03:36,869 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:03:36,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:03:36,936 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:03:37,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:03:37,047 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:03:37,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:37 WrapperNode [2022-11-25 18:03:37,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:03:37,049 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:03:37,049 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:03:37,049 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:03:37,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:37" (1/1) ... [2022-11-25 18:03:37,090 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:37" (1/1) ... [2022-11-25 18:03:37,134 INFO L138 Inliner]: procedures = 129, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 110 [2022-11-25 18:03:37,135 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:03:37,135 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:03:37,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:03:37,137 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:03:37,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:37" (1/1) ... [2022-11-25 18:03:37,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:37" (1/1) ... [2022-11-25 18:03:37,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:37" (1/1) ... [2022-11-25 18:03:37,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:37" (1/1) ... [2022-11-25 18:03:37,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:37" (1/1) ... [2022-11-25 18:03:37,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:37" (1/1) ... [2022-11-25 18:03:37,194 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:37" (1/1) ... [2022-11-25 18:03:37,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:37" (1/1) ... [2022-11-25 18:03:37,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:03:37,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:03:37,212 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:03:37,212 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:03:37,213 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:37" (1/1) ... [2022-11-25 18:03:37,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:03:37,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:03:37,271 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:03:37,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:03:37,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 18:03:37,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:03:37,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:03:37,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 18:03:37,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 18:03:37,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:03:37,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 18:03:37,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 18:03:37,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 18:03:37,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:03:37,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:03:37,458 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:03:37,460 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:03:38,151 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:03:38,158 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:03:38,158 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-25 18:03:38,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:03:38 BoogieIcfgContainer [2022-11-25 18:03:38,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:03:38,163 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:03:38,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:03:38,182 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:03:38,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:03:36" (1/3) ... [2022-11-25 18:03:38,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee1daed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:03:38, skipping insertion in model container [2022-11-25 18:03:38,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:37" (2/3) ... [2022-11-25 18:03:38,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee1daed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:03:38, skipping insertion in model container [2022-11-25 18:03:38,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:03:38" (3/3) ... [2022-11-25 18:03:38,185 INFO L112 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-2.i [2022-11-25 18:03:38,210 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:03:38,211 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2022-11-25 18:03:38,267 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:03:38,274 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;@463932a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:03:38,275 INFO L358 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2022-11-25 18:03:38,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 97 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:38,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 18:03:38,287 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:03:38,288 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 18:03:38,289 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:03:38,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:03:38,296 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2022-11-25 18:03:38,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:03:38,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1356777009] [2022-11-25 18:03:38,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:03:38,313 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 18:03:38,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:03:38,319 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:38,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:03:38,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 18:03:38,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:03:38,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 18:03:38,681 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 18:03:38,682 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 18:03:38,717 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 18:03:38,718 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:03:38,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:03:38,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1356777009] [2022-11-25 18:03:38,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1356777009] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:03:38,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:03:38,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:03:38,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452906079] [2022-11-25 18:03:38,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:03:38,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:03:38,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:03:38,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:03:38,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:03:38,765 INFO L87 Difference]: Start difference. First operand has 98 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 97 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:39,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:03:39,196 INFO L93 Difference]: Finished difference Result 148 states and 157 transitions. [2022-11-25 18:03:39,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:03:39,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-25 18:03:39,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:03:39,212 INFO L225 Difference]: With dead ends: 148 [2022-11-25 18:03:39,213 INFO L226 Difference]: Without dead ends: 146 [2022-11-25 18:03:39,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:03:39,220 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 209 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:03:39,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 94 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 18:03:39,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-25 18:03:39,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 93. [2022-11-25 18:03:39,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 52 states have (on average 1.9230769230769231) internal successors, (100), 92 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:39,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2022-11-25 18:03:39,264 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 4 [2022-11-25 18:03:39,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:03:39,265 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2022-11-25 18:03:39,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:39,266 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2022-11-25 18:03:39,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 18:03:39,266 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:03:39,267 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 18:03:39,279 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-25 18:03:39,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:39,480 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:03:39,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:03:39,481 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2022-11-25 18:03:39,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:03:39,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494525799] [2022-11-25 18:03:39,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:03:39,482 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 18:03:39,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:03:39,483 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:39,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:03:39,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 18:03:39,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:03:39,598 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 18:03:39,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:03:39,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:03:39,717 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 18:03:39,731 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:03:39,733 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 18:03:39,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:03:39,758 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:03:39,759 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:03:39,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494525799] [2022-11-25 18:03:39,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [494525799] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:03:39,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:03:39,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:03:39,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417578198] [2022-11-25 18:03:39,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:03:39,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:03:39,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:03:39,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:03:39,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:03:39,778 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:40,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:03:40,503 INFO L93 Difference]: Finished difference Result 236 states and 253 transitions. [2022-11-25 18:03:40,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:03:40,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-25 18:03:40,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:03:40,508 INFO L225 Difference]: With dead ends: 236 [2022-11-25 18:03:40,508 INFO L226 Difference]: Without dead ends: 236 [2022-11-25 18:03:40,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:03:40,509 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 239 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:03:40,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 97 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 18:03:40,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-11-25 18:03:40,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 107. [2022-11-25 18:03:40,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 67 states have (on average 1.8208955223880596) internal successors, (122), 106 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:40,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2022-11-25 18:03:40,526 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 4 [2022-11-25 18:03:40,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:03:40,527 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2022-11-25 18:03:40,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:40,527 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2022-11-25 18:03:40,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 18:03:40,528 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:03:40,528 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 18:03:40,537 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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)] Ended with exit code 0 [2022-11-25 18:03:40,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:40,735 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:03:40,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:03:40,736 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2022-11-25 18:03:40,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:03:40,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [568666665] [2022-11-25 18:03:40,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:03:40,737 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 18:03:40,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:03:40,738 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:40,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:03:40,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 18:03:40,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:03:40,834 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 18:03:40,847 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 18:03:40,847 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:03:40,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:03:40,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [568666665] [2022-11-25 18:03:40,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [568666665] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:03:40,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:03:40,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:03:40,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118047651] [2022-11-25 18:03:40,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:03:40,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:03:40,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:03:40,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:03:40,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:03:40,854 INFO L87 Difference]: Start difference. First operand 107 states and 122 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:41,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:03:41,086 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2022-11-25 18:03:41,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:03:41,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 18:03:41,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:03:41,088 INFO L225 Difference]: With dead ends: 136 [2022-11-25 18:03:41,088 INFO L226 Difference]: Without dead ends: 136 [2022-11-25 18:03:41,089 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 18:03:41,090 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 75 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:03:41,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 87 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:03:41,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-25 18:03:41,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 105. [2022-11-25 18:03:41,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 67 states have (on average 1.7761194029850746) internal successors, (119), 104 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:41,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2022-11-25 18:03:41,099 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 5 [2022-11-25 18:03:41,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:03:41,099 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2022-11-25 18:03:41,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:41,100 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-11-25 18:03:41,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 18:03:41,100 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:03:41,100 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 18:03:41,124 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:41,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:41,312 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:03:41,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:03:41,312 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2022-11-25 18:03:41,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:03:41,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1107925700] [2022-11-25 18:03:41,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:03:41,313 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 18:03:41,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:03:41,314 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:41,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:03:41,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 18:03:41,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:03:41,399 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 18:03:41,416 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 18:03:41,416 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:03:41,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:03:41,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1107925700] [2022-11-25 18:03:41,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1107925700] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:03:41,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:03:41,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:03:41,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131085339] [2022-11-25 18:03:41,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:03:41,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:03:41,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:03:41,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:03:41,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:03:41,419 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:41,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:03:41,752 INFO L93 Difference]: Finished difference Result 180 states and 203 transitions. [2022-11-25 18:03:41,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:03:41,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 18:03:41,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:03:41,754 INFO L225 Difference]: With dead ends: 180 [2022-11-25 18:03:41,754 INFO L226 Difference]: Without dead ends: 180 [2022-11-25 18:03:41,754 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 18:03:41,755 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 72 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:03:41,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 114 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 18:03:41,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-11-25 18:03:41,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 108. [2022-11-25 18:03:41,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 71 states have (on average 1.732394366197183) internal successors, (123), 107 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:41,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2022-11-25 18:03:41,769 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 5 [2022-11-25 18:03:41,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:03:41,769 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2022-11-25 18:03:41,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:41,770 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2022-11-25 18:03:41,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 18:03:41,770 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:03:41,770 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:03:41,792 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:41,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:41,985 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:03:41,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:03:41,986 INFO L85 PathProgramCache]: Analyzing trace with hash 234239181, now seen corresponding path program 1 times [2022-11-25 18:03:41,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:03:41,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53042350] [2022-11-25 18:03:41,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:03:41,987 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 18:03:41,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:03:41,988 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:41,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:03:42,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 18:03:42,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:03:42,076 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 18:03:42,100 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 18:03:42,101 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 18:03:42,112 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 18:03:42,112 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:03:42,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:03:42,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [53042350] [2022-11-25 18:03:42,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [53042350] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:03:42,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:03:42,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:03:42,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621902347] [2022-11-25 18:03:42,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:03:42,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:03:42,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:03:42,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:03:42,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:03:42,125 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:42,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:03:42,345 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2022-11-25 18:03:42,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:03:42,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-25 18:03:42,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:03:42,347 INFO L225 Difference]: With dead ends: 151 [2022-11-25 18:03:42,347 INFO L226 Difference]: Without dead ends: 151 [2022-11-25 18:03:42,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 1 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 18:03:42,348 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 69 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:03:42,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 144 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:03:42,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-25 18:03:42,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 104. [2022-11-25 18:03:42,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 71 states have (on average 1.6619718309859155) internal successors, (118), 103 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:42,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2022-11-25 18:03:42,356 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 9 [2022-11-25 18:03:42,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:03:42,357 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2022-11-25 18:03:42,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:42,357 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2022-11-25 18:03:42,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 18:03:42,358 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:03:42,358 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:03:42,380 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:42,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:42,571 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:03:42,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:03:42,571 INFO L85 PathProgramCache]: Analyzing trace with hash 234239182, now seen corresponding path program 1 times [2022-11-25 18:03:42,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:03:42,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1863448404] [2022-11-25 18:03:42,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:03:42,572 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 18:03:42,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:03:42,573 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:42,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:03:42,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 18:03:42,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:03:42,670 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 18:03:42,677 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 18:03:42,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:03:42,720 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 18:03:42,739 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:03:42,740 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 18:03:42,753 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 18:03:42,754 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:03:42,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:03:42,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1863448404] [2022-11-25 18:03:42,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1863448404] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:03:42,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:03:42,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:03:42,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725727242] [2022-11-25 18:03:42,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:03:42,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:03:42,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:03:42,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:03:42,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:03:42,756 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:43,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:03:43,161 INFO L93 Difference]: Finished difference Result 200 states and 220 transitions. [2022-11-25 18:03:43,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:03:43,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-25 18:03:43,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:03:43,163 INFO L225 Difference]: With dead ends: 200 [2022-11-25 18:03:43,163 INFO L226 Difference]: Without dead ends: 200 [2022-11-25 18:03:43,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:03:43,164 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 187 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:03:43,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 166 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 18:03:43,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-11-25 18:03:43,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 100. [2022-11-25 18:03:43,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 71 states have (on average 1.591549295774648) internal successors, (113), 99 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:43,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2022-11-25 18:03:43,171 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 9 [2022-11-25 18:03:43,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:03:43,172 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2022-11-25 18:03:43,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:43,172 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2022-11-25 18:03:43,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 18:03:43,173 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:03:43,173 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:03:43,191 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:43,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:43,386 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:03:43,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:03:43,387 INFO L85 PathProgramCache]: Analyzing trace with hash 184732728, now seen corresponding path program 1 times [2022-11-25 18:03:43,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:03:43,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [660749756] [2022-11-25 18:03:43,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:03:43,387 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 18:03:43,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:03:43,389 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:43,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:03:43,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 18:03:43,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:03:43,489 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 18:03:43,508 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 18:03:43,546 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 18:03:43,567 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 18:03:43,567 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:03:43,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:03:43,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [660749756] [2022-11-25 18:03:43,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [660749756] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:03:43,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:03:43,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:03:43,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458913903] [2022-11-25 18:03:43,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:03:43,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:03:43,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:03:43,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:03:43,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:03:43,570 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:43,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:03:43,952 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2022-11-25 18:03:43,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:03:43,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-25 18:03:43,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:03:43,953 INFO L225 Difference]: With dead ends: 109 [2022-11-25 18:03:43,953 INFO L226 Difference]: Without dead ends: 109 [2022-11-25 18:03:43,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:03:43,954 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 9 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:03:43,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 216 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 18:03:43,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-25 18:03:43,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2022-11-25 18:03:43,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.5945945945945945) internal successors, (118), 102 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:43,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2022-11-25 18:03:43,960 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 13 [2022-11-25 18:03:43,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:03:43,960 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2022-11-25 18:03:43,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:43,960 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2022-11-25 18:03:43,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 18:03:43,961 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:03:43,961 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:03:43,978 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:44,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:44,173 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:03:44,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:03:44,174 INFO L85 PathProgramCache]: Analyzing trace with hash 184732729, now seen corresponding path program 1 times [2022-11-25 18:03:44,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:03:44,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [5612381] [2022-11-25 18:03:44,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:03:44,174 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 18:03:44,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:03:44,176 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:44,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-25 18:03:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:03:44,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 18:03:44,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:03:44,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:03:44,329 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 18:03:44,339 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 18:03:44,436 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 18:03:44,441 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 18:03:44,473 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 18:03:44,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:03:44,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:03:44,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [5612381] [2022-11-25 18:03:44,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [5612381] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:03:44,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:03:44,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:03:44,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198448926] [2022-11-25 18:03:44,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:03:44,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:03:44,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:03:44,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:03:44,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:03:44,476 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:44,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:03:44,942 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2022-11-25 18:03:44,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:03:44,944 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-25 18:03:44,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:03:44,945 INFO L225 Difference]: With dead ends: 104 [2022-11-25 18:03:44,945 INFO L226 Difference]: Without dead ends: 104 [2022-11-25 18:03:44,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:03:44,946 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 4 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:03:44,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 218 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 18:03:44,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-25 18:03:44,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2022-11-25 18:03:44,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.5675675675675675) internal successors, (116), 102 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:44,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2022-11-25 18:03:44,951 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 13 [2022-11-25 18:03:44,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:03:44,951 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2022-11-25 18:03:44,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:44,952 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2022-11-25 18:03:44,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 18:03:44,952 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:03:44,952 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:03:44,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-25 18:03:45,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:45,165 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:03:45,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:03:45,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1897191059, now seen corresponding path program 1 times [2022-11-25 18:03:45,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:03:45,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1629505573] [2022-11-25 18:03:45,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:03:45,167 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 18:03:45,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:03:45,168 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:45,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:03:45,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 18:03:45,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:03:45,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:03:45,441 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 14 treesize of output 16 [2022-11-25 18:03:45,460 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:03:45,460 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 18:03:45,536 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 18:03:45,536 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:03:45,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:03:45,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1629505573] [2022-11-25 18:03:45,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1629505573] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:03:45,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:03:45,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:03:45,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849304607] [2022-11-25 18:03:45,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:03:45,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:03:45,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:03:45,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:03:45,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:03:45,539 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:45,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:03:45,876 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2022-11-25 18:03:45,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:03:45,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-25 18:03:45,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:03:45,878 INFO L225 Difference]: With dead ends: 133 [2022-11-25 18:03:45,878 INFO L226 Difference]: Without dead ends: 133 [2022-11-25 18:03:45,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:03:45,879 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 413 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:03:45,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 65 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 18:03:45,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-25 18:03:45,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 98. [2022-11-25 18:03:45,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 97 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:45,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2022-11-25 18:03:45,883 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 15 [2022-11-25 18:03:45,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:03:45,884 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2022-11-25 18:03:45,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:45,884 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2022-11-25 18:03:45,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 18:03:45,885 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:03:45,885 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 18:03:45,906 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:46,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:46,086 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:03:46,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:03:46,086 INFO L85 PathProgramCache]: Analyzing trace with hash -734113802, now seen corresponding path program 1 times [2022-11-25 18:03:46,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:03:46,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1722137274] [2022-11-25 18:03:46,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:03:46,087 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 18:03:46,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:03:46,088 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:46,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-25 18:03:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:03:46,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 18:03:46,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:03:46,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:03:46,318 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 16 treesize of output 8 [2022-11-25 18:03:46,338 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 18:03:46,338 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:03:46,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:03:46,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1722137274] [2022-11-25 18:03:46,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1722137274] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:03:46,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:03:46,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:03:46,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838958101] [2022-11-25 18:03:46,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:03:46,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:03:46,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:03:46,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:03:46,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:03:46,340 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:46,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:03:46,616 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2022-11-25 18:03:46,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:03:46,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 18:03:46,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:03:46,617 INFO L225 Difference]: With dead ends: 137 [2022-11-25 18:03:46,617 INFO L226 Difference]: Without dead ends: 137 [2022-11-25 18:03:46,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:03:46,618 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 168 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:03:46,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 174 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:03:46,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-25 18:03:46,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 98. [2022-11-25 18:03:46,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.5714285714285714) internal successors, (110), 97 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:46,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2022-11-25 18:03:46,622 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 17 [2022-11-25 18:03:46,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:03:46,623 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2022-11-25 18:03:46,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:46,623 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2022-11-25 18:03:46,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 18:03:46,624 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:03:46,624 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 18:03:46,636 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-25 18:03:46,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:46,834 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:03:46,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:03:46,834 INFO L85 PathProgramCache]: Analyzing trace with hash -734113798, now seen corresponding path program 1 times [2022-11-25 18:03:46,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:03:46,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569557139] [2022-11-25 18:03:46,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:03:46,835 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 18:03:46,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:03:46,836 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:46,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:03:46,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 18:03:46,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:03:46,939 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 18:03:47,053 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 11 treesize of output 7 [2022-11-25 18:03:47,088 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 11 [2022-11-25 18:03:47,099 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 18:03:47,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:03:47,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:03:47,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1569557139] [2022-11-25 18:03:47,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1569557139] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:03:47,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:03:47,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:03:47,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300252610] [2022-11-25 18:03:47,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:03:47,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:03:47,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:03:47,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:03:47,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:03:47,102 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:47,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:03:47,530 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2022-11-25 18:03:47,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:03:47,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 18:03:47,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:03:47,531 INFO L225 Difference]: With dead ends: 129 [2022-11-25 18:03:47,531 INFO L226 Difference]: Without dead ends: 129 [2022-11-25 18:03:47,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:03:47,532 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 97 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:03:47,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 158 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 18:03:47,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-25 18:03:47,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 98. [2022-11-25 18:03:47,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.5571428571428572) internal successors, (109), 97 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:47,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2022-11-25 18:03:47,534 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 17 [2022-11-25 18:03:47,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:03:47,535 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2022-11-25 18:03:47,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:47,535 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2022-11-25 18:03:47,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 18:03:47,535 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:03:47,536 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 18:03:47,553 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-25 18:03:47,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:47,736 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:03:47,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:03:47,737 INFO L85 PathProgramCache]: Analyzing trace with hash -734113797, now seen corresponding path program 1 times [2022-11-25 18:03:47,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:03:47,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956763741] [2022-11-25 18:03:47,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:03:47,737 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 18:03:47,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:03:47,738 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:47,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:03:47,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-25 18:03:47,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:03:47,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:03:48,010 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 11 treesize of output 7 [2022-11-25 18:03:48,019 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 11 treesize of output 7 [2022-11-25 18:03:48,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-25 18:03:48,080 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 18:03:48,100 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 18:03:48,101 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:03:48,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:03:48,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [956763741] [2022-11-25 18:03:48,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [956763741] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:03:48,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:03:48,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:03:48,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356508322] [2022-11-25 18:03:48,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:03:48,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:03:48,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:03:48,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:03:48,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:03:48,103 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:48,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:03:48,726 INFO L93 Difference]: Finished difference Result 201 states and 219 transitions. [2022-11-25 18:03:48,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:03:48,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 18:03:48,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:03:48,727 INFO L225 Difference]: With dead ends: 201 [2022-11-25 18:03:48,727 INFO L226 Difference]: Without dead ends: 201 [2022-11-25 18:03:48,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:03:48,728 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 149 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:03:48,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 221 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 18:03:48,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-11-25 18:03:48,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 106. [2022-11-25 18:03:48,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 105 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:48,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2022-11-25 18:03:48,732 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 17 [2022-11-25 18:03:48,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:03:48,733 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2022-11-25 18:03:48,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:48,733 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2022-11-25 18:03:48,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 18:03:48,733 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:03:48,734 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:03:48,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:48,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:48,934 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:03:48,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:03:48,935 INFO L85 PathProgramCache]: Analyzing trace with hash 50233868, now seen corresponding path program 1 times [2022-11-25 18:03:48,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:03:48,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772014543] [2022-11-25 18:03:48,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:03:48,936 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 18:03:48,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:03:48,937 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:48,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:03:49,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 18:03:49,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:03:49,106 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 18:03:49,149 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 18:03:49,150 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 18:03:49,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:03:49,315 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:03:49,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 18:03:49,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-25 18:03:49,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 18:03:49,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:03:51,538 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-25 18:03:51,600 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:03:51,600 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-25 18:03:51,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2022-11-25 18:03:51,615 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 11 treesize of output 7 [2022-11-25 18:03:55,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-25 18:03:55,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:03:55,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772014543] [2022-11-25 18:03:55,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772014543] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:03:55,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:03:55,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2022-11-25 18:03:55,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043876272] [2022-11-25 18:03:55,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:03:55,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 18:03:55,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:03:55,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 18:03:55,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=95, Unknown=3, NotChecked=20, Total=156 [2022-11-25 18:03:55,802 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:57,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:03:57,142 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2022-11-25 18:03:57,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:03:57,143 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-25 18:03:57,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:03:57,144 INFO L225 Difference]: With dead ends: 154 [2022-11-25 18:03:57,144 INFO L226 Difference]: Without dead ends: 154 [2022-11-25 18:03:57,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=46, Invalid=111, Unknown=3, NotChecked=22, Total=182 [2022-11-25 18:03:57,145 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 70 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:03:57,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 562 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 420 Invalid, 0 Unknown, 100 Unchecked, 1.2s Time] [2022-11-25 18:03:57,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-25 18:03:57,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 105. [2022-11-25 18:03:57,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 78 states have (on average 1.5) internal successors, (117), 104 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:57,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2022-11-25 18:03:57,150 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 18 [2022-11-25 18:03:57,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:03:57,150 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2022-11-25 18:03:57,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:03:57,151 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2022-11-25 18:03:57,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 18:03:57,152 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:03:57,152 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:03:57,172 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-25 18:03:57,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:57,353 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:03:57,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:03:57,353 INFO L85 PathProgramCache]: Analyzing trace with hash 50233869, now seen corresponding path program 1 times [2022-11-25 18:03:57,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:03:57,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1521341989] [2022-11-25 18:03:57,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:03:57,354 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:03:57,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:03:57,356 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:57,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:03:57,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:03:57,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-25 18:03:57,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:03:57,557 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 18:03:57,594 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:03:57,597 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 18:03:57,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:03:57,647 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 18:03:57,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:03:57,909 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:03:57,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 18:03:57,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 18:03:58,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-25 18:03:58,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 18:03:58,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:03:58,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:03:58,601 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_303) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_304) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))) (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_303) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))) (bvule (bvadd .cse2 (_ bv4 32) .cse1) (bvadd .cse2 (_ bv8 32) .cse1)))))) is different from false [2022-11-25 18:03:58,671 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_303) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_303) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_304) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))) is different from false [2022-11-25 18:03:58,748 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_303) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_304) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_303) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-11-25 18:03:58,780 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:03:58,780 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2022-11-25 18:03:58,784 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 54 treesize of output 36 [2022-11-25 18:03:58,826 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:03:58,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-11-25 18:03:58,847 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:03:58,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-25 18:03:58,856 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:03:58,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-11-25 18:03:58,868 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:03:58,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-25 18:03:58,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-25 18:03:58,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:03:58,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1521341989] [2022-11-25 18:03:58,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1521341989] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:03:58,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:03:58,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2022-11-25 18:03:58,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321413054] [2022-11-25 18:03:58,992 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:03:58,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-25 18:03:58,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:03:58,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 18:03:58,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=124, Unknown=3, NotChecked=72, Total=240 [2022-11-25 18:03:58,993 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:04:04,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:04:04,997 INFO L93 Difference]: Finished difference Result 160 states and 174 transitions. [2022-11-25 18:04:04,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 18:04:04,998 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-25 18:04:04,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:04:04,999 INFO L225 Difference]: With dead ends: 160 [2022-11-25 18:04:04,999 INFO L226 Difference]: Without dead ends: 160 [2022-11-25 18:04:05,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=113, Invalid=358, Unknown=3, NotChecked=126, Total=600 [2022-11-25 18:04:05,001 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 78 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 292 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:04:05,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 679 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 479 Invalid, 2 Unknown, 292 Unchecked, 2.4s Time] [2022-11-25 18:04:05,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-25 18:04:05,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 110. [2022-11-25 18:04:05,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 109 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:04:05,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2022-11-25 18:04:05,005 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 18 [2022-11-25 18:04:05,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:04:05,005 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2022-11-25 18:04:05,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:04:05,006 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2022-11-25 18:04:05,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 18:04:05,006 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:04:05,007 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] [2022-11-25 18:04:05,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:04:05,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:04:05,219 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:04:05,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:04:05,220 INFO L85 PathProgramCache]: Analyzing trace with hash -10622392, now seen corresponding path program 1 times [2022-11-25 18:04:05,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:04:05,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652957201] [2022-11-25 18:04:05,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:04:05,220 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 18:04:05,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:04:05,222 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:04:05,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:04:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:04:05,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 18:04:05,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:04:05,368 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 18:04:05,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:04:05,552 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 11 [2022-11-25 18:04:05,569 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 18:04:05,569 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:04:05,569 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:04:05,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1652957201] [2022-11-25 18:04:05,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1652957201] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:04:05,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:04:05,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:04:05,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902346697] [2022-11-25 18:04:05,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:04:05,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:04:05,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:04:05,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:04:05,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:04:05,571 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:04:06,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:04:06,122 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2022-11-25 18:04:06,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:04:06,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-25 18:04:06,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:04:06,126 INFO L225 Difference]: With dead ends: 146 [2022-11-25 18:04:06,126 INFO L226 Difference]: Without dead ends: 146 [2022-11-25 18:04:06,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:04:06,127 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 133 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:04:06,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 160 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 18:04:06,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-25 18:04:06,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 110. [2022-11-25 18:04:06,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 109 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:04:06,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-11-25 18:04:06,132 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 20 [2022-11-25 18:04:06,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:04:06,132 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-11-25 18:04:06,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:04:06,133 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-11-25 18:04:06,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 18:04:06,133 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:04:06,133 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] [2022-11-25 18:04:06,147 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:04:06,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:04:06,346 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:04:06,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:04:06,347 INFO L85 PathProgramCache]: Analyzing trace with hash -10622391, now seen corresponding path program 1 times [2022-11-25 18:04:06,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:04:06,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806016094] [2022-11-25 18:04:06,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:04:06,347 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 18:04:06,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:04:06,349 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:04:06,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:04:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:04:06,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-25 18:04:06,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:04:06,482 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 18:04:06,667 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 11 treesize of output 7 [2022-11-25 18:04:06,677 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 11 treesize of output 7 [2022-11-25 18:04:06,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 18:04:06,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-25 18:04:06,826 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 18:04:06,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:04:06,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:04:06,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806016094] [2022-11-25 18:04:06,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806016094] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:04:06,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:04:06,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:04:06,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500117154] [2022-11-25 18:04:06,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:04:06,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:04:06,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:04:06,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:04:06,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:04:06,828 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:04:07,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:04:07,534 INFO L93 Difference]: Finished difference Result 203 states and 220 transitions. [2022-11-25 18:04:07,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:04:07,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-25 18:04:07,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:04:07,536 INFO L225 Difference]: With dead ends: 203 [2022-11-25 18:04:07,536 INFO L226 Difference]: Without dead ends: 203 [2022-11-25 18:04:07,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:04:07,537 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 165 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:04:07,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 187 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 18:04:07,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-11-25 18:04:07,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 113. [2022-11-25 18:04:07,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 86 states have (on average 1.441860465116279) internal successors, (124), 112 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:04:07,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 124 transitions. [2022-11-25 18:04:07,542 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 124 transitions. Word has length 20 [2022-11-25 18:04:07,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:04:07,542 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 124 transitions. [2022-11-25 18:04:07,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:04:07,542 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 124 transitions. [2022-11-25 18:04:07,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 18:04:07,543 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:04:07,543 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] [2022-11-25 18:04:07,553 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:04:07,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:04:07,751 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:04:07,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:04:07,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1375969503, now seen corresponding path program 1 times [2022-11-25 18:04:07,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:04:07,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548691099] [2022-11-25 18:04:07,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:04:07,752 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 18:04:07,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:04:07,753 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:04:07,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-25 18:04:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:04:07,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-25 18:04:07,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:04:07,898 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 18:04:07,943 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:04:07,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 18:04:08,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:04:08,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:04:08,263 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 19 treesize of output 18 [2022-11-25 18:04:08,274 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 18:04:08,519 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-25 18:04:08,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2022-11-25 18:04:08,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2022-11-25 18:04:08,621 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 18:04:08,622 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:04:08,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:04:08,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548691099] [2022-11-25 18:04:08,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [548691099] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:04:08,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:04:08,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 18:04:08,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455295630] [2022-11-25 18:04:08,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:04:08,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 18:04:08,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:04:08,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 18:04:08,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:04:08,624 INFO L87 Difference]: Start difference. First operand 113 states and 124 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:04:11,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:04:11,614 INFO L93 Difference]: Finished difference Result 261 states and 276 transitions. [2022-11-25 18:04:11,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-25 18:04:11,615 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 18:04:11,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:04:11,616 INFO L225 Difference]: With dead ends: 261 [2022-11-25 18:04:11,616 INFO L226 Difference]: Without dead ends: 261 [2022-11-25 18:04:11,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=202, Invalid=554, Unknown=0, NotChecked=0, Total=756 [2022-11-25 18:04:11,618 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 509 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:04:11,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 439 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-25 18:04:11,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-11-25 18:04:11,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 128. [2022-11-25 18:04:11,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 101 states have (on average 1.386138613861386) internal successors, (140), 127 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:04:11,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2022-11-25 18:04:11,622 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 23 [2022-11-25 18:04:11,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:04:11,623 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2022-11-25 18:04:11,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:04:11,623 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2022-11-25 18:04:11,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 18:04:11,624 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:04:11,624 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:04:11,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-25 18:04:11,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:04:11,825 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:04:11,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:04:11,825 INFO L85 PathProgramCache]: Analyzing trace with hash 382685369, now seen corresponding path program 2 times [2022-11-25 18:04:11,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:04:11,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [608844984] [2022-11-25 18:04:11,826 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:04:11,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:04:11,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:04:11,828 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:04:11,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:04:12,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:04:12,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:04:12,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-25 18:04:12,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:04:12,063 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 18:04:12,091 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:04:12,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 18:04:12,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:04:12,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:04:12,151 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 18:04:12,383 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:04:12,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 18:04:12,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 18:04:12,629 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 68 treesize of output 64 [2022-11-25 18:04:12,657 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:04:12,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 55 [2022-11-25 18:04:12,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-25 18:04:12,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 18:04:12,861 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:04:12,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:04:15,744 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (and (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_444))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse2 (bvadd (_ bv8 32) .cse0 .cse1))) (or (not (bvule (bvadd (_ bv4 32) .cse0 .cse1) .cse2)) (forall ((v_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_445))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (or (not (bvule .cse2 (select |c_#length| .cse3))) (forall ((v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store .cse4 .cse3 v_ArrVal_447) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse3 v_ArrVal_446) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))))))))))))) (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_444))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse9 (bvadd (_ bv8 32) .cse8 .cse1))) (or (not (bvule (bvadd (_ bv4 32) .cse8 .cse1) .cse9)) (forall ((v_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select (select (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_445) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (or (forall ((v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select (select (store .cse11 .cse12 v_ArrVal_447) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (bvule (bvadd (_ bv8 32) .cse10 .cse1) (bvadd .cse10 .cse1 (_ bv12 32))))) (not (bvule .cse9 (select |c_#length| .cse12)))))))))))))) is different from false [2022-11-25 18:04:16,000 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (and (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_444))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse1 (bvadd (_ bv8 32) .cse0))) (or (not (bvule (bvadd (_ bv4 32) .cse0) .cse1)) (forall ((v_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_445))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (forall ((v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store .cse2 .cse3 v_ArrVal_447) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_446) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))) (not (bvule .cse1 (select |c_#length| .cse3)))))))))))) (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_444))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse8 (bvadd (_ bv8 32) .cse7))) (or (not (bvule (bvadd (_ bv4 32) .cse7) .cse8)) (forall ((v_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_445) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (forall ((v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (select (store .cse10 .cse11 v_ArrVal_447) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (bvule (bvadd (_ bv8 32) .cse9) (bvadd .cse9 (_ bv12 32))))) (not (bvule .cse8 (select |c_#length| .cse11)))))))))))))) is different from false [2022-11-25 18:04:16,058 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:04:16,059 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 152 [2022-11-25 18:04:16,084 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:04:16,085 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 86 [2022-11-25 18:04:16,101 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 730 treesize of output 610 [2022-11-25 18:04:16,115 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 2320 treesize of output 2146 [2022-11-25 18:04:16,188 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 2030 treesize of output 1870 [2022-11-25 18:04:16,231 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 1667 treesize of output 1587 [2022-11-25 18:04:16,263 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 1876 treesize of output 1572 [2022-11-25 18:04:16,302 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 1510 treesize of output 1350 [2022-11-25 18:04:48,377 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:04:48,377 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 142 [2022-11-25 18:04:48,429 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:04:48,429 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 86 [2022-11-25 18:04:48,447 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 156 treesize of output 132 [2022-11-25 18:04:48,463 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 422 treesize of output 356 [2022-11-25 18:04:48,504 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 281 treesize of output 249 [2022-11-25 18:04:48,526 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 216 treesize of output 176 [2022-11-25 18:04:48,549 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 251 treesize of output 219 [2022-11-25 18:05:25,809 WARN L233 SmtUtils]: Spent 32.81s on a formula simplification. DAG size of input: 131 DAG size of output: 68 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:05:26,303 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:05:26,304 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 243 treesize of output 306 [2022-11-25 18:05:29,994 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-25 18:05:29,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:05:29,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [608844984] [2022-11-25 18:05:29,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [608844984] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:05:29,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:05:29,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2022-11-25 18:05:29,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322496273] [2022-11-25 18:05:29,995 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:05:29,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-25 18:05:29,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:05:29,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-25 18:05:29,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=8, NotChecked=70, Total=420 [2022-11-25 18:05:29,997 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand has 21 states, 20 states have (on average 1.95) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:05:49,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:05:49,877 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse7 (bvadd (_ bv8 32) .cse1 .cse6)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse0 (bvule .cse7 (select |c_#length| .cse3))) (.cse5 (bvule (bvadd (_ bv4 32) .cse1 .cse6) .cse7))) (and .cse0 (or (and (forall ((v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_447) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (bvule (bvadd (_ bv8 32) .cse1 .cse2) (bvadd .cse1 .cse2 (_ bv12 32))))) (forall ((v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_447) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_446) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))))) (not .cse0) (not .cse5)) .cse5))))) is different from false [2022-11-25 18:05:50,673 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse7 (bvadd (_ bv4 32) .cse2 .cse6)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse0 (bvule .cse7 (select |c_#length| .cse3))) (.cse1 (bvule (bvadd .cse2 .cse6) .cse7))) (and .cse0 (or (not .cse0) (not .cse1) (and (forall ((v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) .cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_447) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_446) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))) (forall ((v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_447) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) .cse2 .cse5) (bvadd (_ bv8 32) .cse2 .cse5)))))) .cse1))))) is different from false [2022-11-25 18:05:50,753 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (let ((.cse5 (bvadd (_ bv4 32) .cse2 |c_ULTIMATE.start_create_data_#t~mem8#1.offset|))) (let ((.cse1 (bvule (bvadd .cse2 |c_ULTIMATE.start_create_data_#t~mem8#1.offset|) .cse5)) (.cse0 (bvule .cse5 (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem8#1.base|)))) (and .cse0 .cse1 (or (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_447) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) .cse2 .cse3) (bvadd (_ bv8 32) .cse2 .cse3)))) (forall ((v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) .cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_447) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_446) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))))) (not .cse1) (not .cse0)))))) is different from false [2022-11-25 18:06:02,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:06:02,036 INFO L93 Difference]: Finished difference Result 182 states and 195 transitions. [2022-11-25 18:06:02,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:06:02,037 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 18:06:02,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:06:02,038 INFO L225 Difference]: With dead ends: 182 [2022-11-25 18:06:02,038 INFO L226 Difference]: Without dead ends: 182 [2022-11-25 18:06:02,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 50.0s TimeCoverageRelationStatistics Valid=194, Invalid=744, Unknown=12, NotChecked=310, Total=1260 [2022-11-25 18:06:02,040 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 83 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 219 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:06:02,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 800 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 928 Invalid, 1 Unknown, 219 Unchecked, 20.2s Time] [2022-11-25 18:06:02,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-11-25 18:06:02,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 143. [2022-11-25 18:06:02,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 116 states have (on average 1.353448275862069) internal successors, (157), 142 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:02,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 157 transitions. [2022-11-25 18:06:02,046 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 157 transitions. Word has length 23 [2022-11-25 18:06:02,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:06:02,046 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 157 transitions. [2022-11-25 18:06:02,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:02,047 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 157 transitions. [2022-11-25 18:06:02,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 18:06:02,048 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:06:02,048 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] [2022-11-25 18:06:02,072 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-11-25 18:06:02,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:06:02,263 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:06:02,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:02,264 INFO L85 PathProgramCache]: Analyzing trace with hash -543267076, now seen corresponding path program 1 times [2022-11-25 18:06:02,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:06:02,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864010749] [2022-11-25 18:06:02,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:02,264 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 18:06:02,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:06:02,265 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:06:02,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-25 18:06:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:02,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 18:06:02,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:06:02,831 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 11 treesize of output 7 [2022-11-25 18:06:03,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 18:06:03,175 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 18:06:03,175 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:06:03,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:06:03,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1864010749] [2022-11-25 18:06:03,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1864010749] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:03,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:03,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:06:03,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125563563] [2022-11-25 18:06:03,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:03,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:06:03,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:06:03,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:06:03,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:06:03,177 INFO L87 Difference]: Start difference. First operand 143 states and 157 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:04,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:06:04,205 INFO L93 Difference]: Finished difference Result 177 states and 190 transitions. [2022-11-25 18:06:04,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:06:04,206 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-25 18:06:04,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:06:04,207 INFO L225 Difference]: With dead ends: 177 [2022-11-25 18:06:04,207 INFO L226 Difference]: Without dead ends: 177 [2022-11-25 18:06:04,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:06:04,208 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 156 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:06:04,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 169 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 18:06:04,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-11-25 18:06:04,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 155. [2022-11-25 18:06:04,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 128 states have (on average 1.421875) internal successors, (182), 154 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:04,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 182 transitions. [2022-11-25 18:06:04,213 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 182 transitions. Word has length 25 [2022-11-25 18:06:04,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:06:04,215 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 182 transitions. [2022-11-25 18:06:04,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:04,215 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 182 transitions. [2022-11-25 18:06:04,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 18:06:04,216 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:06:04,216 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] [2022-11-25 18:06:04,240 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-11-25 18:06:04,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:06:04,427 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:06:04,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:04,427 INFO L85 PathProgramCache]: Analyzing trace with hash 338589996, now seen corresponding path program 1 times [2022-11-25 18:06:04,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:06:04,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [945824702] [2022-11-25 18:06:04,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:04,428 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 18:06:04,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:06:04,429 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:06:04,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:06:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:04,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 18:06:04,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:06:05,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:06:05,587 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 18:06:05,737 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 18:06:05,737 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:06:05,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:06:05,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [945824702] [2022-11-25 18:06:05,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [945824702] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:05,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:05,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:06:05,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775367828] [2022-11-25 18:06:05,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:05,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:06:05,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:06:05,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:06:05,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:06:05,739 INFO L87 Difference]: Start difference. First operand 155 states and 182 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:07,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:06:07,113 INFO L93 Difference]: Finished difference Result 178 states and 191 transitions. [2022-11-25 18:06:07,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:06:07,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-25 18:06:07,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:06:07,115 INFO L225 Difference]: With dead ends: 178 [2022-11-25 18:06:07,115 INFO L226 Difference]: Without dead ends: 178 [2022-11-25 18:06:07,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:06:07,116 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 248 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:06:07,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 144 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-25 18:06:07,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-11-25 18:06:07,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 156. [2022-11-25 18:06:07,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 129 states have (on average 1.4186046511627908) internal successors, (183), 155 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:07,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 183 transitions. [2022-11-25 18:06:07,121 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 183 transitions. Word has length 26 [2022-11-25 18:06:07,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:06:07,122 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 183 transitions. [2022-11-25 18:06:07,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:07,122 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 183 transitions. [2022-11-25 18:06:07,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 18:06:07,122 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:06:07,122 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] [2022-11-25 18:06:07,135 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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)] Ended with exit code 0 [2022-11-25 18:06:07,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:06:07,331 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:06:07,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:07,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1906355454, now seen corresponding path program 1 times [2022-11-25 18:06:07,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:06:07,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127653520] [2022-11-25 18:06:07,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:07,332 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 18:06:07,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:06:07,333 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:06:07,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:06:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:07,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 18:06:07,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:06:07,453 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 18:06:07,832 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 11 treesize of output 7 [2022-11-25 18:06:08,041 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 11 [2022-11-25 18:06:08,122 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 18:06:08,122 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:06:08,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:06:08,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [127653520] [2022-11-25 18:06:08,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [127653520] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:08,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:08,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:06:08,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139027370] [2022-11-25 18:06:08,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:08,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:06:08,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:06:08,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:06:08,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:06:08,126 INFO L87 Difference]: Start difference. First operand 156 states and 183 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:09,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:06:09,478 INFO L93 Difference]: Finished difference Result 177 states and 195 transitions. [2022-11-25 18:06:09,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:06:09,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-25 18:06:09,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:06:09,480 INFO L225 Difference]: With dead ends: 177 [2022-11-25 18:06:09,480 INFO L226 Difference]: Without dead ends: 177 [2022-11-25 18:06:09,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:06:09,481 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 78 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:06:09,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 164 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-25 18:06:09,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-11-25 18:06:09,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 159. [2022-11-25 18:06:09,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 132 states have (on average 1.4090909090909092) internal successors, (186), 158 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:09,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 186 transitions. [2022-11-25 18:06:09,487 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 186 transitions. Word has length 27 [2022-11-25 18:06:09,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:06:09,488 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 186 transitions. [2022-11-25 18:06:09,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:09,488 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 186 transitions. [2022-11-25 18:06:09,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 18:06:09,489 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:06:09,489 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] [2022-11-25 18:06:09,507 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-11-25 18:06:09,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:06:09,703 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:06:09,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:09,704 INFO L85 PathProgramCache]: Analyzing trace with hash -2126823547, now seen corresponding path program 1 times [2022-11-25 18:06:09,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:06:09,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [578545177] [2022-11-25 18:06:09,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:09,704 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 18:06:09,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:06:09,705 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:06:09,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-11-25 18:06:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:09,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-25 18:06:09,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:06:10,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 18:06:10,970 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 11 treesize of output 7 [2022-11-25 18:06:11,384 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 18:06:11,384 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 1 case distinctions, treesize of input 23 treesize of output 26 [2022-11-25 18:06:11,453 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 11 treesize of output 7 [2022-11-25 18:06:12,075 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 18:06:12,300 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:06:12,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 29 [2022-11-25 18:06:12,589 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 18:06:12,589 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:06:12,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:06:12,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [578545177] [2022-11-25 18:06:12,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [578545177] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:12,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:12,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 18:06:12,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874981495] [2022-11-25 18:06:12,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:12,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 18:06:12,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:06:12,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 18:06:12,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:06:12,592 INFO L87 Difference]: Start difference. First operand 159 states and 186 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:19,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:06:19,028 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2022-11-25 18:06:19,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:06:19,029 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-25 18:06:19,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:06:19,030 INFO L225 Difference]: With dead ends: 191 [2022-11-25 18:06:19,031 INFO L226 Difference]: Without dead ends: 191 [2022-11-25 18:06:19,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2022-11-25 18:06:19,032 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 318 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-11-25 18:06:19,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 404 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-11-25 18:06:19,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-11-25 18:06:19,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 164. [2022-11-25 18:06:19,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 138 states have (on average 1.3985507246376812) internal successors, (193), 163 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:19,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 193 transitions. [2022-11-25 18:06:19,038 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 193 transitions. Word has length 27 [2022-11-25 18:06:19,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:06:19,038 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 193 transitions. [2022-11-25 18:06:19,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:19,039 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 193 transitions. [2022-11-25 18:06:19,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 18:06:19,039 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:06:19,040 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] [2022-11-25 18:06:19,055 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-11-25 18:06:19,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:06:19,243 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:06:19,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:19,244 INFO L85 PathProgramCache]: Analyzing trace with hash -2126823546, now seen corresponding path program 1 times [2022-11-25 18:06:19,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:06:19,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289924640] [2022-11-25 18:06:19,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:19,244 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 18:06:19,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:06:19,245 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:06:19,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:06:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:19,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-25 18:06:19,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:06:19,448 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 18:06:19,586 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:06:19,586 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 18:06:19,832 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 18:06:20,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:06:20,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:06:20,926 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 19 treesize of output 18 [2022-11-25 18:06:20,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-25 18:06:21,586 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-25 18:06:21,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 38 [2022-11-25 18:06:21,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2022-11-25 18:06:21,939 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 18:06:21,939 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:06:21,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:06:21,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289924640] [2022-11-25 18:06:21,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1289924640] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:21,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:21,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 18:06:21,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149167461] [2022-11-25 18:06:21,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:21,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 18:06:21,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:06:21,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 18:06:21,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:06:21,942 INFO L87 Difference]: Start difference. First operand 164 states and 193 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:31,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:06:31,793 INFO L93 Difference]: Finished difference Result 282 states and 313 transitions. [2022-11-25 18:06:31,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-25 18:06:31,795 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-25 18:06:31,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:06:31,796 INFO L225 Difference]: With dead ends: 282 [2022-11-25 18:06:31,796 INFO L226 Difference]: Without dead ends: 282 [2022-11-25 18:06:31,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=218, Invalid=538, Unknown=0, NotChecked=0, Total=756 [2022-11-25 18:06:31,797 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 664 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-11-25 18:06:31,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 449 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-11-25 18:06:31,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-11-25 18:06:31,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 174. [2022-11-25 18:06:31,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 148 states have (on average 1.4054054054054055) internal successors, (208), 173 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:31,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 208 transitions. [2022-11-25 18:06:31,803 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 208 transitions. Word has length 27 [2022-11-25 18:06:31,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:06:31,803 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 208 transitions. [2022-11-25 18:06:31,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:31,804 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 208 transitions. [2022-11-25 18:06:31,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 18:06:31,804 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:06:31,804 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] [2022-11-25 18:06:31,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:06:32,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:06:32,023 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:06:32,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:32,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1032522897, now seen corresponding path program 1 times [2022-11-25 18:06:32,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:06:32,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066238347] [2022-11-25 18:06:32,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:32,024 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 18:06:32,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:06:32,025 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:06:32,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-11-25 18:06:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:32,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-25 18:06:32,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:06:33,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:06:33,189 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 11 treesize of output 7 [2022-11-25 18:06:33,674 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 18:06:34,598 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:06:34,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 18 [2022-11-25 18:06:34,823 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 0 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 18:06:34,885 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 18:06:34,885 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:06:34,885 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:06:34,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066238347] [2022-11-25 18:06:34,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1066238347] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:34,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:34,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 18:06:34,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379513537] [2022-11-25 18:06:34,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:34,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 18:06:34,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:06:34,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 18:06:34,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:06:34,888 INFO L87 Difference]: Start difference. First operand 174 states and 208 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:40,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:06:40,392 INFO L93 Difference]: Finished difference Result 198 states and 222 transitions. [2022-11-25 18:06:40,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 18:06:40,393 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-25 18:06:40,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:06:40,394 INFO L225 Difference]: With dead ends: 198 [2022-11-25 18:06:40,394 INFO L226 Difference]: Without dead ends: 198 [2022-11-25 18:06:40,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2022-11-25 18:06:40,395 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 272 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:06:40,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 294 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-25 18:06:40,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-11-25 18:06:40,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 175. [2022-11-25 18:06:40,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 149 states have (on average 1.4093959731543624) internal successors, (210), 174 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:40,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 210 transitions. [2022-11-25 18:06:40,400 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 210 transitions. Word has length 28 [2022-11-25 18:06:40,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:06:40,400 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 210 transitions. [2022-11-25 18:06:40,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:40,401 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 210 transitions. [2022-11-25 18:06:40,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 18:06:40,401 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:06:40,402 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] [2022-11-25 18:06:40,422 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-11-25 18:06:40,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:06:40,616 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:06:40,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:40,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1032522896, now seen corresponding path program 1 times [2022-11-25 18:06:40,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:06:40,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799095095] [2022-11-25 18:06:40,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:40,617 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 18:06:40,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:06:40,618 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:06:40,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:06:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:40,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 18:06:40,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:06:41,290 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 18:06:41,290 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:06:41,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:06:41,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799095095] [2022-11-25 18:06:41,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [799095095] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:41,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:41,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:06:41,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129249296] [2022-11-25 18:06:41,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:41,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:06:41,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:06:41,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:06:41,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:06:41,292 INFO L87 Difference]: Start difference. First operand 175 states and 210 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:41,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:06:41,621 INFO L93 Difference]: Finished difference Result 170 states and 202 transitions. [2022-11-25 18:06:41,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:06:41,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-25 18:06:41,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:06:41,625 INFO L225 Difference]: With dead ends: 170 [2022-11-25 18:06:41,625 INFO L226 Difference]: Without dead ends: 170 [2022-11-25 18:06:41,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:06:41,627 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 104 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:06:41,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 49 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 18:06:41,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-11-25 18:06:41,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2022-11-25 18:06:41,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 149 states have (on average 1.3557046979865772) internal successors, (202), 169 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:41,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 202 transitions. [2022-11-25 18:06:41,633 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 202 transitions. Word has length 28 [2022-11-25 18:06:41,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:06:41,634 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 202 transitions. [2022-11-25 18:06:41,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:41,634 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 202 transitions. [2022-11-25 18:06:41,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 18:06:41,635 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:06:41,635 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:41,648 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:06:41,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:06:41,848 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:06:41,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:41,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1614814932, now seen corresponding path program 1 times [2022-11-25 18:06:41,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:06:41,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1502873062] [2022-11-25 18:06:41,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:41,848 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 18:06:41,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:06:41,849 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:06:41,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:06:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:42,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 18:06:42,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:06:42,364 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:06:42,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:06:42,850 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:06:42,850 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:06:42,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1502873062] [2022-11-25 18:06:42,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1502873062] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:06:42,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:06:42,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-11-25 18:06:42,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679878547] [2022-11-25 18:06:42,851 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:06:42,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:06:42,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:06:42,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:06:42,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:06:42,853 INFO L87 Difference]: Start difference. First operand 170 states and 202 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:43,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:06:43,878 INFO L93 Difference]: Finished difference Result 185 states and 215 transitions. [2022-11-25 18:06:43,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 18:06:43,879 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-25 18:06:43,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:06:43,880 INFO L225 Difference]: With dead ends: 185 [2022-11-25 18:06:43,880 INFO L226 Difference]: Without dead ends: 185 [2022-11-25 18:06:43,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:06:43,881 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 30 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:06:43,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 517 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 18:06:43,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-25 18:06:43,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2022-11-25 18:06:43,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 162 states have (on average 1.3271604938271604) internal successors, (215), 182 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:43,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 215 transitions. [2022-11-25 18:06:43,888 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 215 transitions. Word has length 30 [2022-11-25 18:06:43,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:06:43,889 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 215 transitions. [2022-11-25 18:06:43,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:43,889 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 215 transitions. [2022-11-25 18:06:43,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 18:06:43,890 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:06:43,890 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 18:06:43,905 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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)] Ended with exit code 0 [2022-11-25 18:06:44,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:06:44,105 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:06:44,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:44,106 INFO L85 PathProgramCache]: Analyzing trace with hash -842646633, now seen corresponding path program 1 times [2022-11-25 18:06:44,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:06:44,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1943437481] [2022-11-25 18:06:44,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:44,106 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 18:06:44,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:06:44,108 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:06:44,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-11-25 18:06:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:44,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-25 18:06:44,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:06:44,360 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 18:06:44,474 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:06:44,475 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 18:06:45,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:06:45,802 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 19 treesize of output 18 [2022-11-25 18:06:45,831 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 11 treesize of output 7 [2022-11-25 18:06:46,168 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 15 [2022-11-25 18:06:46,370 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:06:46,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 14 [2022-11-25 18:06:46,690 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 18:06:46,690 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:06:46,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:06:46,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1943437481] [2022-11-25 18:06:46,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1943437481] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:46,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:46,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 18:06:46,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543248714] [2022-11-25 18:06:46,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:46,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 18:06:46,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:06:46,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 18:06:46,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:06:46,692 INFO L87 Difference]: Start difference. First operand 183 states and 215 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:59,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:07:00,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:07:00,091 INFO L93 Difference]: Finished difference Result 284 states and 304 transitions. [2022-11-25 18:07:00,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-25 18:07:00,094 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-25 18:07:00,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:07:00,095 INFO L225 Difference]: With dead ends: 284 [2022-11-25 18:07:00,095 INFO L226 Difference]: Without dead ends: 284 [2022-11-25 18:07:00,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=251, Invalid=679, Unknown=0, NotChecked=0, Total=930 [2022-11-25 18:07:00,096 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 617 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:07:00,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 458 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2022-11-25 18:07:00,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-11-25 18:07:00,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 183. [2022-11-25 18:07:00,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 162 states have (on average 1.3148148148148149) internal successors, (213), 182 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:00,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 213 transitions. [2022-11-25 18:07:00,102 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 213 transitions. Word has length 30 [2022-11-25 18:07:00,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:07:00,102 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 213 transitions. [2022-11-25 18:07:00,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:00,103 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 213 transitions. [2022-11-25 18:07:00,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 18:07:00,104 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:07:00,104 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 18:07:00,129 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-11-25 18:07:00,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:07:00,305 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:07:00,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:07:00,305 INFO L85 PathProgramCache]: Analyzing trace with hash -842657618, now seen corresponding path program 1 times [2022-11-25 18:07:00,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:07:00,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382316105] [2022-11-25 18:07:00,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:07:00,306 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 18:07:00,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:07:00,309 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:07:00,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:07:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:00,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-25 18:07:00,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:07:00,619 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 18:07:00,860 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 18:07:00,861 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 18:07:01,412 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-25 18:07:01,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 18:07:01,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 18:07:02,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:07:02,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:07:02,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:07:02,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:07:02,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-11-25 18:07:02,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:07:02,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 18:07:03,331 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 39 treesize of output 30 [2022-11-25 18:07:03,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2022-11-25 18:07:04,485 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-25 18:07:04,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 48 [2022-11-25 18:07:05,403 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-25 18:07:05,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 21 [2022-11-25 18:07:05,576 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 18:07:05,577 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:07:05,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:07:05,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382316105] [2022-11-25 18:07:05,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382316105] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:07:05,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:07:05,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-25 18:07:05,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880544809] [2022-11-25 18:07:05,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:07:05,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 18:07:05,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:07:05,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 18:07:05,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-11-25 18:07:05,579 INFO L87 Difference]: Start difference. First operand 183 states and 213 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:18,390 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 18:07:23,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:07:23,504 INFO L93 Difference]: Finished difference Result 324 states and 349 transitions. [2022-11-25 18:07:23,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-25 18:07:23,504 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-25 18:07:23,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:07:23,506 INFO L225 Difference]: With dead ends: 324 [2022-11-25 18:07:23,506 INFO L226 Difference]: Without dead ends: 324 [2022-11-25 18:07:23,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=316, Invalid=944, Unknown=0, NotChecked=0, Total=1260 [2022-11-25 18:07:23,507 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 802 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:07:23,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 828 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 665 Invalid, 1 Unknown, 0 Unchecked, 8.3s Time] [2022-11-25 18:07:23,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-11-25 18:07:23,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 183. [2022-11-25 18:07:23,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 162 states have (on average 1.308641975308642) internal successors, (212), 182 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:23,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 212 transitions. [2022-11-25 18:07:23,513 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 212 transitions. Word has length 30 [2022-11-25 18:07:23,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:07:23,514 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 212 transitions. [2022-11-25 18:07:23,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:23,514 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 212 transitions. [2022-11-25 18:07:23,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-25 18:07:23,515 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:07:23,515 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:07:23,539 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:07:23,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:07:23,728 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:07:23,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:07:23,729 INFO L85 PathProgramCache]: Analyzing trace with hash -352582234, now seen corresponding path program 1 times [2022-11-25 18:07:23,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:07:23,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862611634] [2022-11-25 18:07:23,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:07:23,729 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 18:07:23,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:07:23,730 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:07:23,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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)] Waiting until timeout for monitored process [2022-11-25 18:07:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:23,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-25 18:07:23,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:07:23,998 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 18:07:24,210 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 18:07:24,211 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 18:07:24,759 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-25 18:07:24,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 18:07:25,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 18:07:25,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:07:25,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:07:25,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:07:25,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:07:25,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-11-25 18:07:26,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:07:26,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-25 18:07:26,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-25 18:07:26,700 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-25 18:07:26,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 40 [2022-11-25 18:07:28,762 INFO L321 Elim1Store]: treesize reduction 74, result has 3.9 percent of original size [2022-11-25 18:07:28,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 118 treesize of output 53 [2022-11-25 18:07:29,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 19 [2022-11-25 18:07:29,891 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 18:07:29,892 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:07:29,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:07:29,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1862611634] [2022-11-25 18:07:29,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1862611634] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:07:29,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:07:29,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-25 18:07:29,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016632730] [2022-11-25 18:07:29,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:07:29,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-25 18:07:29,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:07:29,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 18:07:29,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2022-11-25 18:07:29,894 INFO L87 Difference]: Start difference. First operand 183 states and 212 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:52,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:07:52,315 INFO L93 Difference]: Finished difference Result 316 states and 340 transitions. [2022-11-25 18:07:52,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-25 18:07:52,315 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-25 18:07:52,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:07:52,317 INFO L225 Difference]: With dead ends: 316 [2022-11-25 18:07:52,317 INFO L226 Difference]: Without dead ends: 314 [2022-11-25 18:07:52,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=380, Invalid=1180, Unknown=0, NotChecked=0, Total=1560 [2022-11-25 18:07:52,319 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 627 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:07:52,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 1019 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2022-11-25 18:07:52,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2022-11-25 18:07:52,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 178. [2022-11-25 18:07:52,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 157 states have (on average 1.2993630573248407) internal successors, (204), 177 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:52,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 204 transitions. [2022-11-25 18:07:52,324 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 204 transitions. Word has length 31 [2022-11-25 18:07:52,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:07:52,324 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 204 transitions. [2022-11-25 18:07:52,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:52,324 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 204 transitions. [2022-11-25 18:07:52,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 18:07:52,325 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:07:52,325 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:07:52,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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)] Forceful destruction successful, exit code 0 [2022-11-25 18:07:52,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:07:52,541 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:07:52,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:07:52,542 INFO L85 PathProgramCache]: Analyzing trace with hash -822688907, now seen corresponding path program 1 times [2022-11-25 18:07:52,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:07:52,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1872053678] [2022-11-25 18:07:52,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:07:52,542 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 18:07:52,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:07:52,543 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:07:52,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:07:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:52,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 18:07:52,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:07:53,470 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 11 treesize of output 7 [2022-11-25 18:07:54,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-11-25 18:08:02,310 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#list~0#1.base_21| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~mem21#1.base_9| (_ BitVec 32)) (v_ArrVal_965 (_ BitVec 1))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#list~0#1.base_21| v_ArrVal_965))) (and (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_#t~mem21#1.base_9|)) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#list~0#1.base_21|)) (= (store (store .cse0 |v_ULTIMATE.start_main_#t~mem21#1.base_9| (_ bv0 1)) |v_ULTIMATE.start_main_~#list~0#1.base_21| (_ bv0 1)) |c_#valid|)))) is different from true [2022-11-25 18:08:02,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:08:02,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:08:05,266 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 52 treesize of output 48 [2022-11-25 18:08:08,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:08:08,935 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:08:08,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1872053678] [2022-11-25 18:08:08,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1872053678] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:08:08,936 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:08:08,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2022-11-25 18:08:08,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601504871] [2022-11-25 18:08:08,936 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:08:08,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 18:08:08,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:08:08,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 18:08:08,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=117, Unknown=6, NotChecked=22, Total=182 [2022-11-25 18:08:08,940 INFO L87 Difference]: Start difference. First operand 178 states and 204 transitions. Second operand has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:08:11,029 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 18:08:16,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:08:16,017 INFO L93 Difference]: Finished difference Result 245 states and 275 transitions. [2022-11-25 18:08:16,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 18:08:16,019 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-25 18:08:16,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:08:16,019 INFO L225 Difference]: With dead ends: 245 [2022-11-25 18:08:16,019 INFO L226 Difference]: Without dead ends: 243 [2022-11-25 18:08:16,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 3 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=86, Invalid=254, Unknown=6, NotChecked=34, Total=380 [2022-11-25 18:08:16,020 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 168 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:08:16,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 338 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 294 Invalid, 1 Unknown, 114 Unchecked, 5.4s Time] [2022-11-25 18:08:16,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-11-25 18:08:16,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 206. [2022-11-25 18:08:16,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 185 states have (on average 1.2648648648648648) internal successors, (234), 205 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:08:16,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 234 transitions. [2022-11-25 18:08:16,026 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 234 transitions. Word has length 32 [2022-11-25 18:08:16,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:08:16,026 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 234 transitions. [2022-11-25 18:08:16,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:08:16,027 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 234 transitions. [2022-11-25 18:08:16,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 18:08:16,027 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:08:16,028 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2022-11-25 18:08:16,042 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:08:16,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:08:16,241 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:08:16,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:08:16,241 INFO L85 PathProgramCache]: Analyzing trace with hash -822688903, now seen corresponding path program 1 times [2022-11-25 18:08:16,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:08:16,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [555170418] [2022-11-25 18:08:16,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:08:16,242 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 18:08:16,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:08:16,243 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:08:16,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:08:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:08:16,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-25 18:08:16,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:08:17,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:08:17,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-25 18:08:17,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:08:17,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-25 18:08:17,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:08:17,776 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:08:17,874 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 18:08:17,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2022-11-25 18:08:17,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:08:17,962 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:08:18,061 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 18:08:18,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2022-11-25 18:08:18,598 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:08:18,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-11-25 18:08:18,641 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:08:18,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 33 [2022-11-25 18:08:21,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:08:21,953 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:08:22,075 INFO L321 Elim1Store]: treesize reduction 27, result has 37.2 percent of original size [2022-11-25 18:08:22,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 96 treesize of output 84 [2022-11-25 18:08:22,096 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:08:22,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 53 [2022-11-25 18:08:22,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-11-25 18:08:22,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2022-11-25 18:08:22,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:08:22,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:08:53,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:08:53,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:08:53,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [555170418] [2022-11-25 18:08:53,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [555170418] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:08:53,588 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:08:53,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2022-11-25 18:08:53,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314399530] [2022-11-25 18:08:53,589 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:08:53,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-25 18:08:53,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:08:53,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-25 18:08:53,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=778, Unknown=16, NotChecked=0, Total=930 [2022-11-25 18:08:53,591 INFO L87 Difference]: Start difference. First operand 206 states and 234 transitions. Second operand has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:08:55,631 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 18:08:58,039 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 18:09:01,399 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 18:09:19,641 WARN L233 SmtUtils]: Spent 12.35s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:09:21,971 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 [1] [2022-11-25 18:09:28,107 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 [1] [2022-11-25 18:09:29,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:09:31,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:09:34,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 [1] [2022-11-25 18:09:36,010 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 [1] [2022-11-25 18:09:38,021 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 [1] [2022-11-25 18:09:40,037 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 [1] [2022-11-25 18:09:42,048 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 [1] [2022-11-25 18:09:44,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:09:46,942 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 [1] [2022-11-25 18:09:48,955 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 [1] [2022-11-25 18:09:50,963 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 [1] [2022-11-25 18:09:52,971 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 [1] [2022-11-25 18:09:54,980 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 [1] [2022-11-25 18:10:10,365 WARN L233 SmtUtils]: Spent 14.43s on a formula simplification that was a NOOP. DAG size: 83 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:10:44,265 WARN L233 SmtUtils]: Spent 29.30s on a formula simplification that was a NOOP. DAG size: 90 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:11:03,436 WARN L233 SmtUtils]: Spent 16.44s on a formula simplification that was a NOOP. DAG size: 86 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:11:05,623 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 [1] [2022-11-25 18:11:07,631 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 [1] [2022-11-25 18:11:09,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:11:11,660 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 [1] [2022-11-25 18:11:13,674 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 [1] [2022-11-25 18:11:15,684 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 [1] [2022-11-25 18:11:17,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 [1] [2022-11-25 18:11:19,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:11:21,505 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 [1] [2022-11-25 18:11:39,301 WARN L233 SmtUtils]: Spent 14.64s on a formula simplification that was a NOOP. DAG size: 90 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:11:41,381 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 [1] [2022-11-25 18:11:43,389 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 [1] [2022-11-25 18:11:45,399 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 [1] [2022-11-25 18:11:47,410 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 [1] [2022-11-25 18:11:49,420 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 [1] [2022-11-25 18:11:51,431 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 [1] [2022-11-25 18:11:52,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:12:15,590 WARN L233 SmtUtils]: Spent 20.52s on a formula simplification that was a NOOP. DAG size: 93 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:12:33,575 WARN L233 SmtUtils]: Spent 16.22s on a formula simplification that was a NOOP. DAG size: 95 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:12:35,753 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 [1] [2022-11-25 18:12:37,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:12:56,618 WARN L233 SmtUtils]: Spent 16.58s on a formula simplification that was a NOOP. DAG size: 96 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:13:21,772 WARN L233 SmtUtils]: Spent 22.51s on a formula simplification that was a NOOP. DAG size: 90 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:13:25,991 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 [1] [2022-11-25 18:13:28,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:13:32,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:13:32,031 INFO L93 Difference]: Finished difference Result 213 states and 241 transitions. [2022-11-25 18:13:32,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-25 18:13:32,037 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-25 18:13:32,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:13:32,038 INFO L225 Difference]: With dead ends: 213 [2022-11-25 18:13:32,038 INFO L226 Difference]: Without dead ends: 196 [2022-11-25 18:13:32,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 218.0s TimeCoverageRelationStatistics Valid=302, Invalid=1482, Unknown=22, NotChecked=0, Total=1806 [2022-11-25 18:13:32,039 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 79 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 12 mSolverCounterUnsat, 35 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 91.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 35 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 92.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:13:32,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 914 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 479 Invalid, 35 Unknown, 0 Unchecked, 92.1s Time] [2022-11-25 18:13:32,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-11-25 18:13:32,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 189. [2022-11-25 18:13:32,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 168 states have (on average 1.2857142857142858) internal successors, (216), 188 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:13:32,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 216 transitions. [2022-11-25 18:13:32,042 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 216 transitions. Word has length 32 [2022-11-25 18:13:32,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:13:32,042 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 216 transitions. [2022-11-25 18:13:32,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:13:32,043 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 216 transitions. [2022-11-25 18:13:32,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-25 18:13:32,044 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:13:32,044 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:13:32,057 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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)] Ended with exit code 0 [2022-11-25 18:13:32,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:13:32,257 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:13:32,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:13:32,257 INFO L85 PathProgramCache]: Analyzing trace with hash 798159371, now seen corresponding path program 1 times [2022-11-25 18:13:32,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:13:32,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [249999470] [2022-11-25 18:13:32,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:13:32,258 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 18:13:32,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:13:32,259 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:13:32,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:13:32,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:32,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-25 18:13:32,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:13:32,479 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 18:13:32,571 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:13:32,571 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 18:13:33,103 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 18:13:33,103 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 18:13:33,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:13:34,142 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 20 treesize of output 19 [2022-11-25 18:13:34,170 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 11 treesize of output 7 [2022-11-25 18:13:34,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2022-11-25 18:13:34,795 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:13:34,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 15 [2022-11-25 18:13:35,244 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 14 treesize of output 20 [2022-11-25 18:13:35,271 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 18:13:35,272 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:13:35,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:13:35,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [249999470] [2022-11-25 18:13:35,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [249999470] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:13:35,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:13:35,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-25 18:13:35,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344866088] [2022-11-25 18:13:35,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:13:35,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 18:13:35,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:13:35,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 18:13:35,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:13:35,274 INFO L87 Difference]: Start difference. First operand 189 states and 216 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:13:41,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:13:41,479 INFO L93 Difference]: Finished difference Result 214 states and 231 transitions. [2022-11-25 18:13:41,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 18:13:41,480 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-25 18:13:41,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:13:41,482 INFO L225 Difference]: With dead ends: 214 [2022-11-25 18:13:41,482 INFO L226 Difference]: Without dead ends: 214 [2022-11-25 18:13:41,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2022-11-25 18:13:41,483 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 393 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:13:41,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 369 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-11-25 18:13:41,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-11-25 18:13:41,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 191. [2022-11-25 18:13:41,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 170 states have (on average 1.2823529411764707) internal successors, (218), 190 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:13:41,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 218 transitions. [2022-11-25 18:13:41,488 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 218 transitions. Word has length 33 [2022-11-25 18:13:41,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:13:41,488 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 218 transitions. [2022-11-25 18:13:41,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:13:41,488 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 218 transitions. [2022-11-25 18:13:41,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 18:13:41,489 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:13:41,489 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:13:41,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-11-25 18:13:41,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:13:41,690 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:13:41,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:13:41,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1995423857, now seen corresponding path program 1 times [2022-11-25 18:13:41,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:13:41,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663638470] [2022-11-25 18:13:41,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:13:41,690 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 18:13:41,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:13:41,691 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:13:41,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 (34)] Waiting until timeout for monitored process [2022-11-25 18:13:41,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:41,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-25 18:13:41,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:13:43,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:13:43,552 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 18:13:43,553 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 1 case distinctions, treesize of input 20 treesize of output 23 [2022-11-25 18:13:43,606 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 11 treesize of output 7 [2022-11-25 18:13:44,105 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 18:13:44,303 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:13:44,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2022-11-25 18:13:44,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:13:44,517 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:13:44,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:13:44,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663638470] [2022-11-25 18:13:44,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663638470] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:13:44,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:13:44,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-25 18:13:44,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363229400] [2022-11-25 18:13:44,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:13:44,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 18:13:44,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:13:44,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 18:13:44,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:13:44,519 INFO L87 Difference]: Start difference. First operand 191 states and 218 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:13:49,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:13:49,906 INFO L93 Difference]: Finished difference Result 278 states and 300 transitions. [2022-11-25 18:13:49,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:13:49,907 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-25 18:13:49,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:13:49,908 INFO L225 Difference]: With dead ends: 278 [2022-11-25 18:13:49,908 INFO L226 Difference]: Without dead ends: 278 [2022-11-25 18:13:49,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2022-11-25 18:13:49,910 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 516 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:13:49,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 562 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-25 18:13:49,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-11-25 18:13:49,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 191. [2022-11-25 18:13:49,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 170 states have (on average 1.2705882352941176) internal successors, (216), 190 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:13:49,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 216 transitions. [2022-11-25 18:13:49,915 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 216 transitions. Word has length 36 [2022-11-25 18:13:49,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:13:49,916 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 216 transitions. [2022-11-25 18:13:49,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:13:49,916 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 216 transitions. [2022-11-25 18:13:49,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 18:13:49,917 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:13:49,917 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:13:49,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 (34)] Forceful destruction successful, exit code 0 [2022-11-25 18:13:50,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:13:50,131 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:13:50,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:13:50,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1026976127, now seen corresponding path program 1 times [2022-11-25 18:13:50,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:13:50,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2098483934] [2022-11-25 18:13:50,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:13:50,131 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 18:13:50,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:13:50,132 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:13:50,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-11-25 18:13:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:50,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-25 18:13:50,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:13:50,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 18:13:50,671 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:13:50,672 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 18:13:51,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:13:51,405 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 11 treesize of output 7 [2022-11-25 18:13:51,580 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2022-11-25 18:13:51,581 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 1 case distinctions, treesize of input 24 treesize of output 35 [2022-11-25 18:13:52,225 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 44 treesize of output 32 [2022-11-25 18:13:53,495 INFO L321 Elim1Store]: treesize reduction 19, result has 50.0 percent of original size [2022-11-25 18:13:53,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 30 [2022-11-25 18:13:53,982 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-25 18:13:53,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 39 [2022-11-25 18:13:54,340 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 18:13:54,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:13:54,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:13:54,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2098483934] [2022-11-25 18:13:54,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2098483934] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:13:54,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:13:54,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-25 18:13:54,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818528781] [2022-11-25 18:13:54,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:13:54,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 18:13:54,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:13:54,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 18:13:54,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:13:54,342 INFO L87 Difference]: Start difference. First operand 191 states and 216 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:13:59,759 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 18:14:04,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:14:04,386 INFO L93 Difference]: Finished difference Result 253 states and 275 transitions. [2022-11-25 18:14:04,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:14:04,387 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-25 18:14:04,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:14:04,389 INFO L225 Difference]: With dead ends: 253 [2022-11-25 18:14:04,389 INFO L226 Difference]: Without dead ends: 253 [2022-11-25 18:14:04,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=139, Invalid=507, Unknown=4, NotChecked=0, Total=650 [2022-11-25 18:14:04,390 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 287 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 3 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:14:04,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 531 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 535 Invalid, 6 Unknown, 0 Unchecked, 6.6s Time] [2022-11-25 18:14:04,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-11-25 18:14:04,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 194. [2022-11-25 18:14:04,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 173 states have (on average 1.2658959537572254) internal successors, (219), 193 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:14:04,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 219 transitions. [2022-11-25 18:14:04,395 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 219 transitions. Word has length 36 [2022-11-25 18:14:04,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:14:04,396 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 219 transitions. [2022-11-25 18:14:04,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:14:04,396 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 219 transitions. [2022-11-25 18:14:04,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 18:14:04,397 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:14:04,397 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:14:04,411 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2022-11-25 18:14:04,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:14:04,607 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:14:04,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:14:04,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1771489038, now seen corresponding path program 1 times [2022-11-25 18:14:04,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:14:04,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1354795141] [2022-11-25 18:14:04,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:14:04,608 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 18:14:04,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:14:04,609 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:14:04,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 (36)] Waiting until timeout for monitored process [2022-11-25 18:14:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:14:04,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-25 18:14:04,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:14:05,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:14:05,751 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 11 treesize of output 7 [2022-11-25 18:14:06,134 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 18:14:06,807 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 14 treesize of output 13 [2022-11-25 18:14:07,038 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:14:07,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 20 [2022-11-25 18:14:07,455 INFO L321 Elim1Store]: treesize reduction 32, result has 27.3 percent of original size [2022-11-25 18:14:07,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 39 [2022-11-25 18:14:07,604 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 18:14:07,605 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:14:07,605 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:14:07,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1354795141] [2022-11-25 18:14:07,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1354795141] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:14:07,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:14:07,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 18:14:07,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318662459] [2022-11-25 18:14:07,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:14:07,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 18:14:07,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:14:07,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 18:14:07,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:14:07,607 INFO L87 Difference]: Start difference. First operand 194 states and 219 transitions. Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:14:09,636 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 18:14:11,920 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 18:14:13,976 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 18:14:16,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 18:14:18,134 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 18:14:24,024 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 18:14:27,032 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 18:14:27,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:14:27,476 INFO L93 Difference]: Finished difference Result 249 states and 268 transitions. [2022-11-25 18:14:27,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 18:14:27,477 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-25 18:14:27,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:14:27,478 INFO L225 Difference]: With dead ends: 249 [2022-11-25 18:14:27,478 INFO L226 Difference]: Without dead ends: 249 [2022-11-25 18:14:27,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2022-11-25 18:14:27,479 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 286 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 4 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:14:27,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 390 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 368 Invalid, 7 Unknown, 0 Unchecked, 17.4s Time] [2022-11-25 18:14:27,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-11-25 18:14:27,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 190. [2022-11-25 18:14:27,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 169 states have (on average 1.2781065088757397) internal successors, (216), 189 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:14:27,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 216 transitions. [2022-11-25 18:14:27,484 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 216 transitions. Word has length 37 [2022-11-25 18:14:27,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:14:27,485 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 216 transitions. [2022-11-25 18:14:27,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:14:27,485 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 216 transitions. [2022-11-25 18:14:27,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-25 18:14:27,486 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:14:27,486 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:14:27,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 (36)] Forceful destruction successful, exit code 0 [2022-11-25 18:14:27,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:14:27,702 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-25 18:14:27,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:14:27,703 INFO L85 PathProgramCache]: Analyzing trace with hash -220546803, now seen corresponding path program 3 times [2022-11-25 18:14:27,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:14:27,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [498217229] [2022-11-25 18:14:27,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 18:14:27,703 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:14:27,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:14:27,704 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/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 18:14:27,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c1c35e-cb4a-46ff-8322-911d7a3ae689/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-11-25 18:14:28,645 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-25 18:14:28,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:14:28,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-25 18:14:28,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:14:28,681 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 18:14:28,782 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:14:28,782 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 18:14:28,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:14:28,910 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 18:14:28,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:14:29,616 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:14:29,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 18:14:29,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 18:14:30,339 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 68 treesize of output 64 [2022-11-25 18:14:30,427 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:14:30,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 55 [2022-11-25 18:14:31,157 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 68 treesize of output 64 [2022-11-25 18:14:31,258 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:14:31,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 55 [2022-11-25 18:14:32,081 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:14:32,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 65 [2022-11-25 18:14:32,113 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 68 treesize of output 64 [2022-11-25 18:14:32,924 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:14:32,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 18:14:32,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 18:14:33,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-25 18:14:33,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 18:14:33,675 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:14:33,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:14:34,633 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_1346 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1346) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_1346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1347 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) .cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1346) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1347) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) is different from false [2022-11-25 18:14:34,728 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1346 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1346) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_1346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1347 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1346) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1347) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))) is different from false [2022-11-25 18:14:36,093 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (let ((.cse5 (bvadd (_ bv4 32) .cse2 |c_ULTIMATE.start_create_data_#t~mem8#1.offset|))) (or (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_1346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1344 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1345 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1344))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1345) .cse0 v_ArrVal_1346) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_1347) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1344 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1345 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1345) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1344) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) v_ArrVal_1346) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd .cse4 (_ bv8 32) .cse2) (bvadd .cse4 .cse2 (_ bv12 32))))))) (not (bvule (bvadd .cse2 |c_ULTIMATE.start_create_data_#t~mem8#1.offset|) .cse5)) (not (bvule .cse5 (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem8#1.base|))) (not (bvslt (bvadd |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv1 32)) (_ bv20 32)))))) is different from false [2022-11-25 18:14:37,433 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse0 (bvadd (_ bv8 32) .cse2 .cse3)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (or (not (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (_ bv20 32))) (not (bvule .cse0 (select |c_#length| .cse1))) (not (bvule (bvadd (_ bv4 32) .cse2 .cse3) .cse0)) (and (forall ((v_ArrVal_1346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1344 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1345 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1345) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1344) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5) v_ArrVal_1346) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (bvule (bvadd .cse2 .cse4 (_ bv12 32)) (bvadd (_ bv16 32) .cse2 .cse4)))) (forall ((v_ArrVal_1346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1344 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1345 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1344))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (bvule (bvadd (_ bv16 32) .cse2 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1345) .cse6 v_ArrVal_1346) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_1347) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))))))))))) is different from false [2022-11-25 18:14:45,174 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (let ((.cse0 (bvadd (_ bv8 32) .cse2 .cse3)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (or (not (bvule .cse0 (select |c_#length| .cse1))) (not (bvslt (bvadd (_ bv3 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (_ bv20 32))) (not (bvule (bvadd (_ bv4 32) .cse2 .cse3) .cse0)) (and (forall ((v_ArrVal_1343 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1343))) (let ((.cse11 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (let ((.cse10 (bvadd .cse11 .cse2 (_ bv12 32)))) (or (forall ((v_ArrVal_1342 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1342))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (or (forall ((v_ArrVal_1346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1344 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1345 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store .cse9 .cse5 v_ArrVal_1344))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (bvule (bvadd .cse2 (_ bv20 32) (select (select (store (store .cse4 .cse5 v_ArrVal_1345) .cse6 v_ArrVal_1346) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7)) (select |c_#length| (select (select (store .cse8 .cse6 v_ArrVal_1347) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7)))))) (not (bvule .cse10 (select |c_#length| .cse5))))))) (not (bvule (bvadd .cse11 (_ bv8 32) .cse2) .cse10))))))) (forall ((v_ArrVal_1343 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1343))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (let ((.cse13 (bvadd .cse12 .cse2 (_ bv12 32)))) (or (not (bvule (bvadd .cse12 (_ bv8 32) .cse2) .cse13)) (forall ((v_ArrVal_1342 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1342))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (or (forall ((v_ArrVal_1346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1344 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1345 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (select (select (store (store .cse15 .cse16 v_ArrVal_1345) (select (select (store .cse17 .cse16 v_ArrVal_1344) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7) v_ArrVal_1346) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (bvule (bvadd (_ bv16 32) .cse2 .cse14) (bvadd .cse2 (_ bv20 32) .cse14)))) (not (bvule .cse13 (select |c_#length| .cse16))))))))))))))))) is different from false [2022-11-25 18:14:53,357 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (let ((.cse0 (bvadd (_ bv4 32) .cse2 .cse3)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (or (not (bvule .cse0 (select |c_#length| .cse1))) (not (bvule (bvadd .cse2 .cse3) .cse0)) (not (bvslt (bvadd (_ bv3 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (_ bv20 32))) (and (forall ((v_ArrVal_1341 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1341))) (let ((.cse4 (select (select .cse16 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (let ((.cse5 (bvadd (_ bv8 32) .cse4 .cse2))) (or (not (bvule (bvadd (_ bv4 32) .cse4 .cse2) .cse5)) (forall ((v_ArrVal_1340 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1340))) (let ((.cse6 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (or (not (bvule .cse5 (select |c_#length| .cse6))) (forall ((v_ArrVal_1343 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store .cse16 .cse6 v_ArrVal_1343))) (let ((.cse15 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (let ((.cse13 (bvadd .cse15 .cse2 (_ bv12 32)))) (or (forall ((v_ArrVal_1342 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store .cse14 .cse6 v_ArrVal_1342))) (let ((.cse8 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (or (forall ((v_ArrVal_1346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1344 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1345 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store .cse12 .cse8 v_ArrVal_1344))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (bvule (bvadd .cse2 (select (select (store (store .cse7 .cse8 v_ArrVal_1345) .cse9 v_ArrVal_1346) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10) (_ bv20 32)) (select |c_#length| (select (select (store .cse11 .cse9 v_ArrVal_1347) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10)))))) (not (bvule .cse13 (select |c_#length| .cse8))))))) (not (bvule (bvadd (_ bv8 32) .cse15 .cse2) .cse13)))))))))))))))) (forall ((v_ArrVal_1341 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1341))) (let ((.cse17 (select (select .cse27 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (let ((.cse18 (bvadd (_ bv8 32) .cse17 .cse2))) (or (not (bvule (bvadd (_ bv4 32) .cse17 .cse2) .cse18)) (forall ((v_ArrVal_1340 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1340))) (let ((.cse19 (select (select .cse25 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (or (not (bvule .cse18 (select |c_#length| .cse19))) (forall ((v_ArrVal_1343 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store .cse27 .cse19 v_ArrVal_1343))) (let ((.cse26 (select (select .cse23 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (let ((.cse20 (bvadd .cse26 .cse2 (_ bv12 32)))) (or (forall ((v_ArrVal_1342 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store .cse25 .cse19 v_ArrVal_1342))) (let ((.cse21 (select (select .cse24 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (or (not (bvule .cse20 (select |c_#length| .cse21))) (forall ((v_ArrVal_1346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1344 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1345 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (select (select (store (store .cse23 .cse21 v_ArrVal_1345) (select (select (store .cse24 .cse21 v_ArrVal_1344) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10) v_ArrVal_1346) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (bvule (bvadd (_ bv16 32) .cse2 .cse22) (bvadd .cse2 .cse22 (_ bv20 32))))))))) (not (bvule (bvadd (_ bv8 32) .cse26 .cse2) .cse20))))))))))))))))))))) is different from false [2022-11-25 18:15:42,799 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse17 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (and (forall ((v_ArrVal_1338 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_$Pointer$.offset| .cse17 v_ArrVal_1338))) (let ((.cse18 (select (select .cse16 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (let ((.cse0 (bvadd .cse18 (_ bv8 32)))) (or (forall ((v_ArrVal_1339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_$Pointer$.base| .cse17 v_ArrVal_1339))) (let ((.cse1 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (or (not (bvule .cse0 (select |c_#length| .cse1))) (forall ((v_ArrVal_1341 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store .cse16 .cse1 v_ArrVal_1341))) (let ((.cse15 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (let ((.cse2 (bvadd .cse15 (_ bv12 32)))) (or (forall ((v_ArrVal_1340 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store .cse14 .cse1 v_ArrVal_1340))) (let ((.cse3 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (or (not (bvule .cse2 (select |c_#length| .cse3))) (forall ((v_ArrVal_1343 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store .cse13 .cse3 v_ArrVal_1343))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (let ((.cse5 (bvadd (_ bv16 32) .cse4))) (or (not (bvule (bvadd .cse4 (_ bv12 32)) .cse5)) (forall ((v_ArrVal_1342 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store .cse12 .cse3 v_ArrVal_1342))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (or (not (bvule .cse5 (select |c_#length| .cse6))) (forall ((v_ArrVal_1346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1344 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1345 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_1344))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (bvule (bvadd (select (select (store (store .cse7 .cse6 v_ArrVal_1345) .cse8 v_ArrVal_1346) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9) (_ bv24 32)) (select |c_#length| (select (select (store .cse10 .cse8 v_ArrVal_1347) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))))))))))))))))))) (not (bvule (bvadd .cse15 (_ bv8 32)) .cse2))))))))))) (not (bvule (bvadd .cse18 (_ bv4 32)) .cse0))))))) (forall ((v_ArrVal_1338 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse33 (store |c_#memory_$Pointer$.offset| .cse17 v_ArrVal_1338))) (let ((.cse34 (select (select .cse33 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (let ((.cse19 (bvadd .cse34 (_ bv8 32)))) (or (forall ((v_ArrVal_1339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (store |c_#memory_$Pointer$.base| .cse17 v_ArrVal_1339))) (let ((.cse20 (select (select .cse31 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (or (not (bvule .cse19 (select |c_#length| .cse20))) (forall ((v_ArrVal_1341 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (store .cse33 .cse20 v_ArrVal_1341))) (let ((.cse32 (select (select .cse30 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (let ((.cse21 (bvadd .cse32 (_ bv12 32)))) (or (forall ((v_ArrVal_1340 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store .cse31 .cse20 v_ArrVal_1340))) (let ((.cse22 (select (select .cse29 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (or (not (bvule .cse21 (select |c_#length| .cse22))) (forall ((v_ArrVal_1343 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (store .cse30 .cse22 v_ArrVal_1343))) (let ((.cse23 (select (select .cse26 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (let ((.cse24 (bvadd (_ bv16 32) .cse23))) (or (not (bvule (bvadd .cse23 (_ bv12 32)) .cse24)) (forall ((v_ArrVal_1342 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (store .cse29 .cse22 v_ArrVal_1342))) (let ((.cse27 (select (select .cse28 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (or (forall ((v_ArrVal_1346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1344 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1345 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (select (select (store (store .cse26 .cse27 v_ArrVal_1345) (select (select (store .cse28 .cse27 v_ArrVal_1344) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9) v_ArrVal_1346) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (bvule (bvadd .cse25 (_ bv20 32)) (bvadd .cse25 (_ bv24 32))))) (not (bvule .cse24 (select |c_#length| .cse27)))))))))))))))) (not (bvule (bvadd .cse32 (_ bv8 32)) .cse21))))))))))) (not (bvule (bvadd .cse34 (_ bv4 32)) .cse19)))))))))) is different from false [2022-11-25 18:15:43,318 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:15:43,318 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 1334 treesize of output 1234 [2022-11-25 18:15:43,434 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:15:43,434 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 1198 treesize of output 718 [2022-11-25 18:15:43,649 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 1298290 treesize of output 1045936 [2022-11-25 18:15:48,169 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 16325724 treesize of output 15959634 [2022-11-25 18:16:26,802 WARN L233 SmtUtils]: Spent 38.63s on a formula simplification that was a NOOP. DAG size: 5176 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 18:17:04,724 WARN L233 SmtUtils]: Spent 37.91s on a formula simplification that was a NOOP. DAG size: 5173 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 18:17:05,045 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 15959596 treesize of output 15313212 [2022-11-25 18:17:49,729 WARN L233 SmtUtils]: Spent 44.68s on a formula simplification that was a NOOP. DAG size: 5172 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 18:17:50,099 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 15299694 treesize of output 14540910