./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/20020406-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/20020406-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN --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 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae --- 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-6b4ec56 [2022-11-20 10:39:16,994 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:39:16,997 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:39:17,036 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:39:17,037 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:39:17,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:39:17,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:39:17,046 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:39:17,049 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:39:17,054 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:39:17,056 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:39:17,057 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:39:17,057 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:39:17,058 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:39:17,060 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:39:17,061 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:39:17,062 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:39:17,063 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:39:17,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:39:17,075 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:39:17,078 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:39:17,080 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:39:17,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:39:17,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:39:17,094 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:39:17,094 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:39:17,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:39:17,097 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:39:17,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:39:17,098 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:39:17,098 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:39:17,099 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:39:17,101 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:39:17,103 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:39:17,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:39:17,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:39:17,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:39:17,106 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:39:17,106 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:39:17,107 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:39:17,108 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:39:17,109 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-20 10:39:17,153 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:39:17,153 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:39:17,154 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:39:17,154 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:39:17,155 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:39:17,155 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:39:17,156 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:39:17,156 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:39:17,157 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:39:17,157 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:39:17,158 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:39:17,158 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:39:17,159 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:39:17,159 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:39:17,159 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:39:17,159 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 10:39:17,159 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 10:39:17,160 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 10:39:17,160 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:39:17,160 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 10:39:17,160 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:39:17,161 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:39:17,161 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:39:17,161 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:39:17,161 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:39:17,161 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:39:17,162 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:39:17,162 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:39:17,162 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:39:17,162 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:39:17,163 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/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_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN 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 -> 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae [2022-11-20 10:39:17,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:39:17,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:39:17,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:39:17,540 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:39:17,541 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:39:17,542 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/memsafety/20020406-1.i [2022-11-20 10:39:20,817 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:39:21,248 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:39:21,254 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/sv-benchmarks/c/memsafety/20020406-1.i [2022-11-20 10:39:21,272 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/data/adce514ce/f74a9bcd2faa497abc0f6e62647c02b4/FLAGf25f071de [2022-11-20 10:39:21,289 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/data/adce514ce/f74a9bcd2faa497abc0f6e62647c02b4 [2022-11-20 10:39:21,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:39:21,293 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:39:21,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:39:21,295 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:39:21,300 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:39:21,301 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:39:21" (1/1) ... [2022-11-20 10:39:21,302 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55943369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:39:21, skipping insertion in model container [2022-11-20 10:39:21,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:39:21" (1/1) ... [2022-11-20 10:39:21,313 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:39:21,385 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:39:21,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:39:21,971 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-20 10:39:21,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@18afa927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:39:21, skipping insertion in model container [2022-11-20 10:39:21,972 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:39:21,972 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-20 10:39:21,974 INFO L158 Benchmark]: Toolchain (without parser) took 680.10ms. Allocated memory is still 167.8MB. Free memory was 134.2MB in the beginning and 119.2MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-20 10:39:21,975 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 121.6MB. Free memory was 86.3MB in the beginning and 86.3MB in the end (delta: 26.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:39:21,976 INFO L158 Benchmark]: CACSL2BoogieTranslator took 677.17ms. Allocated memory is still 167.8MB. Free memory was 133.9MB in the beginning and 119.7MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-20 10:39:21,978 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 121.6MB. Free memory was 86.3MB in the beginning and 86.3MB in the end (delta: 26.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 677.17ms. Allocated memory is still 167.8MB. Free memory was 133.9MB in the beginning and 119.7MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 897]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/20020406-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN --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 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae --- 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-6b4ec56 [2022-11-20 10:39:24,483 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:39:24,486 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:39:24,532 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:39:24,532 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:39:24,537 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:39:24,541 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:39:24,545 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:39:24,547 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:39:24,548 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:39:24,549 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:39:24,550 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:39:24,551 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:39:24,552 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:39:24,553 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:39:24,562 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:39:24,564 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:39:24,570 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:39:24,573 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:39:24,578 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:39:24,580 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:39:24,583 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:39:24,584 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:39:24,585 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:39:24,588 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:39:24,589 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:39:24,589 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:39:24,590 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:39:24,591 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:39:24,592 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:39:24,592 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:39:24,593 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:39:24,599 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:39:24,601 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:39:24,616 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:39:24,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:39:24,617 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:39:24,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:39:24,618 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:39:24,619 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:39:24,620 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:39:24,622 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-20 10:39:24,659 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:39:24,659 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:39:24,661 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:39:24,661 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:39:24,663 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:39:24,663 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:39:24,664 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:39:24,664 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:39:24,665 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:39:24,665 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:39:24,666 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:39:24,667 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:39:24,667 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:39:24,667 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:39:24,668 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:39:24,668 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 10:39:24,669 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 10:39:24,669 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 10:39:24,669 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:39:24,670 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 10:39:24,670 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 10:39:24,670 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 10:39:24,671 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:39:24,671 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:39:24,671 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:39:24,672 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:39:24,672 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:39:24,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:39:24,673 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:39:24,673 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:39:24,673 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-20 10:39:24,674 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 10:39:24,674 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 10:39:24,675 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/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_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN 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 -> 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae [2022-11-20 10:39:25,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:39:25,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:39:25,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:39:25,146 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:39:25,147 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:39:25,149 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/memsafety/20020406-1.i [2022-11-20 10:39:28,367 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:39:28,646 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:39:28,646 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/sv-benchmarks/c/memsafety/20020406-1.i [2022-11-20 10:39:28,692 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/data/df7394cff/4aa41082d9504e55af9b5f992d180778/FLAGb9e4ef3b0 [2022-11-20 10:39:28,711 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/data/df7394cff/4aa41082d9504e55af9b5f992d180778 [2022-11-20 10:39:28,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:39:28,715 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:39:28,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:39:28,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:39:28,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:39:28,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:39:28" (1/1) ... [2022-11-20 10:39:28,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce6b818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:39:28, skipping insertion in model container [2022-11-20 10:39:28,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:39:28" (1/1) ... [2022-11-20 10:39:28,749 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:39:28,828 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:39:29,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:39:29,409 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-20 10:39:29,430 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:39:29,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:39:29,507 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:39:29,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:39:29,687 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:39:29,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:39:29 WrapperNode [2022-11-20 10:39:29,689 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:39:29,690 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:39:29,691 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:39:29,691 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:39:29,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:39:29" (1/1) ... [2022-11-20 10:39:29,734 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:39:29" (1/1) ... [2022-11-20 10:39:29,761 INFO L138 Inliner]: procedures = 286, calls = 76, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2022-11-20 10:39:29,761 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:39:29,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:39:29,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:39:29,762 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:39:29,773 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:39:29" (1/1) ... [2022-11-20 10:39:29,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:39:29" (1/1) ... [2022-11-20 10:39:29,779 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:39:29" (1/1) ... [2022-11-20 10:39:29,779 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:39:29" (1/1) ... [2022-11-20 10:39:29,796 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:39:29" (1/1) ... [2022-11-20 10:39:29,810 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:39:29" (1/1) ... [2022-11-20 10:39:29,813 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:39:29" (1/1) ... [2022-11-20 10:39:29,815 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:39:29" (1/1) ... [2022-11-20 10:39:29,819 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:39:29,820 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:39:29,820 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:39:29,821 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:39:29,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:39:29" (1/1) ... [2022-11-20 10:39:29,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:39:29,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:39:29,868 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:39:29,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:39:29,919 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFdeg [2022-11-20 10:39:29,919 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFdeg [2022-11-20 10:39:29,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-20 10:39:29,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:39:29,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 10:39:29,920 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFnew [2022-11-20 10:39:29,920 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFnew [2022-11-20 10:39:29,922 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFfree [2022-11-20 10:39:29,922 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFfree [2022-11-20 10:39:29,923 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFshift_add [2022-11-20 10:39:29,923 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFshift_add [2022-11-20 10:39:29,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:39:29,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-20 10:39:29,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-20 10:39:29,923 INFO L130 BoogieDeclarations]: Found specification of procedure FFmul [2022-11-20 10:39:29,924 INFO L138 BoogieDeclarations]: Found implementation of procedure FFmul [2022-11-20 10:39:29,924 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFexgcd [2022-11-20 10:39:29,924 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFexgcd [2022-11-20 10:39:29,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 10:39:29,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:39:29,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 10:39:29,925 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFswap [2022-11-20 10:39:29,925 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFswap [2022-11-20 10:39:29,925 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFcopy [2022-11-20 10:39:29,926 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFcopy [2022-11-20 10:39:29,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:39:29,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:39:30,132 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:39:30,150 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:39:31,292 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:39:31,311 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:39:31,311 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 10:39:31,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:39:31 BoogieIcfgContainer [2022-11-20 10:39:31,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:39:31,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:39:31,319 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:39:31,322 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:39:31,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:39:28" (1/3) ... [2022-11-20 10:39:31,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53711253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:39:31, skipping insertion in model container [2022-11-20 10:39:31,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:39:29" (2/3) ... [2022-11-20 10:39:31,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53711253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:39:31, skipping insertion in model container [2022-11-20 10:39:31,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:39:31" (3/3) ... [2022-11-20 10:39:31,329 INFO L112 eAbstractionObserver]: Analyzing ICFG 20020406-1.i [2022-11-20 10:39:31,351 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:39:31,352 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2022-11-20 10:39:31,417 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:39:31,423 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@71c25c43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:39:31,423 INFO L358 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2022-11-20 10:39:31,428 INFO L276 IsEmpty]: Start isEmpty. Operand has 187 states, 90 states have (on average 1.7333333333333334) internal successors, (156), 146 states have internal predecessors, (156), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-20 10:39:31,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 10:39:31,436 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:31,437 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 10:39:31,438 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-20 10:39:31,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:31,444 INFO L85 PathProgramCache]: Analyzing trace with hash 228226931, now seen corresponding path program 1 times [2022-11-20 10:39:31,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:39:31,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2077526468] [2022-11-20 10:39:31,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:31,459 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-20 10:39:31,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:39:31,466 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:39:31,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:39:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:31,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 10:39:31,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:39:31,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-20 10:39:31,682 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-20 10:39:31,682 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:39:31,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:39:31,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2077526468] [2022-11-20 10:39:31,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2077526468] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:39:31,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:39:31,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:39:31,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637626817] [2022-11-20 10:39:31,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:39:31,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:39:31,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:39:31,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:39:31,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:39:31,732 INFO L87 Difference]: Start difference. First operand has 187 states, 90 states have (on average 1.7333333333333334) internal successors, (156), 146 states have internal predecessors, (156), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:32,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:32,208 INFO L93 Difference]: Finished difference Result 182 states and 218 transitions. [2022-11-20 10:39:32,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:39:32,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-20 10:39:32,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:32,223 INFO L225 Difference]: With dead ends: 182 [2022-11-20 10:39:32,223 INFO L226 Difference]: Without dead ends: 180 [2022-11-20 10:39:32,225 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-20 10:39:32,230 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 22 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:32,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 344 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:39:32,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-11-20 10:39:32,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2022-11-20 10:39:32,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 87 states have (on average 1.6781609195402298) internal successors, (146), 139 states have internal predecessors, (146), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-20 10:39:32,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 216 transitions. [2022-11-20 10:39:32,301 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 216 transitions. Word has length 5 [2022-11-20 10:39:32,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:32,302 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 216 transitions. [2022-11-20 10:39:32,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:32,303 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 216 transitions. [2022-11-20 10:39:32,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 10:39:32,304 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:32,304 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 10:39:32,314 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-20 10:39:32,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.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-20 10:39:32,509 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-20 10:39:32,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:32,510 INFO L85 PathProgramCache]: Analyzing trace with hash 228226932, now seen corresponding path program 1 times [2022-11-20 10:39:32,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:39:32,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [55557163] [2022-11-20 10:39:32,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:32,512 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-20 10:39:32,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:39:32,513 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:39:32,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:39:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:32,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:39:32,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:39:32,658 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-20 10:39:32,671 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-20 10:39:32,672 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:39:32,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:39:32,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [55557163] [2022-11-20 10:39:32,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [55557163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:39:32,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:39:32,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:39:32,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334240495] [2022-11-20 10:39:32,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:39:32,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:39:32,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:39:32,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:39:32,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:39:32,685 INFO L87 Difference]: Start difference. First operand 180 states and 216 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:33,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:33,181 INFO L93 Difference]: Finished difference Result 184 states and 225 transitions. [2022-11-20 10:39:33,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:39:33,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-20 10:39:33,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:33,185 INFO L225 Difference]: With dead ends: 184 [2022-11-20 10:39:33,186 INFO L226 Difference]: Without dead ends: 184 [2022-11-20 10:39:33,186 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-20 10:39:33,187 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 6 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:33,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 360 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 10:39:33,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-11-20 10:39:33,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2022-11-20 10:39:33,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 89 states have (on average 1.651685393258427) internal successors, (147), 140 states have internal predecessors, (147), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-20 10:39:33,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 217 transitions. [2022-11-20 10:39:33,218 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 217 transitions. Word has length 5 [2022-11-20 10:39:33,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:33,218 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 217 transitions. [2022-11-20 10:39:33,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:33,219 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 217 transitions. [2022-11-20 10:39:33,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 10:39:33,219 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:33,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:39:33,241 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-20 10:39:33,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.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-20 10:39:33,438 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting DUPFFnewErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-20 10:39:33,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:33,438 INFO L85 PathProgramCache]: Analyzing trace with hash 282747829, now seen corresponding path program 1 times [2022-11-20 10:39:33,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:39:33,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778555888] [2022-11-20 10:39:33,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:33,440 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-20 10:39:33,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:39:33,441 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:39:33,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:39:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:33,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 10:39:33,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:39:33,576 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-20 10:39:33,586 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-20 10:39:33,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:39:33,682 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-20 10:39:33,700 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 10:39:33,700 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-20 10:39:33,725 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-20 10:39:33,725 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:39:33,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:39:33,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778555888] [2022-11-20 10:39:33,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778555888] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:39:33,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:39:33,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:39:33,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839594737] [2022-11-20 10:39:33,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:39:33,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:39:33,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:39:33,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:39:33,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:39:33,733 INFO L87 Difference]: Start difference. First operand 181 states and 217 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:34,119 INFO L93 Difference]: Finished difference Result 177 states and 213 transitions. [2022-11-20 10:39:34,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:39:34,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-20 10:39:34,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:34,123 INFO L225 Difference]: With dead ends: 177 [2022-11-20 10:39:34,123 INFO L226 Difference]: Without dead ends: 177 [2022-11-20 10:39:34,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-20 10:39:34,125 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 33 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:34,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 342 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:39:34,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-11-20 10:39:34,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2022-11-20 10:39:34,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 87 states have (on average 1.6206896551724137) internal successors, (141), 134 states have internal predecessors, (141), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-20 10:39:34,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 211 transitions. [2022-11-20 10:39:34,141 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 211 transitions. Word has length 7 [2022-11-20 10:39:34,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:34,141 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 211 transitions. [2022-11-20 10:39:34,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:34,142 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 211 transitions. [2022-11-20 10:39:34,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 10:39:34,142 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:34,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:39:34,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:39:34,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.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-20 10:39:34,355 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting DUPFFnewErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-20 10:39:34,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:34,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1865414411, now seen corresponding path program 1 times [2022-11-20 10:39:34,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:39:34,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847533776] [2022-11-20 10:39:34,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:34,357 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-20 10:39:34,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:39:34,364 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:39:34,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:39:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:34,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 10:39:34,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:39:34,480 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-20 10:39:34,516 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-20 10:39:34,544 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-20 10:39:34,573 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-20 10:39:34,573 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:39:34,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:39:34,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847533776] [2022-11-20 10:39:34,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847533776] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:39:34,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:39:34,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:39:34,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926355580] [2022-11-20 10:39:34,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:39:34,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:39:34,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:39:34,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:39:34,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:39:34,577 INFO L87 Difference]: Start difference. First operand 175 states and 211 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:35,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:35,526 INFO L93 Difference]: Finished difference Result 186 states and 233 transitions. [2022-11-20 10:39:35,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:39:35,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 10:39:35,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:35,529 INFO L225 Difference]: With dead ends: 186 [2022-11-20 10:39:35,529 INFO L226 Difference]: Without dead ends: 186 [2022-11-20 10:39:35,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:39:35,530 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 35 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:35,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 811 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 10:39:35,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-11-20 10:39:35,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 174. [2022-11-20 10:39:35,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 87 states have (on average 1.6091954022988506) internal successors, (140), 133 states have internal predecessors, (140), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-20 10:39:35,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 210 transitions. [2022-11-20 10:39:35,544 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 210 transitions. Word has length 11 [2022-11-20 10:39:35,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:35,545 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 210 transitions. [2022-11-20 10:39:35,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:35,545 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 210 transitions. [2022-11-20 10:39:35,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 10:39:35,546 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:35,546 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:39:35,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:39:35,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.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-20 10:39:35,747 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting DUPFFnewErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-20 10:39:35,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:35,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1993271845, now seen corresponding path program 1 times [2022-11-20 10:39:35,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:39:35,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [92695070] [2022-11-20 10:39:35,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:35,748 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-20 10:39:35,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:39:35,749 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:39:35,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:39:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:35,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-20 10:39:35,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:39:35,916 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 10 treesize of output 9 [2022-11-20 10:39:35,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 13 treesize of output 9 [2022-11-20 10:39:35,985 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-20 10:39:36,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-20 10:39:36,065 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-20 10:39:36,150 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-20 10:39:36,150 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:39:36,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:39:36,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [92695070] [2022-11-20 10:39:36,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [92695070] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:39:36,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:39:36,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:39:36,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141748191] [2022-11-20 10:39:36,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:39:36,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:39:36,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:39:36,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:39:36,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:39:36,152 INFO L87 Difference]: Start difference. First operand 174 states and 210 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:37,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:37,429 INFO L93 Difference]: Finished difference Result 197 states and 234 transitions. [2022-11-20 10:39:37,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:39:37,435 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 10:39:37,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:37,437 INFO L225 Difference]: With dead ends: 197 [2022-11-20 10:39:37,437 INFO L226 Difference]: Without dead ends: 197 [2022-11-20 10:39:37,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2022-11-20 10:39:37,439 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 64 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:37,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1053 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-20 10:39:37,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-11-20 10:39:37,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 190. [2022-11-20 10:39:37,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 102 states have (on average 1.5294117647058822) internal successors, (156), 148 states have internal predecessors, (156), 35 states have call successors, (35), 9 states have call predecessors, (35), 9 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-20 10:39:37,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 226 transitions. [2022-11-20 10:39:37,450 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 226 transitions. Word has length 12 [2022-11-20 10:39:37,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:37,451 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 226 transitions. [2022-11-20 10:39:37,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:37,451 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 226 transitions. [2022-11-20 10:39:37,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 10:39:37,452 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:37,452 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:39:37,471 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:39:37,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.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-20 10:39:37,665 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-20 10:39:37,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:37,665 INFO L85 PathProgramCache]: Analyzing trace with hash 335042805, now seen corresponding path program 1 times [2022-11-20 10:39:37,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:39:37,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340027185] [2022-11-20 10:39:37,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:37,666 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-20 10:39:37,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:39:37,670 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:39:37,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:39:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:37,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:39:37,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:39:37,932 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-20 10:39:37,932 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:39:37,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:39:37,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [340027185] [2022-11-20 10:39:37,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [340027185] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:39:37,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:39:37,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:39:37,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581985551] [2022-11-20 10:39:37,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:39:37,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:39:37,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:39:37,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:39:37,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:39:37,934 INFO L87 Difference]: Start difference. First operand 190 states and 226 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:39:38,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:38,244 INFO L93 Difference]: Finished difference Result 209 states and 253 transitions. [2022-11-20 10:39:38,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:39:38,245 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-11-20 10:39:38,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:38,247 INFO L225 Difference]: With dead ends: 209 [2022-11-20 10:39:38,247 INFO L226 Difference]: Without dead ends: 203 [2022-11-20 10:39:38,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:39:38,249 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 45 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:38,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 757 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:39:38,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-11-20 10:39:38,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 198. [2022-11-20 10:39:38,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 109 states have (on average 1.5045871559633028) internal successors, (164), 156 states have internal predecessors, (164), 35 states have call successors, (35), 9 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2022-11-20 10:39:38,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 238 transitions. [2022-11-20 10:39:38,263 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 238 transitions. Word has length 21 [2022-11-20 10:39:38,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:38,263 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 238 transitions. [2022-11-20 10:39:38,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:39:38,264 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 238 transitions. [2022-11-20 10:39:38,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 10:39:38,265 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:38,265 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] [2022-11-20 10:39:38,289 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:39:38,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.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-20 10:39:38,489 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-20 10:39:38,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:38,489 INFO L85 PathProgramCache]: Analyzing trace with hash 370721495, now seen corresponding path program 1 times [2022-11-20 10:39:38,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:39:38,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1291728654] [2022-11-20 10:39:38,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:38,490 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-20 10:39:38,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:39:38,493 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:39:38,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:39:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:38,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 10:39:38,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:39:38,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:38,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:39:39,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:39,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:39:39,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1291728654] [2022-11-20 10:39:39,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1291728654] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:39:39,117 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:39:39,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-11-20 10:39:39,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581553826] [2022-11-20 10:39:39,118 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:39:39,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 10:39:39,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:39:39,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 10:39:39,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-11-20 10:39:39,119 INFO L87 Difference]: Start difference. First operand 198 states and 238 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:39:40,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:40,092 INFO L93 Difference]: Finished difference Result 246 states and 304 transitions. [2022-11-20 10:39:40,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 10:39:40,093 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-20 10:39:40,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:40,097 INFO L225 Difference]: With dead ends: 246 [2022-11-20 10:39:40,098 INFO L226 Difference]: Without dead ends: 234 [2022-11-20 10:39:40,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=177, Invalid=329, Unknown=0, NotChecked=0, Total=506 [2022-11-20 10:39:40,103 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 167 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:40,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1351 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 10:39:40,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-11-20 10:39:40,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 216. [2022-11-20 10:39:40,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 127 states have (on average 1.4960629921259843) internal successors, (190), 173 states have internal predecessors, (190), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2022-11-20 10:39:40,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 264 transitions. [2022-11-20 10:39:40,127 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 264 transitions. Word has length 22 [2022-11-20 10:39:40,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:40,128 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 264 transitions. [2022-11-20 10:39:40,128 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:39:40,129 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 264 transitions. [2022-11-20 10:39:40,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 10:39:40,130 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:40,130 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:39:40,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:39:40,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.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-20 10:39:40,344 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-20 10:39:40,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:40,344 INFO L85 PathProgramCache]: Analyzing trace with hash -843792011, now seen corresponding path program 2 times [2022-11-20 10:39:40,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:39:40,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655374782] [2022-11-20 10:39:40,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:39:40,345 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-20 10:39:40,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:39:40,346 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:39:40,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:39:40,505 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 10:39:40,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:39:40,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:39:40,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:39:40,563 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:39:40,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:39:40,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:39:40,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [655374782] [2022-11-20 10:39:40,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [655374782] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:39:40,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:39:40,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:39:40,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545409960] [2022-11-20 10:39:40,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:39:40,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:39:40,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:39:40,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:39:40,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:39:40,566 INFO L87 Difference]: Start difference. First operand 216 states and 264 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:39:41,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:41,292 INFO L93 Difference]: Finished difference Result 214 states and 262 transitions. [2022-11-20 10:39:41,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:39:41,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-11-20 10:39:41,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:41,295 INFO L225 Difference]: With dead ends: 214 [2022-11-20 10:39:41,295 INFO L226 Difference]: Without dead ends: 214 [2022-11-20 10:39:41,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:39:41,296 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 22 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:41,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 756 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 10:39:41,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-11-20 10:39:41,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2022-11-20 10:39:41,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 127 states have (on average 1.4803149606299213) internal successors, (188), 171 states have internal predecessors, (188), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2022-11-20 10:39:41,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 262 transitions. [2022-11-20 10:39:41,308 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 262 transitions. Word has length 25 [2022-11-20 10:39:41,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:41,308 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 262 transitions. [2022-11-20 10:39:41,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:39:41,309 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 262 transitions. [2022-11-20 10:39:41,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 10:39:41,309 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:41,309 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:39:41,330 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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)] Ended with exit code 0 [2022-11-20 10:39:41,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.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-20 10:39:41,523 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-20 10:39:41,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:41,523 INFO L85 PathProgramCache]: Analyzing trace with hash -843792010, now seen corresponding path program 1 times [2022-11-20 10:39:41,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:39:41,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759447106] [2022-11-20 10:39:41,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:41,524 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-20 10:39:41,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:39:41,525 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:39:41,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:39:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:41,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-20 10:39:41,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:39:41,975 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:41,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:39:42,546 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:42,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:39:42,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759447106] [2022-11-20 10:39:42,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [759447106] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:39:42,547 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:39:42,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-11-20 10:39:42,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62097468] [2022-11-20 10:39:42,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:39:42,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 10:39:42,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:39:42,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 10:39:42,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2022-11-20 10:39:42,549 INFO L87 Difference]: Start difference. First operand 214 states and 262 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:39:44,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:44,675 INFO L93 Difference]: Finished difference Result 285 states and 358 transitions. [2022-11-20 10:39:44,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 10:39:44,676 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-11-20 10:39:44,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:44,678 INFO L225 Difference]: With dead ends: 285 [2022-11-20 10:39:44,679 INFO L226 Difference]: Without dead ends: 267 [2022-11-20 10:39:44,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=437, Invalid=1045, Unknown=0, NotChecked=0, Total=1482 [2022-11-20 10:39:44,680 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 260 mSDsluCounter, 1602 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 1817 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:44,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 1817 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-20 10:39:44,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-11-20 10:39:44,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 222. [2022-11-20 10:39:44,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 134 states have (on average 1.4402985074626866) internal successors, (193), 179 states have internal predecessors, (193), 35 states have call successors, (35), 10 states have call predecessors, (35), 11 states have return successors, (40), 35 states have call predecessors, (40), 35 states have call successors, (40) [2022-11-20 10:39:44,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 268 transitions. [2022-11-20 10:39:44,704 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 268 transitions. Word has length 25 [2022-11-20 10:39:44,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:44,706 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 268 transitions. [2022-11-20 10:39:44,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:39:44,707 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 268 transitions. [2022-11-20 10:39:44,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 10:39:44,707 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:44,708 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:39:44,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:39:44,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.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-20 10:39:44,922 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-20 10:39:44,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:44,922 INFO L85 PathProgramCache]: Analyzing trace with hash 168356342, now seen corresponding path program 2 times [2022-11-20 10:39:44,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:39:44,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [699222214] [2022-11-20 10:39:44,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:39:44,923 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-20 10:39:44,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:39:44,924 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:39:44,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:39:45,078 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 10:39:45,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:39:45,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-20 10:39:45,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:39:45,317 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-20 10:39:45,317 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:39:45,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:39:45,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [699222214] [2022-11-20 10:39:45,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [699222214] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:39:45,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:39:45,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:39:45,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998361813] [2022-11-20 10:39:45,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:39:45,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:39:45,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:39:45,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:39:45,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:39:45,319 INFO L87 Difference]: Start difference. First operand 222 states and 268 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:39:46,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:46,017 INFO L93 Difference]: Finished difference Result 220 states and 266 transitions. [2022-11-20 10:39:46,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:39:46,018 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-11-20 10:39:46,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:46,020 INFO L225 Difference]: With dead ends: 220 [2022-11-20 10:39:46,020 INFO L226 Difference]: Without dead ends: 220 [2022-11-20 10:39:46,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:39:46,021 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 26 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:46,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 809 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 10:39:46,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-11-20 10:39:46,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2022-11-20 10:39:46,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 134 states have (on average 1.4253731343283582) internal successors, (191), 177 states have internal predecessors, (191), 35 states have call successors, (35), 10 states have call predecessors, (35), 11 states have return successors, (40), 35 states have call predecessors, (40), 35 states have call successors, (40) [2022-11-20 10:39:46,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 266 transitions. [2022-11-20 10:39:46,034 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 266 transitions. Word has length 29 [2022-11-20 10:39:46,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:46,034 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 266 transitions. [2022-11-20 10:39:46,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:39:46,035 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 266 transitions. [2022-11-20 10:39:46,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 10:39:46,036 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:46,036 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:39:46,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:39:46,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.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-20 10:39:46,238 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-20 10:39:46,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:46,239 INFO L85 PathProgramCache]: Analyzing trace with hash 924079462, now seen corresponding path program 1 times [2022-11-20 10:39:46,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:39:46,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1985858869] [2022-11-20 10:39:46,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:46,240 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-20 10:39:46,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:39:46,241 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:39:46,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:39:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:46,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-20 10:39:46,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:39:46,586 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-20 10:39:46,619 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-20 10:39:46,619 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-20 10:39:46,655 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-20 10:39:46,860 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:39:46,861 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 39 treesize of output 37 [2022-11-20 10:39:46,904 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:39:46,904 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 39 treesize of output 37 [2022-11-20 10:39:46,946 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:39:46,947 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 39 treesize of output 37 [2022-11-20 10:39:46,990 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:39:46,991 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 39 treesize of output 37 [2022-11-20 10:39:47,034 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:39:47,034 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 39 treesize of output 37 [2022-11-20 10:39:47,098 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:39:47,098 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 39 treesize of output 37 [2022-11-20 10:39:47,137 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:39:47,138 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 39 treesize of output 37 [2022-11-20 10:39:47,180 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:39:47,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-20 10:39:47,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2022-11-20 10:39:47,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-11-20 10:39:47,434 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-20 10:39:47,495 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-20 10:39:47,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:39:54,882 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_552 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_DUPFFnew_~ans~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_DUPFFnew_~ans~0#1.base|) .cse0) v_ArrVal_552) |c_DUPFFnew_~ans~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-20 10:39:54,906 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:39:54,907 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-20 10:39:54,913 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-20 10:39:54,919 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-20 10:40:01,147 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-20 10:40:01,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:40:01,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1985858869] [2022-11-20 10:40:01,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1985858869] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:40:01,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:40:01,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2022-11-20 10:40:01,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464124259] [2022-11-20 10:40:01,148 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:40:01,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-20 10:40:01,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:40:01,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-20 10:40:01,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=4, NotChecked=36, Total=420 [2022-11-20 10:40:01,150 INFO L87 Difference]: Start difference. First operand 220 states and 266 transitions. Second operand has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:40:03,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:03,512 INFO L93 Difference]: Finished difference Result 219 states and 265 transitions. [2022-11-20 10:40:03,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 10:40:03,513 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-20 10:40:03,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:03,515 INFO L225 Difference]: With dead ends: 219 [2022-11-20 10:40:03,515 INFO L226 Difference]: Without dead ends: 219 [2022-11-20 10:40:03,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=4, NotChecked=44, Total=600 [2022-11-20 10:40:03,516 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 40 mSDsluCounter, 1945 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 2138 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 406 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-20 10:40:03,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 2138 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 499 Invalid, 0 Unknown, 406 Unchecked, 1.9s Time] [2022-11-20 10:40:03,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-11-20 10:40:03,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2022-11-20 10:40:03,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 134 states have (on average 1.4179104477611941) internal successors, (190), 176 states have internal predecessors, (190), 35 states have call successors, (35), 10 states have call predecessors, (35), 11 states have return successors, (40), 35 states have call predecessors, (40), 35 states have call successors, (40) [2022-11-20 10:40:03,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 265 transitions. [2022-11-20 10:40:03,526 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 265 transitions. Word has length 30 [2022-11-20 10:40:03,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:03,526 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 265 transitions. [2022-11-20 10:40:03,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:40:03,527 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 265 transitions. [2022-11-20 10:40:03,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 10:40:03,528 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:03,528 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:40:03,554 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:40:03,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.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-20 10:40:03,749 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-20 10:40:03,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:03,750 INFO L85 PathProgramCache]: Analyzing trace with hash 924079463, now seen corresponding path program 1 times [2022-11-20 10:40:03,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:40:03,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [125958277] [2022-11-20 10:40:03,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:03,750 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-20 10:40:03,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:40:03,751 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:40:03,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:40:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:04,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-20 10:40:04,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:40:04,138 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-20 10:40:04,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-20 10:40:04,209 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 10:40:04,209 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-20 10:40:04,263 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-20 10:40:04,279 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-20 10:40:04,647 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:40:04,648 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 16 treesize of output 22 [2022-11-20 10:40:04,665 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 7 treesize of output 3 [2022-11-20 10:40:04,707 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:40:04,708 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 41 treesize of output 39 [2022-11-20 10:40:04,810 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:40:04,811 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 41 treesize of output 39 [2022-11-20 10:40:04,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:40:04,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 10:40:04,895 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:40:04,896 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 41 treesize of output 39 [2022-11-20 10:40:04,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:40:04,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 10:40:04,970 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:40:04,970 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 41 treesize of output 39 [2022-11-20 10:40:05,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:40:05,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 10:40:05,051 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:40:05,052 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 16 treesize of output 22 [2022-11-20 10:40:05,066 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 7 treesize of output 3 [2022-11-20 10:40:05,108 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:40:05,108 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 41 treesize of output 39 [2022-11-20 10:40:05,202 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:40:05,202 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 41 treesize of output 39 [2022-11-20 10:40:05,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:40:05,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 10:40:05,283 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:40:05,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-11-20 10:40:05,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:40:05,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 10:40:05,362 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:40:05,362 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 50 treesize of output 49 [2022-11-20 10:40:05,381 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-20 10:40:05,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-11-20 10:40:05,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-11-20 10:40:05,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2022-11-20 10:40:05,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 59 [2022-11-20 10:40:05,793 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-20 10:40:05,804 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-20 10:40:05,855 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-20 10:40:05,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:40:53,438 WARN L233 SmtUtils]: Spent 47.19s on a formula simplification that was a NOOP. DAG size: 195 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 10:41:06,833 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:41:06,833 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-20 10:41:06,838 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-20 10:41:06,880 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:41:06,880 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-20 10:41:06,902 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:41:06,902 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-20 10:41:06,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:41:06,913 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-20 10:41:06,919 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:41:06,925 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-20 10:41:07,346 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-20 10:41:07,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:41:07,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [125958277] [2022-11-20 10:41:07,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [125958277] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:41:07,348 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:41:07,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2022-11-20 10:41:07,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528764435] [2022-11-20 10:41:07,348 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:41:07,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-20 10:41:07,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:41:07,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-20 10:41:07,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=358, Unknown=7, NotChecked=0, Total=420 [2022-11-20 10:41:07,350 INFO L87 Difference]: Start difference. First operand 219 states and 265 transitions. Second operand has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:41:13,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:41:13,686 INFO L93 Difference]: Finished difference Result 220 states and 267 transitions. [2022-11-20 10:41:13,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 10:41:13,688 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-20 10:41:13,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:41:13,690 INFO L225 Difference]: With dead ends: 220 [2022-11-20 10:41:13,690 INFO L226 Difference]: Without dead ends: 220 [2022-11-20 10:41:13,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=106, Invalid=643, Unknown=7, NotChecked=0, Total=756 [2022-11-20 10:41:13,691 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 38 mSDsluCounter, 1917 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 2100 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 284 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:41:13,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 2100 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 762 Invalid, 0 Unknown, 284 Unchecked, 4.7s Time] [2022-11-20 10:41:13,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-11-20 10:41:13,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 218. [2022-11-20 10:41:13,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 134 states have (on average 1.4104477611940298) internal successors, (189), 175 states have internal predecessors, (189), 35 states have call successors, (35), 10 states have call predecessors, (35), 11 states have return successors, (40), 35 states have call predecessors, (40), 35 states have call successors, (40) [2022-11-20 10:41:13,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 264 transitions. [2022-11-20 10:41:13,708 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 264 transitions. Word has length 30 [2022-11-20 10:41:13,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:41:13,709 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 264 transitions. [2022-11-20 10:41:13,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:41:13,710 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 264 transitions. [2022-11-20 10:41:13,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-20 10:41:13,716 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:41:13,716 INFO L195 NwaCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:41:13,735 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:41:13,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.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-20 10:41:13,933 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting DUPFFnewErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-20 10:41:13,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:41:13,933 INFO L85 PathProgramCache]: Analyzing trace with hash 2092985884, now seen corresponding path program 1 times [2022-11-20 10:41:13,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:41:13,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [550242215] [2022-11-20 10:41:13,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:41:13,934 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-20 10:41:13,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:41:13,936 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:41:13,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:41:14,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:14,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-20 10:41:14,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:41:14,332 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 10 treesize of output 9 [2022-11-20 10:41:14,384 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-20 10:41:14,401 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-20 10:41:14,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-20 10:41:14,499 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-20 10:41:14,600 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-20 10:41:14,600 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:41:14,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:41:14,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [550242215] [2022-11-20 10:41:14,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [550242215] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:41:14,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:41:14,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:41:14,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587656059] [2022-11-20 10:41:14,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:41:14,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:41:14,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:41:14,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:41:14,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:41:14,603 INFO L87 Difference]: Start difference. First operand 218 states and 264 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:41:15,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:41:15,743 INFO L93 Difference]: Finished difference Result 230 states and 271 transitions. [2022-11-20 10:41:15,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:41:15,744 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-11-20 10:41:15,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:41:15,745 INFO L225 Difference]: With dead ends: 230 [2022-11-20 10:41:15,745 INFO L226 Difference]: Without dead ends: 218 [2022-11-20 10:41:15,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2022-11-20 10:41:15,747 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 75 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:41:15,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 753 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 10:41:15,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-11-20 10:41:15,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 213. [2022-11-20 10:41:15,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 130 states have (on average 1.376923076923077) internal successors, (179), 170 states have internal predecessors, (179), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-20 10:41:15,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 249 transitions. [2022-11-20 10:41:15,755 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 249 transitions. Word has length 42 [2022-11-20 10:41:15,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:41:15,755 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 249 transitions. [2022-11-20 10:41:15,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:41:15,756 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 249 transitions. [2022-11-20 10:41:15,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-20 10:41:15,756 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:41:15,756 INFO L195 NwaCegarLoop]: trace histogram [13, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:41:15,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:41:15,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.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-20 10:41:15,971 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-20 10:41:15,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:41:15,971 INFO L85 PathProgramCache]: Analyzing trace with hash -562772518, now seen corresponding path program 1 times [2022-11-20 10:41:15,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:41:15,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1354140353] [2022-11-20 10:41:15,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:41:15,972 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-20 10:41:15,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:41:15,974 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:41:15,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:41:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:16,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 10:41:16,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:41:16,759 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 68 proven. 15 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-20 10:41:16,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:41:17,598 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 68 proven. 15 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-20 10:41:17,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:41:17,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1354140353] [2022-11-20 10:41:17,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1354140353] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:41:17,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:41:17,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-11-20 10:41:17,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614052778] [2022-11-20 10:41:17,599 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:41:17,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-20 10:41:17,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:41:17,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-20 10:41:17,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-11-20 10:41:17,600 INFO L87 Difference]: Start difference. First operand 213 states and 249 transitions. Second operand has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 10:41:21,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:41:21,360 INFO L93 Difference]: Finished difference Result 291 states and 368 transitions. [2022-11-20 10:41:21,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-20 10:41:21,362 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 56 [2022-11-20 10:41:21,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:41:21,363 INFO L225 Difference]: With dead ends: 291 [2022-11-20 10:41:21,364 INFO L226 Difference]: Without dead ends: 279 [2022-11-20 10:41:21,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=641, Invalid=1521, Unknown=0, NotChecked=0, Total=2162 [2022-11-20 10:41:21,365 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 281 mSDsluCounter, 1964 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 2177 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:41:21,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 2177 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-20 10:41:21,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-11-20 10:41:21,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 220. [2022-11-20 10:41:21,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 137 states have (on average 1.3576642335766422) internal successors, (186), 177 states have internal predecessors, (186), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-20 10:41:21,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 256 transitions. [2022-11-20 10:41:21,376 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 256 transitions. Word has length 56 [2022-11-20 10:41:21,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:41:21,377 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 256 transitions. [2022-11-20 10:41:21,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 10:41:21,377 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 256 transitions. [2022-11-20 10:41:21,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-20 10:41:21,378 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:41:21,378 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:41:21,400 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:41:21,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.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-20 10:41:21,595 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-20 10:41:21,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:41:21,595 INFO L85 PathProgramCache]: Analyzing trace with hash -2097093162, now seen corresponding path program 2 times [2022-11-20 10:41:21,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:41:21,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1407073852] [2022-11-20 10:41:21,596 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:41:21,596 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-20 10:41:21,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:41:21,598 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:41:21,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:41:21,839 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 10:41:21,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:41:21,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:41:21,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:41:21,905 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2022-11-20 10:41:21,905 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:41:21,905 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:41:21,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1407073852] [2022-11-20 10:41:21,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1407073852] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:41:21,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:41:21,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:41:21,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643251007] [2022-11-20 10:41:21,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:41:21,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:41:21,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:41:21,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:41:21,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:41:21,908 INFO L87 Difference]: Start difference. First operand 220 states and 256 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:41:22,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:41:22,761 INFO L93 Difference]: Finished difference Result 218 states and 254 transitions. [2022-11-20 10:41:22,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:41:22,762 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2022-11-20 10:41:22,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:41:22,763 INFO L225 Difference]: With dead ends: 218 [2022-11-20 10:41:22,764 INFO L226 Difference]: Without dead ends: 218 [2022-11-20 10:41:22,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:41:22,765 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 23 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 10:41:22,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 738 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 10:41:22,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-11-20 10:41:22,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2022-11-20 10:41:22,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 137 states have (on average 1.3430656934306568) internal successors, (184), 175 states have internal predecessors, (184), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-20 10:41:22,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 254 transitions. [2022-11-20 10:41:22,774 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 254 transitions. Word has length 63 [2022-11-20 10:41:22,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:41:22,774 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 254 transitions. [2022-11-20 10:41:22,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:41:22,775 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 254 transitions. [2022-11-20 10:41:22,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-20 10:41:22,776 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:41:22,776 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:41:22,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:41:22,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.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-20 10:41:22,990 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-20 10:41:22,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:41:22,991 INFO L85 PathProgramCache]: Analyzing trace with hash -2097093161, now seen corresponding path program 1 times [2022-11-20 10:41:22,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:41:22,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431401369] [2022-11-20 10:41:22,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:41:22,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:41:22,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:41:22,994 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:41:23,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:41:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:23,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-20 10:41:23,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:41:23,886 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-11-20 10:41:23,886 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:41:23,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:41:23,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431401369] [2022-11-20 10:41:23,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [431401369] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:41:23,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:41:23,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:41:23,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622469829] [2022-11-20 10:41:23,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:41:23,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:41:23,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:41:23,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:41:23,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:41:23,889 INFO L87 Difference]: Start difference. First operand 218 states and 254 transitions. Second operand has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:41:24,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:41:24,758 INFO L93 Difference]: Finished difference Result 216 states and 252 transitions. [2022-11-20 10:41:24,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:41:24,759 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2022-11-20 10:41:24,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:41:24,761 INFO L225 Difference]: With dead ends: 216 [2022-11-20 10:41:24,761 INFO L226 Difference]: Without dead ends: 216 [2022-11-20 10:41:24,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:41:24,762 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 25 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 10:41:24,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 787 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 10:41:24,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-11-20 10:41:24,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2022-11-20 10:41:24,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 137 states have (on average 1.3284671532846715) internal successors, (182), 173 states have internal predecessors, (182), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-20 10:41:24,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 252 transitions. [2022-11-20 10:41:24,769 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 252 transitions. Word has length 63 [2022-11-20 10:41:24,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:41:24,770 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 252 transitions. [2022-11-20 10:41:24,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:41:24,770 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 252 transitions. [2022-11-20 10:41:24,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-20 10:41:24,771 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:41:24,771 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:41:24,790 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:41:24,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.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-20 10:41:24,988 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-20 10:41:24,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:41:24,989 INFO L85 PathProgramCache]: Analyzing trace with hash -585378383, now seen corresponding path program 1 times [2022-11-20 10:41:24,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:41:24,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1764684261] [2022-11-20 10:41:24,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:41:24,990 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-20 10:41:24,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:41:24,992 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:41:25,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:41:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:26,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-20 10:41:26,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:41:26,127 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-20 10:41:26,180 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-20 10:41:26,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-20 10:41:26,228 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-20 10:41:26,511 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:41:26,511 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 39 treesize of output 37 [2022-11-20 10:41:26,568 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:41:26,568 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 39 treesize of output 37 [2022-11-20 10:41:26,622 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:41:26,622 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 39 treesize of output 37 [2022-11-20 10:41:26,669 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:41:26,669 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 39 treesize of output 37 [2022-11-20 10:41:26,723 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:41:26,724 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 39 treesize of output 37 [2022-11-20 10:41:26,773 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:41:26,773 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 39 treesize of output 37 [2022-11-20 10:41:26,818 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:41:26,819 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 39 treesize of output 37 [2022-11-20 10:41:26,875 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:41:26,875 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 39 treesize of output 37 [2022-11-20 10:41:26,928 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:41:26,929 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 39 treesize of output 37 [2022-11-20 10:41:26,979 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:41:26,979 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 39 treesize of output 37 [2022-11-20 10:41:27,036 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:41:27,036 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 39 treesize of output 37 [2022-11-20 10:41:27,095 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:41:27,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-20 10:41:27,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:27,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:27,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:27,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:27,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2022-11-20 10:41:27,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-11-20 10:41:27,419 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 27 treesize of output 15 [2022-11-20 10:41:27,474 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 131 proven. 12 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-11-20 10:41:27,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:41:32,708 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_DUPFFnew_#t~mem34#1.base| v_ArrVal_1933) |c_DUPFFnew_~ans~0#1.base|) (bvadd (_ bv8 32) |c_DUPFFnew_~ans~0#1.offset|))) (_ bv1 1)))) is different from false [2022-11-20 10:41:34,869 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:41:34,869 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-20 10:41:34,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2022-11-20 10:41:34,876 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-20 10:41:37,085 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 131 proven. 12 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-11-20 10:41:37,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:41:37,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1764684261] [2022-11-20 10:41:37,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1764684261] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:41:37,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:41:37,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2022-11-20 10:41:37,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091649366] [2022-11-20 10:41:37,087 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:41:37,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-20 10:41:37,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:41:37,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-20 10:41:37,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=319, Unknown=3, NotChecked=36, Total=420 [2022-11-20 10:41:37,088 INFO L87 Difference]: Start difference. First operand 216 states and 252 transitions. Second operand has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 10:41:39,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:41:39,592 INFO L93 Difference]: Finished difference Result 220 states and 259 transitions. [2022-11-20 10:41:39,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 10:41:39,593 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 64 [2022-11-20 10:41:39,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:41:39,598 INFO L225 Difference]: With dead ends: 220 [2022-11-20 10:41:39,598 INFO L226 Difference]: Without dead ends: 220 [2022-11-20 10:41:39,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=96, Invalid=457, Unknown=3, NotChecked=44, Total=600 [2022-11-20 10:41:39,600 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 59 mSDsluCounter, 1901 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 2087 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 320 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:41:39,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 2087 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 601 Invalid, 0 Unknown, 320 Unchecked, 2.2s Time] [2022-11-20 10:41:39,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-11-20 10:41:39,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 215. [2022-11-20 10:41:39,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 137 states have (on average 1.3211678832116789) internal successors, (181), 172 states have internal predecessors, (181), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-20 10:41:39,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 251 transitions. [2022-11-20 10:41:39,616 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 251 transitions. Word has length 64 [2022-11-20 10:41:39,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:41:39,617 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 251 transitions. [2022-11-20 10:41:39,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 10:41:39,617 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 251 transitions. [2022-11-20 10:41:39,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-20 10:41:39,618 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:41:39,618 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:41:39,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:41:39,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.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-20 10:41:39,842 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-20 10:41:39,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:41:39,842 INFO L85 PathProgramCache]: Analyzing trace with hash -585378382, now seen corresponding path program 1 times [2022-11-20 10:41:39,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:41:39,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [789827126] [2022-11-20 10:41:39,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:41:39,843 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-20 10:41:39,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:41:39,844 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:41:39,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:41:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:40,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-20 10:41:40,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:41:40,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-20 10:41:40,899 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 10 treesize of output 9 [2022-11-20 10:41:40,932 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 10:41:40,932 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-20 10:41:40,998 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-20 10:41:41,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 13 treesize of output 9 [2022-11-20 10:41:41,359 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:41:41,360 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 41 treesize of output 39 [2022-11-20 10:41:41,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:41,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 10:41:41,431 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:41:41,431 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 16 treesize of output 22 [2022-11-20 10:41:41,444 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 7 treesize of output 3 [2022-11-20 10:41:41,481 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:41:41,481 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 41 treesize of output 39 [2022-11-20 10:41:41,572 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:41:41,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-11-20 10:41:41,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:41,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 10:41:41,644 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:41:41,644 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 16 treesize of output 22 [2022-11-20 10:41:41,654 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 7 treesize of output 3 [2022-11-20 10:41:41,686 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:41:41,686 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 41 treesize of output 39 [2022-11-20 10:41:41,770 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:41:41,770 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 41 treesize of output 39 [2022-11-20 10:41:41,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:41,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 10:41:41,849 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:41:41,849 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 16 treesize of output 22 [2022-11-20 10:41:41,860 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 7 treesize of output 3 [2022-11-20 10:41:41,897 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:41:41,897 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 41 treesize of output 39 [2022-11-20 10:41:41,987 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:41:41,988 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 16 treesize of output 22 [2022-11-20 10:41:41,997 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 7 treesize of output 3 [2022-11-20 10:41:42,028 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:41:42,028 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 41 treesize of output 39 [2022-11-20 10:41:42,111 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:41:42,112 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 41 treesize of output 39 [2022-11-20 10:41:42,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:42,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 10:41:42,196 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:41:42,196 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 16 treesize of output 22 [2022-11-20 10:41:42,203 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 7 treesize of output 3 [2022-11-20 10:41:42,246 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:41:42,246 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 41 treesize of output 39 [2022-11-20 10:41:42,346 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:41:42,346 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 16 treesize of output 22 [2022-11-20 10:41:42,358 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 7 treesize of output 3 [2022-11-20 10:41:42,396 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:41:42,397 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 41 treesize of output 39 [2022-11-20 10:41:42,496 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:41:42,496 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 41 treesize of output 39 [2022-11-20 10:41:42,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:42,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 10:41:42,577 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:41:42,577 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 50 treesize of output 49 [2022-11-20 10:41:42,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-20 10:41:42,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:42,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:42,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:42,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:42,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 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-20 10:41:42,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:42,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:42,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:42,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:42,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-11-20 10:41:42,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2022-11-20 10:41:42,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 59 [2022-11-20 10:41:43,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-20 10:41:43,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 10:41:43,075 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 131 proven. 12 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-11-20 10:41:43,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:42:49,840 WARN L233 SmtUtils]: Spent 1.11m on a formula simplification that was a NOOP. DAG size: 228 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 10:43:00,112 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:43:00,113 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-20 10:43:00,117 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-20 10:43:00,144 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 15 treesize of output 7 [2022-11-20 10:43:00,165 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:43:00,166 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-20 10:43:00,186 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:43:00,187 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-20 10:43:00,193 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:43:00,200 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-20 10:43:00,205 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:43:00,210 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-20 10:43:00,618 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 131 proven. 12 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-11-20 10:43:00,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:43:00,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [789827126] [2022-11-20 10:43:00,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [789827126] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:43:00,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:43:00,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2022-11-20 10:43:00,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428572192] [2022-11-20 10:43:00,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:43:00,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-20 10:43:00,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:43:00,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-20 10:43:00,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=362, Unknown=3, NotChecked=0, Total=420 [2022-11-20 10:43:00,622 INFO L87 Difference]: Start difference. First operand 215 states and 251 transitions. Second operand has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 10:43:06,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:43:06,287 INFO L93 Difference]: Finished difference Result 219 states and 258 transitions. [2022-11-20 10:43:06,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 10:43:06,289 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 64 [2022-11-20 10:43:06,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:43:06,290 INFO L225 Difference]: With dead ends: 219 [2022-11-20 10:43:06,290 INFO L226 Difference]: Without dead ends: 219 [2022-11-20 10:43:06,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 103 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=104, Invalid=649, Unknown=3, NotChecked=0, Total=756 [2022-11-20 10:43:06,292 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 42 mSDsluCounter, 1879 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 2054 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 270 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:43:06,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 2054 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 700 Invalid, 0 Unknown, 270 Unchecked, 4.1s Time] [2022-11-20 10:43:06,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-11-20 10:43:06,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 214. [2022-11-20 10:43:06,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 137 states have (on average 1.313868613138686) internal successors, (180), 171 states have internal predecessors, (180), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-20 10:43:06,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 250 transitions. [2022-11-20 10:43:06,299 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 250 transitions. Word has length 64 [2022-11-20 10:43:06,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:43:06,300 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 250 transitions. [2022-11-20 10:43:06,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 10:43:06,300 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 250 transitions. [2022-11-20 10:43:06,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-20 10:43:06,301 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:43:06,301 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:43:06,326 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-20 10:43:06,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.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-20 10:43:06,521 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-20 10:43:06,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:43:06,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1825741073, now seen corresponding path program 1 times [2022-11-20 10:43:06,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:43:06,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036810101] [2022-11-20 10:43:06,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:43:06,523 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-20 10:43:06,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:43:06,523 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:43:06,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:43:07,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:43:07,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-20 10:43:07,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:43:07,338 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-20 10:43:07,475 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2649 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |c_DUPFFnew_~ans~0#1.base| v_ArrVal_2649))) is different from true [2022-11-20 10:43:07,486 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2649 (_ BitVec 1))) (= |c_#valid| (store (store |c_old(#valid)| |c_DUPFFnew_~ans~0#1.base| v_ArrVal_2649) |c_DUPFFnew_#t~malloc33#1.base| (_ bv1 1)))) is different from true [2022-11-20 10:43:07,493 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-20 10:43:07,504 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2649 (_ BitVec 1))) (= (store (store |c_old(#valid)| |c_DUPFFnew_~ans~0#1.base| v_ArrVal_2649) (select (select |c_#memory_$Pointer$.base| |c_DUPFFnew_~ans~0#1.base|) (bvadd (_ bv8 32) |c_DUPFFnew_~ans~0#1.offset|)) (_ bv1 1)) |c_#valid|)) is different from true [2022-11-20 10:43:07,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-20 10:43:07,521 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2649 (_ BitVec 1))) (= (store (store |c_old(#valid)| |c_DUPFFnew_~ans~0#1.base| v_ArrVal_2649) |c_DUPFFnew_#t~mem34#1.base| (_ bv1 1)) |c_#valid|)) is different from true [2022-11-20 10:43:07,529 WARN L859 $PredicateComparison]: unable to prove that (exists ((|DUPFFnew_#Ultimate.C_memset_#ptr#1.base| (_ BitVec 32)) (v_ArrVal_2649 (_ BitVec 1))) (= (store (store |c_old(#valid)| |c_DUPFFnew_~ans~0#1.base| v_ArrVal_2649) |DUPFFnew_#Ultimate.C_memset_#ptr#1.base| (_ bv1 1)) |c_#valid|)) is different from true [2022-11-20 10:43:07,697 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:43:07,745 INFO L321 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2022-11-20 10:43:07,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 31 [2022-11-20 10:43:07,926 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 114 trivial. 123 not checked. [2022-11-20 10:43:07,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:43:08,890 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 6 proven. 126 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-11-20 10:43:08,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:43:08,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2036810101] [2022-11-20 10:43:08,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2036810101] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:43:08,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:43:08,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 19 [2022-11-20 10:43:08,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236709225] [2022-11-20 10:43:08,892 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:43:08,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-20 10:43:08,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:43:08,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-20 10:43:08,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=179, Unknown=5, NotChecked=150, Total=380 [2022-11-20 10:43:08,894 INFO L87 Difference]: Start difference. First operand 214 states and 250 transitions. Second operand has 20 states, 18 states have (on average 3.5) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 10:43:11,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:43:11,855 INFO L93 Difference]: Finished difference Result 253 states and 304 transitions. [2022-11-20 10:43:11,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 10:43:11,856 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.5) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 71 [2022-11-20 10:43:11,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:43:11,858 INFO L225 Difference]: With dead ends: 253 [2022-11-20 10:43:11,858 INFO L226 Difference]: Without dead ends: 253 [2022-11-20 10:43:11,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 120 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=119, Invalid=496, Unknown=5, NotChecked=250, Total=870 [2022-11-20 10:43:11,859 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 89 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 2264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1453 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:43:11,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 1138 Invalid, 2264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 786 Invalid, 0 Unknown, 1453 Unchecked, 2.1s Time] [2022-11-20 10:43:11,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-11-20 10:43:11,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 236. [2022-11-20 10:43:11,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 152 states have (on average 1.3289473684210527) internal successors, (202), 187 states have internal predecessors, (202), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (41), 39 states have call predecessors, (41), 39 states have call successors, (41) [2022-11-20 10:43:11,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 282 transitions. [2022-11-20 10:43:11,868 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 282 transitions. Word has length 71 [2022-11-20 10:43:11,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:43:11,869 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 282 transitions. [2022-11-20 10:43:11,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.5) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 10:43:11,870 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 282 transitions. [2022-11-20 10:43:11,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-20 10:43:11,870 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:43:11,871 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:43:11,894 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:43:12,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.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-20 10:43:12,086 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-20 10:43:12,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:43:12,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1825741072, now seen corresponding path program 1 times [2022-11-20 10:43:12,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:43:12,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [907909135] [2022-11-20 10:43:12,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:43:12,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-20 10:43:12,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:43:12,088 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:43:12,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:43:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:43:12,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-20 10:43:12,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:43:13,478 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-20 10:43:13,577 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 29 treesize of output 17 [2022-11-20 10:43:13,609 WARN L859 $PredicateComparison]: unable to prove that (exists ((|DUPFFnew_~ans~0#1.base| (_ BitVec 32)) (v_ArrVal_2939 (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| |DUPFFnew_~ans~0#1.base| v_ArrVal_2939) |c_DUPFFnew_#t~mem34#1.base| (bvadd (_ bv4 32) (bvmul |c_DUPFFnew_#in~maxdeg#1| (_ bv4 32))))) (= (_ bv0 1) (select |c_old(#valid)| |DUPFFnew_~ans~0#1.base|)))) is different from true [2022-11-20 10:43:13,631 WARN L859 $PredicateComparison]: unable to prove that (exists ((|DUPFFnew_#Ultimate.C_memset_#ptr#1.base| (_ BitVec 32)) (|DUPFFnew_~ans~0#1.base| (_ BitVec 32)) (v_ArrVal_2939 (_ BitVec 32))) (and (= (store (store |c_old(#length)| |DUPFFnew_~ans~0#1.base| v_ArrVal_2939) |DUPFFnew_#Ultimate.C_memset_#ptr#1.base| (bvadd (_ bv4 32) (bvmul |c_DUPFFnew_#in~maxdeg#1| (_ bv4 32)))) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |DUPFFnew_~ans~0#1.base|)))) is different from true [2022-11-20 10:43:13,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:43:13,990 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-20 10:43:13,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 29 [2022-11-20 10:43:14,014 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 10:43:14,014 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-20 10:43:14,568 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 114 trivial. 126 not checked. [2022-11-20 10:43:14,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:43:17,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:43:17,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [907909135] [2022-11-20 10:43:17,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [907909135] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:43:17,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1723206867] [2022-11-20 10:43:17,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:43:17,947 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-20 10:43:17,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/cvc4 [2022-11-20 10:43:17,950 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-20 10:43:17,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2022-11-20 10:43:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:43:20,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-20 10:43:20,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:43:20,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-20 10:43:20,496 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-20 10:43:20,654 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:43:20,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-20 10:43:20,685 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 10:43:20,685 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-20 10:43:21,545 WARN L859 $PredicateComparison]: unable to prove that (exists ((|DUPFFnew_#t~malloc33#1.base| (_ BitVec 32)) (|DUPFFnew_~ans~0#1.base| (_ BitVec 32)) (v_ArrVal_2939 (_ BitVec 32))) (and (= (store (store |c_old(#length)| |DUPFFnew_~ans~0#1.base| v_ArrVal_2939) |DUPFFnew_#t~malloc33#1.base| (bvadd (_ bv4 32) (bvmul |c_DUPFFnew_#in~maxdeg#1| (_ bv4 32)))) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |DUPFFnew_~ans~0#1.base|)))) is different from true [2022-11-20 10:43:21,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:43:21,943 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-20 10:43:21,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 23 [2022-11-20 10:43:21,968 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 10:43:21,969 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-20 10:43:22,584 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 114 trivial. 128 not checked. [2022-11-20 10:43:22,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:43:24,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1723206867] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:43:24,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:43:24,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 30 [2022-11-20 10:43:24,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520643318] [2022-11-20 10:43:24,656 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:43:24,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-20 10:43:24,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:43:24,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-20 10:43:24,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1026, Unknown=4, NotChecked=198, Total=1332 [2022-11-20 10:43:24,658 INFO L87 Difference]: Start difference. First operand 236 states and 282 transitions. Second operand has 31 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 24 states have internal predecessors, (89), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 10:43:29,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:43:29,727 INFO L93 Difference]: Finished difference Result 269 states and 324 transitions. [2022-11-20 10:43:29,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 10:43:29,728 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 24 states have internal predecessors, (89), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 71 [2022-11-20 10:43:29,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:43:29,730 INFO L225 Difference]: With dead ends: 269 [2022-11-20 10:43:29,730 INFO L226 Difference]: Without dead ends: 269 [2022-11-20 10:43:29,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=174, Invalid=1726, Unknown=4, NotChecked=258, Total=2162 [2022-11-20 10:43:29,731 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 145 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1810 SdHoareTripleChecker+Invalid, 3234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1756 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:43:29,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1810 Invalid, 3234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1398 Invalid, 0 Unknown, 1756 Unchecked, 3.7s Time] [2022-11-20 10:43:29,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-11-20 10:43:29,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 245. [2022-11-20 10:43:29,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 158 states have (on average 1.3101265822784811) internal successors, (207), 193 states have internal predecessors, (207), 41 states have call successors, (41), 13 states have call predecessors, (41), 14 states have return successors, (44), 41 states have call predecessors, (44), 41 states have call successors, (44) [2022-11-20 10:43:29,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 292 transitions. [2022-11-20 10:43:29,741 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 292 transitions. Word has length 71 [2022-11-20 10:43:29,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:43:29,741 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 292 transitions. [2022-11-20 10:43:29,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 24 states have internal predecessors, (89), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 10:43:29,742 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 292 transitions. [2022-11-20 10:43:29,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-20 10:43:29,743 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:43:29,743 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:43:29,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-11-20 10:43:29,965 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2022-11-20 10:43:30,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/cvc4 --incremental --print-success --lang smt [2022-11-20 10:43:30,157 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-20 10:43:30,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:43:30,157 INFO L85 PathProgramCache]: Analyzing trace with hash -242190254, now seen corresponding path program 1 times [2022-11-20 10:43:30,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:43:30,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2037687991] [2022-11-20 10:43:30,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:43:30,158 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:43:30,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:43:30,159 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:43:30,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:43:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:43:30,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 10:43:30,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:43:31,084 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2022-11-20 10:43:31,084 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:43:31,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:43:31,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2037687991] [2022-11-20 10:43:31,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2037687991] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:43:31,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:43:31,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 10:43:31,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383198907] [2022-11-20 10:43:31,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:43:31,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:43:31,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:43:31,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:43:31,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:43:31,087 INFO L87 Difference]: Start difference. First operand 245 states and 292 transitions. Second operand has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 10:43:31,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:43:31,644 INFO L93 Difference]: Finished difference Result 256 states and 301 transitions. [2022-11-20 10:43:31,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:43:31,645 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 77 [2022-11-20 10:43:31,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:43:31,646 INFO L225 Difference]: With dead ends: 256 [2022-11-20 10:43:31,647 INFO L226 Difference]: Without dead ends: 256 [2022-11-20 10:43:31,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-11-20 10:43:31,648 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 15 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:43:31,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 490 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 58 Unchecked, 0.5s Time] [2022-11-20 10:43:31,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-11-20 10:43:31,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 255. [2022-11-20 10:43:31,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 201 states have internal predecessors, (216), 41 states have call successors, (41), 15 states have call predecessors, (41), 16 states have return successors, (44), 41 states have call predecessors, (44), 41 states have call successors, (44) [2022-11-20 10:43:31,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 301 transitions. [2022-11-20 10:43:31,656 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 301 transitions. Word has length 77 [2022-11-20 10:43:31,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:43:31,657 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 301 transitions. [2022-11-20 10:43:31,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 10:43:31,657 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 301 transitions. [2022-11-20 10:43:31,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-20 10:43:31,658 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:43:31,658 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:43:31,686 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:43:31,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.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-20 10:43:31,878 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-20 10:43:31,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:43:31,878 INFO L85 PathProgramCache]: Analyzing trace with hash -242190253, now seen corresponding path program 1 times [2022-11-20 10:43:31,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:43:31,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1849292823] [2022-11-20 10:43:31,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:43:31,879 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:43:31,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:43:31,880 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:43:31,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:43:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:43:32,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-20 10:43:32,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:43:33,236 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-11-20 10:43:33,236 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:43:33,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:43:33,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1849292823] [2022-11-20 10:43:33,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1849292823] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:43:33,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:43:33,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 10:43:33,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033861512] [2022-11-20 10:43:33,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:43:33,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 10:43:33,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:43:33,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 10:43:33,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-11-20 10:43:33,239 INFO L87 Difference]: Start difference. First operand 255 states and 301 transitions. Second operand has 12 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 10:43:34,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:43:34,642 INFO L93 Difference]: Finished difference Result 255 states and 300 transitions. [2022-11-20 10:43:34,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 10:43:34,643 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 77 [2022-11-20 10:43:34,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:43:34,645 INFO L225 Difference]: With dead ends: 255 [2022-11-20 10:43:34,645 INFO L226 Difference]: Without dead ends: 255 [2022-11-20 10:43:34,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-20 10:43:34,646 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 35 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:43:34,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1191 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 351 Invalid, 0 Unknown, 48 Unchecked, 1.3s Time] [2022-11-20 10:43:34,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-11-20 10:43:34,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2022-11-20 10:43:34,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 166 states have (on average 1.2951807228915662) internal successors, (215), 201 states have internal predecessors, (215), 41 states have call successors, (41), 15 states have call predecessors, (41), 16 states have return successors, (44), 41 states have call predecessors, (44), 41 states have call successors, (44) [2022-11-20 10:43:34,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 300 transitions. [2022-11-20 10:43:34,655 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 300 transitions. Word has length 77 [2022-11-20 10:43:34,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:43:34,656 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 300 transitions. [2022-11-20 10:43:34,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 10:43:34,656 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 300 transitions. [2022-11-20 10:43:34,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-20 10:43:34,657 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:43:34,657 INFO L195 NwaCegarLoop]: trace histogram [20, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:43:34,676 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:43:34,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.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-20 10:43:34,870 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-20 10:43:34,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:43:34,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1112953710, now seen corresponding path program 1 times [2022-11-20 10:43:34,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:43:34,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200741899] [2022-11-20 10:43:34,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:43:34,871 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-20 10:43:34,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:43:34,872 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:43:34,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:43:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:43:35,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-20 10:43:35,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:43:35,941 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2022-11-20 10:43:35,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:43:36,073 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2022-11-20 10:43:36,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:43:36,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [200741899] [2022-11-20 10:43:36,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [200741899] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:43:36,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:43:36,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 12 [2022-11-20 10:43:36,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022960114] [2022-11-20 10:43:36,074 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:43:36,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 10:43:36,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:43:36,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 10:43:36,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:43:36,075 INFO L87 Difference]: Start difference. First operand 255 states and 300 transitions. Second operand has 13 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-20 10:43:37,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:43:37,278 INFO L93 Difference]: Finished difference Result 263 states and 308 transitions. [2022-11-20 10:43:37,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 10:43:37,279 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 86 [2022-11-20 10:43:37,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:43:37,280 INFO L225 Difference]: With dead ends: 263 [2022-11-20 10:43:37,280 INFO L226 Difference]: Without dead ends: 263 [2022-11-20 10:43:37,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 157 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-11-20 10:43:37,282 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 31 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:43:37,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 797 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 341 Invalid, 0 Unknown, 53 Unchecked, 1.1s Time] [2022-11-20 10:43:37,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-11-20 10:43:37,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 262. [2022-11-20 10:43:37,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 171 states have (on average 1.2923976608187135) internal successors, (221), 206 states have internal predecessors, (221), 42 states have call successors, (42), 17 states have call predecessors, (42), 17 states have return successors, (45), 41 states have call predecessors, (45), 42 states have call successors, (45) [2022-11-20 10:43:37,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 308 transitions. [2022-11-20 10:43:37,291 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 308 transitions. Word has length 86 [2022-11-20 10:43:37,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:43:37,291 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 308 transitions. [2022-11-20 10:43:37,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-20 10:43:37,292 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 308 transitions. [2022-11-20 10:43:37,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-20 10:43:37,293 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:43:37,293 INFO L195 NwaCegarLoop]: trace histogram [20, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:43:37,312 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:43:37,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.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-20 10:43:37,506 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-20 10:43:37,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:43:37,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1112953709, now seen corresponding path program 1 times [2022-11-20 10:43:37,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:43:37,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124767527] [2022-11-20 10:43:37,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:43:37,507 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-20 10:43:37,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:43:37,508 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:43:37,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:43:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:43:38,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-20 10:43:38,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:43:39,112 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 135 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-11-20 10:43:39,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:43:40,701 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 24 treesize of output 20 [2022-11-20 10:43:40,990 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 135 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-11-20 10:43:40,990 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:43:40,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124767527] [2022-11-20 10:43:40,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124767527] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:43:40,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:43:40,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2022-11-20 10:43:40,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096639745] [2022-11-20 10:43:40,991 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:43:40,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-20 10:43:40,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:43:40,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-20 10:43:40,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2022-11-20 10:43:40,992 INFO L87 Difference]: Start difference. First operand 262 states and 308 transitions. Second operand has 25 states, 22 states have (on average 3.772727272727273) internal successors, (83), 17 states have internal predecessors, (83), 7 states have call successors, (12), 8 states have call predecessors, (12), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-20 10:43:46,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:43:46,576 INFO L93 Difference]: Finished difference Result 280 states and 328 transitions. [2022-11-20 10:43:46,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 10:43:46,577 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 3.772727272727273) internal successors, (83), 17 states have internal predecessors, (83), 7 states have call successors, (12), 8 states have call predecessors, (12), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 86 [2022-11-20 10:43:46,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:43:46,578 INFO L225 Difference]: With dead ends: 280 [2022-11-20 10:43:46,579 INFO L226 Difference]: Without dead ends: 280 [2022-11-20 10:43:46,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 145 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2022-11-20 10:43:46,580 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 68 mSDsluCounter, 2506 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 2694 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:43:46,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 2694 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1075 Invalid, 0 Unknown, 56 Unchecked, 5.2s Time] [2022-11-20 10:43:46,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-11-20 10:43:46,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 275. [2022-11-20 10:43:46,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 181 states have (on average 1.298342541436464) internal successors, (235), 217 states have internal predecessors, (235), 44 states have call successors, (44), 18 states have call predecessors, (44), 18 states have return successors, (47), 42 states have call predecessors, (47), 44 states have call successors, (47) [2022-11-20 10:43:46,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 326 transitions. [2022-11-20 10:43:46,589 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 326 transitions. Word has length 86 [2022-11-20 10:43:46,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:43:46,589 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 326 transitions. [2022-11-20 10:43:46,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 3.772727272727273) internal successors, (83), 17 states have internal predecessors, (83), 7 states have call successors, (12), 8 states have call predecessors, (12), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-20 10:43:46,590 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 326 transitions. [2022-11-20 10:43:46,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-20 10:43:46,591 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:43:46,591 INFO L195 NwaCegarLoop]: trace histogram [20, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:43:46,612 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:43:46,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.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-20 10:43:46,812 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-20 10:43:46,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:43:46,813 INFO L85 PathProgramCache]: Analyzing trace with hash 194820021, now seen corresponding path program 2 times [2022-11-20 10:43:46,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:43:46,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328546119] [2022-11-20 10:43:46,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:43:46,814 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-20 10:43:46,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:43:46,815 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:43:46,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:43:47,708 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:43:47,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:43:47,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 10:43:47,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:43:47,960 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2022-11-20 10:43:47,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:43:48,052 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-20 10:43:48,052 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 16 treesize of output 15 [2022-11-20 10:43:48,067 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2022-11-20 10:43:48,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:43:48,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328546119] [2022-11-20 10:43:48,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328546119] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:43:48,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:43:48,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2022-11-20 10:43:48,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834383498] [2022-11-20 10:43:48,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:43:48,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:43:48,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:43:48,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:43:48,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:43:48,069 INFO L87 Difference]: Start difference. First operand 275 states and 326 transitions. Second operand has 9 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-20 10:43:49,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:43:49,395 INFO L93 Difference]: Finished difference Result 302 states and 359 transitions. [2022-11-20 10:43:49,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:43:49,395 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 92 [2022-11-20 10:43:49,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:43:49,398 INFO L225 Difference]: With dead ends: 302 [2022-11-20 10:43:49,398 INFO L226 Difference]: Without dead ends: 302 [2022-11-20 10:43:49,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 174 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-11-20 10:43:49,399 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 93 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:43:49,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 968 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 444 Invalid, 0 Unknown, 66 Unchecked, 1.2s Time] [2022-11-20 10:43:49,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-11-20 10:43:49,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 276. [2022-11-20 10:43:49,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 183 states have (on average 1.289617486338798) internal successors, (236), 217 states have internal predecessors, (236), 44 states have call successors, (44), 19 states have call predecessors, (44), 18 states have return successors, (47), 42 states have call predecessors, (47), 44 states have call successors, (47) [2022-11-20 10:43:49,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 327 transitions. [2022-11-20 10:43:49,409 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 327 transitions. Word has length 92 [2022-11-20 10:43:49,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:43:49,410 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 327 transitions. [2022-11-20 10:43:49,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-20 10:43:49,410 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 327 transitions. [2022-11-20 10:43:49,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-20 10:43:49,412 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:43:49,412 INFO L195 NwaCegarLoop]: trace histogram [20, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:43:49,440 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-11-20 10:43:49,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.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-20 10:43:49,626 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-20 10:43:49,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:43:49,627 INFO L85 PathProgramCache]: Analyzing trace with hash 194820022, now seen corresponding path program 2 times [2022-11-20 10:43:49,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:43:49,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822767622] [2022-11-20 10:43:49,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:43:49,627 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-20 10:43:49,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:43:49,628 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:43:49,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:43:50,489 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:43:50,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:43:50,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-20 10:43:50,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:43:51,262 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 7 proven. 143 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-11-20 10:43:51,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:43:51,979 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 8 treesize of output 6 [2022-11-20 10:43:52,289 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:43:52,290 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 16 treesize of output 20 [2022-11-20 10:43:53,444 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 5 proven. 143 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-11-20 10:43:53,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:43:53,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822767622] [2022-11-20 10:43:53,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1822767622] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:43:53,445 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:43:53,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2022-11-20 10:43:53,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637420649] [2022-11-20 10:43:53,446 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:43:53,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-20 10:43:53,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:43:53,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-20 10:43:53,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2022-11-20 10:43:53,447 INFO L87 Difference]: Start difference. First operand 276 states and 327 transitions. Second operand has 29 states, 24 states have (on average 4.0) internal successors, (96), 21 states have internal predecessors, (96), 9 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-11-20 10:44:03,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:44:03,263 INFO L93 Difference]: Finished difference Result 420 states and 516 transitions. [2022-11-20 10:44:03,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 10:44:03,271 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 24 states have (on average 4.0) internal successors, (96), 21 states have internal predecessors, (96), 9 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 92 [2022-11-20 10:44:03,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:44:03,273 INFO L225 Difference]: With dead ends: 420 [2022-11-20 10:44:03,273 INFO L226 Difference]: Without dead ends: 420 [2022-11-20 10:44:03,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 154 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=162, Invalid=1320, Unknown=0, NotChecked=0, Total=1482 [2022-11-20 10:44:03,274 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 299 mSDsluCounter, 4250 mSDsCounter, 0 mSdLazyCounter, 1734 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 4556 SdHoareTripleChecker+Invalid, 1934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:44:03,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 4556 Invalid, 1934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1734 Invalid, 0 Unknown, 136 Unchecked, 8.6s Time] [2022-11-20 10:44:03,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-11-20 10:44:03,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 378. [2022-11-20 10:44:03,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 247 states have (on average 1.3846153846153846) internal successors, (342), 283 states have internal predecessors, (342), 78 states have call successors, (78), 24 states have call predecessors, (78), 22 states have return successors, (82), 76 states have call predecessors, (82), 78 states have call successors, (82) [2022-11-20 10:44:03,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 502 transitions. [2022-11-20 10:44:03,287 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 502 transitions. Word has length 92 [2022-11-20 10:44:03,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:44:03,288 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 502 transitions. [2022-11-20 10:44:03,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 24 states have (on average 4.0) internal successors, (96), 21 states have internal predecessors, (96), 9 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-11-20 10:44:03,288 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 502 transitions. [2022-11-20 10:44:03,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-20 10:44:03,289 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:44:03,289 INFO L195 NwaCegarLoop]: trace histogram [20, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:44:03,305 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:44:03,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.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-20 10:44:03,494 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting DUPFFexgcdErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-20 10:44:03,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:44:03,495 INFO L85 PathProgramCache]: Analyzing trace with hash -947573994, now seen corresponding path program 1 times [2022-11-20 10:44:03,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:44:03,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910219375] [2022-11-20 10:44:03,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:44:03,495 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-20 10:44:03,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:44:03,496 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:44:03,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:44:04,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:44:04,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 10:44:04,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:44:04,273 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2022-11-20 10:44:04,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:44:04,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:44:04,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910219375] [2022-11-20 10:44:04,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1910219375] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:44:04,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:44:04,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:44:04,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399454704] [2022-11-20 10:44:04,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:44:04,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:44:04,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:44:04,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:44:04,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:44:04,276 INFO L87 Difference]: Start difference. First operand 378 states and 502 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-20 10:44:04,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:44:04,288 INFO L93 Difference]: Finished difference Result 365 states and 473 transitions. [2022-11-20 10:44:04,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:44:04,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 92 [2022-11-20 10:44:04,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:44:04,291 INFO L225 Difference]: With dead ends: 365 [2022-11-20 10:44:04,291 INFO L226 Difference]: Without dead ends: 362 [2022-11-20 10:44:04,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 90 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-20 10:44:04,293 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 0 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:44:04,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 389 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:44:04,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-11-20 10:44:04,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2022-11-20 10:44:04,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 235 states have (on average 1.353191489361702) internal successors, (318), 269 states have internal predecessors, (318), 74 states have call successors, (74), 24 states have call predecessors, (74), 22 states have return successors, (78), 74 states have call predecessors, (78), 74 states have call successors, (78) [2022-11-20 10:44:04,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 470 transitions. [2022-11-20 10:44:04,315 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 470 transitions. Word has length 92 [2022-11-20 10:44:04,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:44:04,315 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 470 transitions. [2022-11-20 10:44:04,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-20 10:44:04,317 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 470 transitions. [2022-11-20 10:44:04,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-20 10:44:04,318 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:44:04,318 INFO L195 NwaCegarLoop]: trace histogram [20, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:44:04,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:44:04,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.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-20 10:44:04,539 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-20 10:44:04,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:44:04,540 INFO L85 PathProgramCache]: Analyzing trace with hash -215614999, now seen corresponding path program 1 times [2022-11-20 10:44:04,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:44:04,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991638919] [2022-11-20 10:44:04,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:44:04,540 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-20 10:44:04,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:44:04,542 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:44:04,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:44:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:44:05,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-20 10:44:05,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:44:06,362 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 139 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-11-20 10:44:06,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:44:07,981 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 24 treesize of output 20 [2022-11-20 10:44:08,221 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 139 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-11-20 10:44:08,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:44:08,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991638919] [2022-11-20 10:44:08,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991638919] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:44:08,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:44:08,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2022-11-20 10:44:08,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624158753] [2022-11-20 10:44:08,223 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:44:08,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-20 10:44:08,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:44:08,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-20 10:44:08,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2022-11-20 10:44:08,224 INFO L87 Difference]: Start difference. First operand 362 states and 470 transitions. Second operand has 25 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 17 states have internal predecessors, (85), 7 states have call successors, (16), 8 states have call predecessors, (16), 4 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2022-11-20 10:44:17,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:44:17,751 INFO L93 Difference]: Finished difference Result 431 states and 562 transitions. [2022-11-20 10:44:17,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-20 10:44:17,752 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 17 states have internal predecessors, (85), 7 states have call successors, (16), 8 states have call predecessors, (16), 4 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) Word has length 99 [2022-11-20 10:44:17,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:44:17,754 INFO L225 Difference]: With dead ends: 431 [2022-11-20 10:44:17,754 INFO L226 Difference]: Without dead ends: 431 [2022-11-20 10:44:17,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 168 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=122, Invalid=934, Unknown=0, NotChecked=0, Total=1056 [2022-11-20 10:44:17,755 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 165 mSDsluCounter, 2706 mSDsCounter, 0 mSdLazyCounter, 1790 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 2971 SdHoareTripleChecker+Invalid, 1959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:44:17,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 2971 Invalid, 1959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1790 Invalid, 0 Unknown, 126 Unchecked, 8.6s Time] [2022-11-20 10:44:17,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2022-11-20 10:44:17,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 383. [2022-11-20 10:44:17,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 250 states have (on average 1.34) internal successors, (335), 285 states have internal predecessors, (335), 77 states have call successors, (77), 25 states have call predecessors, (77), 25 states have return successors, (82), 78 states have call predecessors, (82), 77 states have call successors, (82) [2022-11-20 10:44:17,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 494 transitions. [2022-11-20 10:44:17,773 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 494 transitions. Word has length 99 [2022-11-20 10:44:17,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:44:17,774 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 494 transitions. [2022-11-20 10:44:17,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 17 states have internal predecessors, (85), 7 states have call successors, (16), 8 states have call predecessors, (16), 4 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2022-11-20 10:44:17,775 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 494 transitions. [2022-11-20 10:44:17,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-20 10:44:17,776 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:44:17,777 INFO L195 NwaCegarLoop]: trace histogram [20, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:44:17,804 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:44:17,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.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-20 10:44:17,999 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-20 10:44:17,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:44:17,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1134883697, now seen corresponding path program 3 times [2022-11-20 10:44:18,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:44:18,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433254860] [2022-11-20 10:44:18,000 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 10:44:18,000 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-20 10:44:18,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:44:18,002 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:44:18,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:44:19,063 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 10:44:19,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:44:19,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 10:44:19,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:44:19,186 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2022-11-20 10:44:19,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:44:19,267 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-20 10:44:19,268 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 16 treesize of output 15 [2022-11-20 10:44:19,289 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2022-11-20 10:44:19,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:44:19,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433254860] [2022-11-20 10:44:19,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1433254860] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:44:19,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:44:19,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2022-11-20 10:44:19,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841592357] [2022-11-20 10:44:19,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:44:19,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:44:19,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:44:19,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:44:19,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:44:19,291 INFO L87 Difference]: Start difference. First operand 383 states and 494 transitions. Second operand has 8 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-20 10:44:20,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:44:20,687 INFO L93 Difference]: Finished difference Result 413 states and 528 transitions. [2022-11-20 10:44:20,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:44:20,687 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 101 [2022-11-20 10:44:20,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:44:20,690 INFO L225 Difference]: With dead ends: 413 [2022-11-20 10:44:20,690 INFO L226 Difference]: Without dead ends: 413 [2022-11-20 10:44:20,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-11-20 10:44:20,691 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 95 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:44:20,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 939 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-20 10:44:20,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-11-20 10:44:20,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 385. [2022-11-20 10:44:20,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 251 states have (on average 1.3386454183266931) internal successors, (336), 287 states have internal predecessors, (336), 77 states have call successors, (77), 25 states have call predecessors, (77), 26 states have return successors, (83), 78 states have call predecessors, (83), 77 states have call successors, (83) [2022-11-20 10:44:20,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 496 transitions. [2022-11-20 10:44:20,705 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 496 transitions. Word has length 101 [2022-11-20 10:44:20,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:44:20,705 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 496 transitions. [2022-11-20 10:44:20,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-20 10:44:20,706 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 496 transitions. [2022-11-20 10:44:20,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-20 10:44:20,707 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:44:20,707 INFO L195 NwaCegarLoop]: trace histogram [20, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:44:20,728 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:44:20,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.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-20 10:44:20,922 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-20 10:44:20,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:44:20,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1134883696, now seen corresponding path program 3 times [2022-11-20 10:44:20,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:44:20,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475631469] [2022-11-20 10:44:20,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 10:44:20,923 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-20 10:44:20,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:44:20,924 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:44:20,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:44:22,180 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 10:44:22,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:44:22,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-20 10:44:22,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:44:22,830 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 21 proven. 139 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2022-11-20 10:44:22,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:44:23,516 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 8 treesize of output 6 [2022-11-20 10:44:23,805 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:44:23,805 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 16 treesize of output 20 [2022-11-20 10:44:25,249 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 21 proven. 139 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2022-11-20 10:44:25,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:44:25,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475631469] [2022-11-20 10:44:25,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475631469] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:44:25,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:44:25,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2022-11-20 10:44:25,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965657686] [2022-11-20 10:44:25,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:44:25,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-20 10:44:25,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:44:25,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-20 10:44:25,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2022-11-20 10:44:25,252 INFO L87 Difference]: Start difference. First operand 385 states and 496 transitions. Second operand has 32 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 22 states have internal predecessors, (96), 11 states have call successors, (19), 9 states have call predecessors, (19), 5 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2022-11-20 10:44:40,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:44:40,606 INFO L93 Difference]: Finished difference Result 525 states and 635 transitions. [2022-11-20 10:44:40,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-20 10:44:40,608 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 22 states have internal predecessors, (96), 11 states have call successors, (19), 9 states have call predecessors, (19), 5 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) Word has length 101 [2022-11-20 10:44:40,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:44:40,612 INFO L225 Difference]: With dead ends: 525 [2022-11-20 10:44:40,612 INFO L226 Difference]: Without dead ends: 525 [2022-11-20 10:44:40,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=283, Invalid=2167, Unknown=0, NotChecked=0, Total=2450 [2022-11-20 10:44:40,614 INFO L413 NwaCegarLoop]: 417 mSDtfsCounter, 1012 mSDsluCounter, 5200 mSDsCounter, 0 mSdLazyCounter, 2443 mSolverCounterSat, 568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 5617 SdHoareTripleChecker+Invalid, 3011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 568 IncrementalHoareTripleChecker+Valid, 2443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2022-11-20 10:44:40,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 5617 Invalid, 3011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [568 Valid, 2443 Invalid, 0 Unknown, 0 Unchecked, 12.8s Time] [2022-11-20 10:44:40,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2022-11-20 10:44:40,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 446. [2022-11-20 10:44:40,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 286 states have (on average 1.3951048951048952) internal successors, (399), 325 states have internal predecessors, (399), 103 states have call successors, (103), 26 states have call predecessors, (103), 26 states have return successors, (105), 103 states have call predecessors, (105), 103 states have call successors, (105) [2022-11-20 10:44:40,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 607 transitions. [2022-11-20 10:44:40,629 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 607 transitions. Word has length 101 [2022-11-20 10:44:40,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:44:40,630 INFO L495 AbstractCegarLoop]: Abstraction has 446 states and 607 transitions. [2022-11-20 10:44:40,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 22 states have internal predecessors, (96), 11 states have call successors, (19), 9 states have call predecessors, (19), 5 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2022-11-20 10:44:40,630 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 607 transitions. [2022-11-20 10:44:40,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-20 10:44:40,631 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:44:40,632 INFO L195 NwaCegarLoop]: trace histogram [20, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:44:40,658 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-11-20 10:44:40,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.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-20 10:44:40,853 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting DUPFFexgcdErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-20 10:44:40,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:44:40,853 INFO L85 PathProgramCache]: Analyzing trace with hash 2143025534, now seen corresponding path program 1 times [2022-11-20 10:44:40,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:44:40,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [584847191] [2022-11-20 10:44:40,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:44:40,854 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-20 10:44:40,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:44:40,856 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:44:40,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:44:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:44:42,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-20 10:44:42,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:44:42,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 38 [2022-11-20 10:44:42,860 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 10:44:42,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 42 treesize of output 18 [2022-11-20 10:44:42,949 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2022-11-20 10:44:42,949 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:44:42,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:44:42,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [584847191] [2022-11-20 10:44:42,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [584847191] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:44:42,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:44:42,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-20 10:44:42,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087515188] [2022-11-20 10:44:42,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:44:42,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 10:44:42,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:44:42,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 10:44:42,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-11-20 10:44:42,952 INFO L87 Difference]: Start difference. First operand 446 states and 607 transitions. Second operand has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-20 10:44:43,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:44:43,767 INFO L93 Difference]: Finished difference Result 383 states and 484 transitions. [2022-11-20 10:44:43,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 10:44:43,768 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 99 [2022-11-20 10:44:43,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:44:43,769 INFO L225 Difference]: With dead ends: 383 [2022-11-20 10:44:43,769 INFO L226 Difference]: Without dead ends: 367 [2022-11-20 10:44:43,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 79 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-11-20 10:44:43,770 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 12 mSDsluCounter, 2173 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2357 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:44:43,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2357 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 166 Unchecked, 0.7s Time] [2022-11-20 10:44:43,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-11-20 10:44:43,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2022-11-20 10:44:43,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 238 states have (on average 1.3361344537815125) internal successors, (318), 274 states have internal predecessors, (318), 74 states have call successors, (74), 24 states have call predecessors, (74), 24 states have return successors, (76), 74 states have call predecessors, (76), 74 states have call successors, (76) [2022-11-20 10:44:43,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 468 transitions. [2022-11-20 10:44:43,782 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 468 transitions. Word has length 99 [2022-11-20 10:44:43,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:44:43,783 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 468 transitions. [2022-11-20 10:44:43,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-20 10:44:43,783 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 468 transitions. [2022-11-20 10:44:43,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-20 10:44:43,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:44:43,785 INFO L195 NwaCegarLoop]: trace histogram [20, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:44:43,811 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:44:44,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.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-20 10:44:44,011 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting DUPFFexgcdErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-20 10:44:44,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:44:44,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1221664532, now seen corresponding path program 1 times [2022-11-20 10:44:44,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:44:44,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2007906397] [2022-11-20 10:44:44,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:44:44,012 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-20 10:44:44,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:44:44,013 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:44:44,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:44:44,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:44:44,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-20 10:44:44,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:44:46,044 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 131 proven. 4 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-11-20 10:44:46,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:44:47,409 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 8 treesize of output 6 [2022-11-20 10:44:47,524 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 131 proven. 4 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-11-20 10:44:47,524 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:44:47,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2007906397] [2022-11-20 10:44:47,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2007906397] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:44:47,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:44:47,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2022-11-20 10:44:47,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782903737] [2022-11-20 10:44:47,525 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:44:47,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-20 10:44:47,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:44:47,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-20 10:44:47,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2022-11-20 10:44:47,527 INFO L87 Difference]: Start difference. First operand 367 states and 468 transitions. Second operand has 21 states, 20 states have (on average 4.55) internal successors, (91), 15 states have internal predecessors, (91), 7 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-11-20 10:44:52,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:44:52,922 INFO L93 Difference]: Finished difference Result 381 states and 476 transitions. [2022-11-20 10:44:52,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 10:44:52,924 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.55) internal successors, (91), 15 states have internal predecessors, (91), 7 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) Word has length 113 [2022-11-20 10:44:52,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:44:52,925 INFO L225 Difference]: With dead ends: 381 [2022-11-20 10:44:52,925 INFO L226 Difference]: Without dead ends: 381 [2022-11-20 10:44:52,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 194 SyntacticMatches, 12 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2022-11-20 10:44:52,926 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 129 mSDsluCounter, 1997 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 2203 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:44:52,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 2203 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1232 Invalid, 0 Unknown, 63 Unchecked, 5.1s Time] [2022-11-20 10:44:52,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-11-20 10:44:52,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2022-11-20 10:44:52,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 246 states have (on average 1.3170731707317074) internal successors, (324), 282 states have internal predecessors, (324), 74 states have call successors, (74), 26 states have call predecessors, (74), 26 states have return successors, (76), 74 states have call predecessors, (76), 74 states have call successors, (76) [2022-11-20 10:44:52,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 474 transitions. [2022-11-20 10:44:52,937 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 474 transitions. Word has length 113 [2022-11-20 10:44:52,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:44:52,938 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 474 transitions. [2022-11-20 10:44:52,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.55) internal successors, (91), 15 states have internal predecessors, (91), 7 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-11-20 10:44:52,938 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 474 transitions. [2022-11-20 10:44:52,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-11-20 10:44:52,940 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:44:52,940 INFO L195 NwaCegarLoop]: trace histogram [20, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:44:52,970 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:44:53,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.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-20 10:44:53,161 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting DUPFFexgcdErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-20 10:44:53,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:44:53,161 INFO L85 PathProgramCache]: Analyzing trace with hash 783105185, now seen corresponding path program 1 times [2022-11-20 10:44:53,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:44:53,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [687619647] [2022-11-20 10:44:53,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:44:53,162 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-20 10:44:53,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:44:53,163 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:44:53,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:44:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:44:54,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-20 10:44:54,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:44:54,748 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-20 10:44:54,799 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-20 10:44:54,800 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-20 10:44:54,846 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-20 10:44:55,090 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:44:55,090 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 39 treesize of output 37 [2022-11-20 10:44:55,141 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:44:55,142 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 39 treesize of output 37 [2022-11-20 10:44:55,183 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:44:55,183 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 39 treesize of output 37 [2022-11-20 10:44:55,231 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:44:55,231 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 39 treesize of output 37 [2022-11-20 10:44:55,276 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:44:55,276 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 39 treesize of output 37 [2022-11-20 10:44:55,326 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:44:55,326 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 39 treesize of output 37 [2022-11-20 10:44:55,370 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:44:55,370 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 39 treesize of output 37 [2022-11-20 10:44:55,413 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:44:55,414 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 39 treesize of output 37 [2022-11-20 10:44:55,470 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:44:55,470 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 39 treesize of output 37 [2022-11-20 10:44:55,514 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:44:55,515 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 39 treesize of output 37 [2022-11-20 10:44:55,571 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:44:55,571 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 39 treesize of output 37 [2022-11-20 10:44:55,613 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:44:55,613 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-20 10:44:55,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:44:55,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:44:55,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:44:55,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:44:55,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2022-11-20 10:44:55,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-11-20 10:44:55,965 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:44:55,965 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 32 treesize of output 33 [2022-11-20 10:44:56,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:44:56,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:44:56,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:44:56,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:44:56,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 55 [2022-11-20 10:44:57,542 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 27 treesize of output 15 [2022-11-20 10:44:57,618 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 131 proven. 16 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2022-11-20 10:44:57,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:45:00,250 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6875 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~g~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~g~0#1.base|) .cse0) v_ArrVal_6875) |c_ULTIMATE.start_main_~g~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-20 10:45:00,264 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6875 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_#t~ret67#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~ret67#1.base|) .cse0) v_ArrVal_6875) |c_ULTIMATE.start_main_#t~ret67#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-20 10:45:05,310 WARN L233 SmtUtils]: Spent 5.04s on a formula simplification that was a NOOP. DAG size: 135 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 10:45:06,087 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6875 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_DUPFFnew_#res#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_DUPFFnew_#res#1.base|) .cse0) v_ArrVal_6875) |c_DUPFFnew_#res#1.base|) .cse0)))) (_ bv0 1))) is different from false [2022-11-20 10:45:06,106 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6875 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_DUPFFnew_~ans~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_DUPFFnew_~ans~0#1.base|) .cse0) v_ArrVal_6875) |c_DUPFFnew_~ans~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2022-11-20 10:45:08,125 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6874 (_ BitVec 32)) (v_ArrVal_6873 (_ BitVec 32)) (v_ArrVal_6872 (_ BitVec 32)) (v_ArrVal_6871 (_ BitVec 32)) (v_ArrVal_6875 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_DUPFFnew_~ans~0#1.offset|))) (select (select (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_DUPFFnew_~ans~0#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_DUPFFnew_~ans~0#1.base| (store (store (store (store .cse0 (bvadd (_ bv4 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_6874) (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv5 32)) v_ArrVal_6873) (bvadd (_ bv6 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_6872) (bvadd (_ bv7 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_6871)) (select .cse0 .cse1) v_ArrVal_6875)) |c_DUPFFnew_~ans~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-20 10:45:10,152 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6865 (_ BitVec 32)) (v_ArrVal_6874 (_ BitVec 32)) (v_ArrVal_6873 (_ BitVec 32)) (v_ArrVal_6872 (_ BitVec 32)) (v_ArrVal_6871 (_ BitVec 32)) (v_ArrVal_6875 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6869 (_ BitVec 32)) (v_ArrVal_6868 (_ BitVec 32)) (v_ArrVal_6867 (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_DUPFFnew_~ans~0#1.offset|))) (select (select (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_DUPFFnew_~ans~0#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_DUPFFnew_~ans~0#1.base| (store (store (store (store (store (store (store (store .cse0 |c_DUPFFnew_~ans~0#1.offset| v_ArrVal_6865) (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv1 32)) v_ArrVal_6869) (bvadd (_ bv2 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_6868) (bvadd (_ bv3 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_6867) (bvadd (_ bv4 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_6874) (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv5 32)) v_ArrVal_6873) (bvadd (_ bv6 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_6872) (bvadd (_ bv7 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_6871)) (select .cse0 .cse1) v_ArrVal_6875)) |c_DUPFFnew_~ans~0#1.base|) .cse1)))))) is different from false [2022-11-20 10:45:12,708 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6865 (_ BitVec 32)) (v_ArrVal_6874 (_ BitVec 32)) (v_ArrVal_6873 (_ BitVec 32)) (v_ArrVal_6872 (_ BitVec 32)) (v_ArrVal_6871 (_ BitVec 32)) (v_ArrVal_6864 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6875 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6869 (_ BitVec 32)) (v_ArrVal_6868 (_ BitVec 32)) (v_ArrVal_6867 (_ BitVec 32))) (= (bvadd (select |c_#valid| (let ((.cse2 (bvadd (_ bv8 32) |c_DUPFFnew_~ans~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_DUPFFnew_#t~mem34#1.base| v_ArrVal_6864))) (let ((.cse1 (select .cse0 |c_DUPFFnew_~ans~0#1.base|))) (store (store .cse0 |c_DUPFFnew_~ans~0#1.base| (store (store (store (store (store (store (store (store .cse1 |c_DUPFFnew_~ans~0#1.offset| v_ArrVal_6865) (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv1 32)) v_ArrVal_6869) (bvadd (_ bv2 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_6868) (bvadd (_ bv3 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_6867) (bvadd (_ bv4 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_6874) (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv5 32)) v_ArrVal_6873) (bvadd (_ bv6 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_6872) (bvadd (_ bv7 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_6871)) (select .cse1 .cse2) v_ArrVal_6875))) |c_DUPFFnew_~ans~0#1.base|) .cse2))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-20 10:45:12,735 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6865 (_ BitVec 32)) (v_ArrVal_6874 (_ BitVec 32)) (v_ArrVal_6873 (_ BitVec 32)) (v_ArrVal_6872 (_ BitVec 32)) (v_ArrVal_6871 (_ BitVec 32)) (v_ArrVal_6864 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6875 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6869 (_ BitVec 32)) (v_ArrVal_6868 (_ BitVec 32)) (v_ArrVal_6867 (_ BitVec 32))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse2 (bvadd (_ bv8 32) |c_DUPFFnew_~ans~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_DUPFFnew_~ans~0#1.base|) .cse2) v_ArrVal_6864))) (let ((.cse1 (select .cse0 |c_DUPFFnew_~ans~0#1.base|))) (store (store .cse0 |c_DUPFFnew_~ans~0#1.base| (store (store (store (store (store (store (store (store .cse1 |c_DUPFFnew_~ans~0#1.offset| v_ArrVal_6865) (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv1 32)) v_ArrVal_6869) (bvadd (_ bv2 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_6868) (bvadd (_ bv3 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_6867) (bvadd (_ bv4 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_6874) (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv5 32)) v_ArrVal_6873) (bvadd (_ bv6 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_6872) (bvadd (_ bv7 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_6871)) (select .cse1 .cse2) v_ArrVal_6875))) |c_DUPFFnew_~ans~0#1.base|) .cse2))) (_ bv1 1)))) is different from false [2022-11-20 10:45:12,771 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:45:12,771 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 104 treesize of output 85 [2022-11-20 10:45:12,778 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 106 treesize of output 82 [2022-11-20 10:45:12,786 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 44 treesize of output 32 [2022-11-20 10:45:12,789 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 66 treesize of output 58 [2022-11-20 10:45:15,147 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 131 proven. 4 refuted. 0 times theorem prover too weak. 178 trivial. 12 not checked. [2022-11-20 10:45:15,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:45:15,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [687619647] [2022-11-20 10:45:15,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [687619647] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:45:15,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:45:15,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 34 [2022-11-20 10:45:15,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404122484] [2022-11-20 10:45:15,148 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:45:15,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-20 10:45:15,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:45:15,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-20 10:45:15,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=624, Unknown=10, NotChecked=456, Total=1190 [2022-11-20 10:45:15,150 INFO L87 Difference]: Start difference. First operand 377 states and 474 transitions. Second operand has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 29 states have internal predecessors, (95), 7 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-11-20 10:45:18,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:45:18,786 INFO L93 Difference]: Finished difference Result 387 states and 489 transitions. [2022-11-20 10:45:18,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 10:45:18,787 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 29 states have internal predecessors, (95), 7 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) Word has length 114 [2022-11-20 10:45:18,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:45:18,789 INFO L225 Difference]: With dead ends: 387 [2022-11-20 10:45:18,789 INFO L226 Difference]: Without dead ends: 387 [2022-11-20 10:45:18,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 183 SyntacticMatches, 19 SemanticMatches, 39 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=145, Invalid=933, Unknown=10, NotChecked=552, Total=1640 [2022-11-20 10:45:18,791 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 137 mSDsluCounter, 2562 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 2771 SdHoareTripleChecker+Invalid, 2501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1628 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-20 10:45:18,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 2771 Invalid, 2501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 862 Invalid, 0 Unknown, 1628 Unchecked, 2.8s Time] [2022-11-20 10:45:18,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-11-20 10:45:18,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 377. [2022-11-20 10:45:18,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 246 states have (on average 1.3089430894308942) internal successors, (322), 282 states have internal predecessors, (322), 74 states have call successors, (74), 26 states have call predecessors, (74), 26 states have return successors, (76), 74 states have call predecessors, (76), 74 states have call successors, (76) [2022-11-20 10:45:18,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 472 transitions. [2022-11-20 10:45:18,814 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 472 transitions. Word has length 114 [2022-11-20 10:45:18,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:45:18,814 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 472 transitions. [2022-11-20 10:45:18,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 29 states have internal predecessors, (95), 7 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-11-20 10:45:18,815 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 472 transitions. [2022-11-20 10:45:18,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-11-20 10:45:18,816 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:45:18,816 INFO L195 NwaCegarLoop]: trace histogram [20, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:45:18,845 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:45:19,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.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-20 10:45:19,030 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting DUPFFexgcdErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-20 10:45:19,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:45:19,031 INFO L85 PathProgramCache]: Analyzing trace with hash 783105186, now seen corresponding path program 1 times [2022-11-20 10:45:19,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:45:19,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1774734291] [2022-11-20 10:45:19,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:45:19,032 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-20 10:45:19,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:45:19,034 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:45:19,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:45:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:20,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 86 conjunts are in the unsatisfiable core [2022-11-20 10:45:20,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:45:20,555 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-20 10:45:20,612 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 10:45:20,613 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-20 10:45:20,625 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 10 treesize of output 9 [2022-11-20 10:45:20,680 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-20 10:45:20,711 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-20 10:45:21,032 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:45:21,032 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 16 treesize of output 22 [2022-11-20 10:45:21,037 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 7 treesize of output 3 [2022-11-20 10:45:21,071 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:45:21,071 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 41 treesize of output 39 [2022-11-20 10:45:21,153 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:45:21,153 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 16 treesize of output 22 [2022-11-20 10:45:21,159 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 7 treesize of output 3 [2022-11-20 10:45:21,193 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:45:21,194 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 41 treesize of output 39 [2022-11-20 10:45:21,274 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:45:21,274 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 41 treesize of output 39 [2022-11-20 10:45:21,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:45:21,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 10:45:21,336 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:45:21,336 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 41 treesize of output 39 [2022-11-20 10:45:21,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:45:21,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 10:45:21,399 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:45:21,399 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 16 treesize of output 22 [2022-11-20 10:45:21,408 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 7 treesize of output 3 [2022-11-20 10:45:21,441 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:45:21,441 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 41 treesize of output 39 [2022-11-20 10:45:21,521 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:45:21,521 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 16 treesize of output 22 [2022-11-20 10:45:21,541 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 7 treesize of output 3 [2022-11-20 10:45:21,586 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:45:21,586 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 41 treesize of output 39 [2022-11-20 10:45:21,669 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:45:21,670 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 16 treesize of output 22 [2022-11-20 10:45:21,679 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 7 treesize of output 3 [2022-11-20 10:45:21,711 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:45:21,711 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 41 treesize of output 39 [2022-11-20 10:45:21,792 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:45:21,792 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 41 treesize of output 39 [2022-11-20 10:45:21,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:45:21,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 10:45:21,863 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:45:21,863 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 41 treesize of output 39 [2022-11-20 10:45:21,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:45:21,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 10:45:21,932 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:45:21,932 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 41 treesize of output 39 [2022-11-20 10:45:21,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:45:21,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 10:45:22,009 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:45:22,009 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 16 treesize of output 22 [2022-11-20 10:45:22,016 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 7 treesize of output 3 [2022-11-20 10:45:22,057 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:45:22,057 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 41 treesize of output 39 [2022-11-20 10:45:22,144 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:45:22,144 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 50 treesize of output 49 [2022-11-20 10:45:22,166 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-20 10:45:22,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:45:22,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:45:22,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:45:22,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:45:22,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 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-20 10:45:22,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:45:22,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:45:22,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:45:22,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:45:22,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-11-20 10:45:22,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 59 [2022-11-20 10:45:22,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2022-11-20 10:45:22,679 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:45:22,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2022-11-20 10:45:22,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:45:22,691 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 22 [2022-11-20 10:45:22,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:45:22,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:45:22,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:45:22,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:45:22,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 53 [2022-11-20 10:45:22,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:45:22,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:45:22,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:45:22,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:45:22,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 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-20 10:45:24,600 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-20 10:45:24,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-20 10:45:24,675 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 131 proven. 16 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2022-11-20 10:45:24,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:45:25,993 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~g~0#1.offset| (_ bv8 32)))) (and (forall ((v_ArrVal_7252 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7253 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem68#1.base| v_ArrVal_7253) |c_ULTIMATE.start_main_~g~0#1.base|) .cse0) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem68#1.base| v_ArrVal_7252) |c_ULTIMATE.start_main_~g~0#1.base|) .cse0)))) (forall ((v_ArrVal_7253 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem68#1.base| v_ArrVal_7253) |c_ULTIMATE.start_main_~g~0#1.base|) .cse0))) (bvule .cse1 (bvadd .cse1 (_ bv4 32))))))) is different from false [2022-11-20 10:45:26,028 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~g~0#1.offset| (_ bv8 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~g~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7253 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7253) |c_ULTIMATE.start_main_~g~0#1.base|) .cse2))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_7252 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7253 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7253) |c_ULTIMATE.start_main_~g~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7252) |c_ULTIMATE.start_main_~g~0#1.base|) .cse2))))))) is different from false [2022-11-20 10:45:26,072 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_#t~ret67#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~ret67#1.base|) .cse1))) (and (forall ((v_ArrVal_7252 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7253 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7253) |c_ULTIMATE.start_main_#t~ret67#1.base|) .cse1) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7252) |c_ULTIMATE.start_main_#t~ret67#1.base|) .cse1)))) (forall ((v_ArrVal_7253 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7253) |c_ULTIMATE.start_main_#t~ret67#1.base|) .cse1))) (bvule .cse2 (bvadd .cse2 (_ bv4 32)))))))) is different from false [2022-11-20 10:46:46,483 WARN L233 SmtUtils]: Spent 1.34m on a formula simplification that was a NOOP. DAG size: 228 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 10:47:21,544 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:47:21,545 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 163 treesize of output 134 [2022-11-20 10:47:21,566 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 172 treesize of output 154 [2022-11-20 10:47:21,619 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:47:21,620 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 150 treesize of output 120 [2022-11-20 10:47:21,638 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 176 treesize of output 146 [2022-11-20 10:47:21,657 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 106 treesize of output 90 [2022-11-20 10:47:21,674 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 90 treesize of output 74 [2022-11-20 10:47:21,700 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 40 treesize of output 32 [2022-11-20 10:47:21,893 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:47:21,893 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 165 treesize of output 156 [2022-11-20 10:47:21,905 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:47:21,916 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 240 treesize of output 228 [2022-11-20 10:47:21,958 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:47:21,958 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 224 treesize of output 154 [2022-11-20 10:47:21,969 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:47:21,980 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 132 treesize of output 78 [2022-11-20 10:47:22,001 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 74 treesize of output 66 [2022-11-20 10:47:22,023 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 36 treesize of output 28 [2022-11-20 10:47:23,129 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 131 proven. 16 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2022-11-20 10:47:23,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:47:23,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1774734291] [2022-11-20 10:47:23,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1774734291] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:47:23,130 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:47:23,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 33 [2022-11-20 10:47:23,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411297667] [2022-11-20 10:47:23,130 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:47:23,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-20 10:47:23,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:47:23,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-20 10:47:23,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=828, Unknown=16, NotChecked=180, Total=1122 [2022-11-20 10:47:23,132 INFO L87 Difference]: Start difference. First operand 377 states and 472 transitions. Second operand has 34 states, 33 states have (on average 2.878787878787879) internal successors, (95), 28 states have internal predecessors, (95), 7 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-11-20 10:47:32,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:32,917 INFO L93 Difference]: Finished difference Result 384 states and 485 transitions. [2022-11-20 10:47:32,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 10:47:32,919 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.878787878787879) internal successors, (95), 28 states have internal predecessors, (95), 7 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) Word has length 114 [2022-11-20 10:47:32,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:32,921 INFO L225 Difference]: With dead ends: 384 [2022-11-20 10:47:32,921 INFO L226 Difference]: Without dead ends: 384 [2022-11-20 10:47:32,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 178 SyntacticMatches, 21 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 29.7s TimeCoverageRelationStatistics Valid=142, Invalid=1186, Unknown=16, NotChecked=216, Total=1560 [2022-11-20 10:47:32,922 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 103 mSDsluCounter, 2596 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 2793 SdHoareTripleChecker+Invalid, 1527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 836 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:32,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 2793 Invalid, 1527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 681 Invalid, 0 Unknown, 836 Unchecked, 7.5s Time] [2022-11-20 10:47:32,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-11-20 10:47:32,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 377. [2022-11-20 10:47:32,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 246 states have (on average 1.3008130081300813) internal successors, (320), 282 states have internal predecessors, (320), 74 states have call successors, (74), 26 states have call predecessors, (74), 26 states have return successors, (76), 74 states have call predecessors, (76), 74 states have call successors, (76) [2022-11-20 10:47:32,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 470 transitions. [2022-11-20 10:47:32,933 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 470 transitions. Word has length 114 [2022-11-20 10:47:32,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:32,933 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 470 transitions. [2022-11-20 10:47:32,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.878787878787879) internal successors, (95), 28 states have internal predecessors, (95), 7 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-11-20 10:47:32,934 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 470 transitions. [2022-11-20 10:47:32,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-11-20 10:47:32,935 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:32,936 INFO L195 NwaCegarLoop]: trace histogram [20, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:47:32,963 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:47:33,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.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-20 10:47:33,157 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-20 10:47:33,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:33,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1590709928, now seen corresponding path program 1 times [2022-11-20 10:47:33,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:47:33,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1003810264] [2022-11-20 10:47:33,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:33,159 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-20 10:47:33,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:47:33,159 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:47:33,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:47:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:47:35,369 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:47:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:47:36,810 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-20 10:47:36,810 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 10:47:36,811 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (54 of 55 remaining) [2022-11-20 10:47:36,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 55 remaining) [2022-11-20 10:47:36,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 55 remaining) [2022-11-20 10:47:36,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 55 remaining) [2022-11-20 10:47:36,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 55 remaining) [2022-11-20 10:47:36,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 55 remaining) [2022-11-20 10:47:36,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 55 remaining) [2022-11-20 10:47:36,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE (47 of 55 remaining) [2022-11-20 10:47:36,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE (46 of 55 remaining) [2022-11-20 10:47:36,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 55 remaining) [2022-11-20 10:47:36,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 55 remaining) [2022-11-20 10:47:36,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 55 remaining) [2022-11-20 10:47:36,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 55 remaining) [2022-11-20 10:47:36,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 55 remaining) [2022-11-20 10:47:36,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 55 remaining) [2022-11-20 10:47:36,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 55 remaining) [2022-11-20 10:47:36,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 55 remaining) [2022-11-20 10:47:36,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 55 remaining) [2022-11-20 10:47:36,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 55 remaining) [2022-11-20 10:47:36,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 55 remaining) [2022-11-20 10:47:36,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 55 remaining) [2022-11-20 10:47:36,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 55 remaining) [2022-11-20 10:47:36,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 55 remaining) [2022-11-20 10:47:36,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 55 remaining) [2022-11-20 10:47:36,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 55 remaining) [2022-11-20 10:47:36,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 55 remaining) [2022-11-20 10:47:36,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 55 remaining) [2022-11-20 10:47:36,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 55 remaining) [2022-11-20 10:47:36,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 55 remaining) [2022-11-20 10:47:36,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 55 remaining) [2022-11-20 10:47:36,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 55 remaining) [2022-11-20 10:47:36,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 55 remaining) [2022-11-20 10:47:36,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 55 remaining) [2022-11-20 10:47:36,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 55 remaining) [2022-11-20 10:47:36,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 55 remaining) [2022-11-20 10:47:36,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 55 remaining) [2022-11-20 10:47:36,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 55 remaining) [2022-11-20 10:47:36,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 55 remaining) [2022-11-20 10:47:36,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 55 remaining) [2022-11-20 10:47:36,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 55 remaining) [2022-11-20 10:47:36,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 55 remaining) [2022-11-20 10:47:36,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 55 remaining) [2022-11-20 10:47:36,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 55 remaining) [2022-11-20 10:47:36,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 55 remaining) [2022-11-20 10:47:36,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 55 remaining) [2022-11-20 10:47:36,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 55 remaining) [2022-11-20 10:47:36,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 55 remaining) [2022-11-20 10:47:36,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 55 remaining) [2022-11-20 10:47:36,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 55 remaining) [2022-11-20 10:47:36,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 55 remaining) [2022-11-20 10:47:36,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 55 remaining) [2022-11-20 10:47:36,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 55 remaining) [2022-11-20 10:47:36,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 55 remaining) [2022-11-20 10:47:36,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 55 remaining) [2022-11-20 10:47:36,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 55 remaining) [2022-11-20 10:47:36,858 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2022-11-20 10:47:37,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/mathsat -theory.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-20 10:47:37,050 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:47:37,054 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:47:37,065 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,066 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,066 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,066 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,067 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,067 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,067 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,067 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,068 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,068 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,068 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,069 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,069 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,070 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,070 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,072 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,073 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,073 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,073 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,073 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,074 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,077 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,078 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,078 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,078 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,078 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,079 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-20 10:47:37,079 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-20 10:47:37,079 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,079 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,079 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-20 10:47:37,080 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-20 10:47:37,080 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,080 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,080 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-20 10:47:37,085 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-20 10:47:37,085 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,086 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,086 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-20 10:47:37,086 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-20 10:47:37,086 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,086 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,087 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-20 10:47:37,087 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-20 10:47:37,088 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,088 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,088 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,088 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,088 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,089 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,089 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,089 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,089 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,093 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,093 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,094 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,094 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,094 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,094 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,094 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,095 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,095 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,095 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,095 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,096 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,096 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,096 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,096 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,096 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,096 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,097 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,097 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,097 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,097 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,097 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,101 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,101 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,101 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,101 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-20 10:47:37,102 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-20 10:47:37,102 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,102 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,102 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-20 10:47:37,102 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-20 10:47:37,102 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,103 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,103 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-20 10:47:37,103 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-20 10:47:37,103 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,103 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,104 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-20 10:47:37,104 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-20 10:47:37,104 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,104 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-20 10:47:37,104 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-20 10:47:37,104 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-20 10:47:37,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:47:37 BoogieIcfgContainer [2022-11-20 10:47:37,153 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:47:37,153 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:47:37,153 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:47:37,174 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:47:37,175 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:39:31" (3/4) ... [2022-11-20 10:47:37,178 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 10:47:37,178 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:47:37,178 INFO L158 Benchmark]: Toolchain (without parser) took 488463.66ms. Allocated memory was 60.8MB in the beginning and 130.0MB in the end (delta: 69.2MB). Free memory was 27.4MB in the beginning and 27.5MB in the end (delta: -84.5kB). Peak memory consumption was 70.1MB. Max. memory is 16.1GB. [2022-11-20 10:47:37,178 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 60.8MB. Free memory is still 39.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:47:37,179 INFO L158 Benchmark]: CACSL2BoogieTranslator took 961.66ms. Allocated memory is still 88.1MB. Free memory was 69.2MB in the beginning and 53.6MB in the end (delta: 15.6MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. [2022-11-20 10:47:37,179 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.15ms. Allocated memory is still 88.1MB. Free memory was 53.6MB in the beginning and 50.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:47:37,179 INFO L158 Benchmark]: Boogie Preprocessor took 57.50ms. Allocated memory is still 88.1MB. Free memory was 50.9MB in the beginning and 48.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:47:37,179 INFO L158 Benchmark]: RCFGBuilder took 1494.55ms. Allocated memory is still 88.1MB. Free memory was 48.4MB in the beginning and 57.0MB in the end (delta: -8.6MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2022-11-20 10:47:37,180 INFO L158 Benchmark]: TraceAbstraction took 485834.29ms. Allocated memory was 88.1MB in the beginning and 130.0MB in the end (delta: 41.9MB). Free memory was 56.1MB in the beginning and 28.5MB in the end (delta: 27.6MB). Peak memory consumption was 69.3MB. Max. memory is 16.1GB. [2022-11-20 10:47:37,180 INFO L158 Benchmark]: Witness Printer took 24.84ms. Allocated memory is still 130.0MB. Free memory was 28.5MB in the beginning and 27.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:47:37,180 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 60.8MB. Free memory is still 39.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 961.66ms. Allocated memory is still 88.1MB. Free memory was 69.2MB in the beginning and 53.6MB in the end (delta: 15.6MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.15ms. Allocated memory is still 88.1MB. Free memory was 53.6MB in the beginning and 50.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.50ms. Allocated memory is still 88.1MB. Free memory was 50.9MB in the beginning and 48.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1494.55ms. Allocated memory is still 88.1MB. Free memory was 48.4MB in the beginning and 57.0MB in the end (delta: -8.6MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * TraceAbstraction took 485834.29ms. Allocated memory was 88.1MB in the beginning and 130.0MB in the end (delta: 41.9MB). Free memory was 56.1MB in the beginning and 28.5MB in the end (delta: 27.6MB). Peak memory consumption was 69.3MB. Max. memory is 16.1GB. * Witness Printer took 24.84ms. Allocated memory is still 130.0MB. Free memory was 28.5MB in the beginning and 27.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 964]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 964. Possible FailurePath: [L966] DUPFF f, g, cf, cg, h; VAL [f={11:0}, g={25:0}] [L967] CALL, EXPR DUPFFnew(1) [L894] DUPFF ans = (DUPFF)malloc(sizeof(struct DUPFFstruct)); [L895] ans->coeffs = 0 VAL [\old(maxdeg)=1, ans={6:0}, maxdeg=1] [L896] COND TRUE maxdeg >= 0 [L897] ans->coeffs = (FFelem*)malloc((maxdeg+1)*sizeof(FFelem)) VAL [\old(maxdeg)=1, ans={6:0}, malloc((maxdeg+1)*sizeof(FFelem))={5:0}, maxdeg=1] [L898] EXPR ans->coeffs VAL [\old(maxdeg)=1, ans={6:0}, ans->coeffs={5:0}, maxdeg=1] [L898] FCALL memset(ans->coeffs, 0, (maxdeg+1)*sizeof(FFelem)) [L900] ans->maxdeg = maxdeg VAL [\old(maxdeg)=1, ans={6:0}, maxdeg=1] [L901] ans->deg = -1 VAL [\old(maxdeg)=1, ans={6:0}, maxdeg=1] [L902] return ans; VAL [\old(maxdeg)=1, \result={6:0}, ans={6:0}, maxdeg=1] [L967] RET, EXPR DUPFFnew(1) VAL [DUPFFnew(1)={6:0}, f={11:0}, g={25:0}] [L967] f = DUPFFnew(1) [L967] EXPR f->coeffs VAL [f={6:0}, f={11:0}, f->coeffs={5:0}, g={25:0}] [L967] f->coeffs[1] = 1 VAL [f={6:0}, f={11:0}, f->coeffs={5:0}, g={25:0}] [L967] f->deg = 1 VAL [f={6:0}, f={11:0}, g={25:0}] [L968] CALL, EXPR DUPFFnew(2) [L894] DUPFF ans = (DUPFF)malloc(sizeof(struct DUPFFstruct)); [L895] ans->coeffs = 0 VAL [\old(maxdeg)=2, ans={7:0}, maxdeg=2] [L896] COND TRUE maxdeg >= 0 [L897] ans->coeffs = (FFelem*)malloc((maxdeg+1)*sizeof(FFelem)) VAL [\old(maxdeg)=2, ans={7:0}, malloc((maxdeg+1)*sizeof(FFelem))={3:0}, maxdeg=2] [L898] EXPR ans->coeffs VAL [\old(maxdeg)=2, ans={7:0}, ans->coeffs={3:0}, maxdeg=2] [L898] FCALL memset(ans->coeffs, 0, (maxdeg+1)*sizeof(FFelem)) [L900] ans->maxdeg = maxdeg VAL [\old(maxdeg)=2, ans={7:0}, maxdeg=2] [L901] ans->deg = -1 VAL [\old(maxdeg)=2, ans={7:0}, maxdeg=2] [L902] return ans; VAL [\old(maxdeg)=2, \result={7:0}, ans={7:0}, maxdeg=2] [L968] RET, EXPR DUPFFnew(2) VAL [DUPFFnew(2)={7:0}, f={6:0}, f={11:0}, g={25:0}] [L968] g = DUPFFnew(2) [L968] EXPR g->coeffs VAL [f={6:0}, f={11:0}, g={25:0}, g={7:0}, g->coeffs={3:0}] [L968] g->coeffs[2] = 1 VAL [f={11:0}, f={6:0}, g={7:0}, g={25:0}, g->coeffs={3:0}] [L968] g->deg = 2 VAL [f={6:0}, f={11:0}, g={7:0}, g={25:0}] [L969] CALL, EXPR DUPFFexgcd(&cf, &cg, f, g) VAL [f={6:0}, fcofac={11:0}, g={7:0}, gcofac={25:0}] [L919] DUPFF u, v, uf, ug, vf, vg; [L920] FFelem q, lcu, lcvrecip, p; [L921] int df, dg, du, dv; VAL [f={6:0}, f={6:0}, fcofac={11:0}, fcofac={11:0}, g={7:0}, g={7:0}, gcofac={25:0}, gcofac={25:0}] [L922] CALL, EXPR DUPFFdeg(f) VAL [f={6:0}] [L890] EXPR f->deg VAL [f={6:0}, f={6:0}, f->deg=1] [L890] return f->deg; [L922] RET, EXPR DUPFFdeg(f) VAL [DUPFFdeg(f)=1, f={6:0}, f={6:0}, fcofac={11:0}, fcofac={11:0}, g={7:0}, g={7:0}, gcofac={25:0}, gcofac={25:0}] [L922] CALL, EXPR DUPFFdeg(g) VAL [f={7:0}] [L890] EXPR f->deg VAL [f={7:0}, f={7:0}, f->deg=2] [L890] return f->deg; [L922] RET, EXPR DUPFFdeg(g) VAL [DUPFFdeg(f)=1, DUPFFdeg(g)=2, f={6:0}, f={6:0}, fcofac={11:0}, fcofac={11:0}, g={7:0}, g={7:0}, gcofac={25:0}, gcofac={25:0}] [L922] COND TRUE DUPFFdeg(f) < DUPFFdeg(g) [L922] CALL, EXPR DUPFFexgcd(gcofac, fcofac, g, f) VAL [f={7:0}, fcofac={25:0}, g={6:0}, gcofac={11:0}] [L919] DUPFF u, v, uf, ug, vf, vg; [L920] FFelem q, lcu, lcvrecip, p; [L921] int df, dg, du, dv; VAL [f={7:0}, f={7:0}, fcofac={25:0}, fcofac={25:0}, g={6:0}, g={6:0}, gcofac={11:0}, gcofac={11:0}] [L922] CALL, EXPR DUPFFdeg(f) VAL [f={7:0}] [L890] EXPR f->deg VAL [f={7:0}, f={7:0}, f->deg=2] [L890] return f->deg; [L922] RET, EXPR DUPFFdeg(f) VAL [DUPFFdeg(f)=2, f={7:0}, f={7:0}, fcofac={25:0}, fcofac={25:0}, g={6:0}, g={6:0}, gcofac={11:0}, gcofac={11:0}] [L922] CALL, EXPR DUPFFdeg(g) VAL [f={6:0}] [L890] EXPR f->deg VAL [f={6:0}, f={6:0}, f->deg=1] [L890] return f->deg; [L922] RET, EXPR DUPFFdeg(g) VAL [DUPFFdeg(f)=2, DUPFFdeg(g)=1, f={7:0}, f={7:0}, fcofac={25:0}, fcofac={25:0}, g={6:0}, g={6:0}, gcofac={11:0}, gcofac={11:0}] [L922] COND FALSE !(DUPFFdeg(f) < DUPFFdeg(g)) [L923] CALL, EXPR DUPFFdeg(f) VAL [f={7:0}] [L890] EXPR f->deg VAL [f={7:0}, f={7:0}, f->deg=2] [L890] return f->deg; [L923] RET, EXPR DUPFFdeg(f) VAL [DUPFFdeg(f)=2, f={7:0}, f={7:0}, fcofac={25:0}, fcofac={25:0}, g={6:0}, g={6:0}, gcofac={11:0}, gcofac={11:0}] [L923] DUPFFdeg(f) != 2 || DUPFFdeg(g) != 1 VAL [DUPFFdeg(f)=2, DUPFFdeg(f) != 2 || DUPFFdeg(g) != 1=0, f={7:0}, f={7:0}, fcofac={25:0}, fcofac={25:0}, g={6:0}, g={6:0}, gcofac={11:0}, gcofac={11:0}] [L923] CALL, EXPR DUPFFdeg(g) VAL [f={6:0}] [L890] EXPR f->deg VAL [f={6:0}, f={6:0}, f->deg=1] [L890] return f->deg; [L923] RET, EXPR DUPFFdeg(g) VAL [DUPFFdeg(f)=2, DUPFFdeg(f) != 2 || DUPFFdeg(g) != 1=0, DUPFFdeg(g)=1, f={7:0}, f={7:0}, fcofac={25:0}, fcofac={25:0}, g={6:0}, g={6:0}, gcofac={11:0}, gcofac={11:0}] [L923] DUPFFdeg(f) != 2 || DUPFFdeg(g) != 1 VAL [DUPFFdeg(f)=2, DUPFFdeg(f) != 2 || DUPFFdeg(g) != 1=0, DUPFFdeg(g)=1, f={7:0}, f={7:0}, fcofac={25:0}, fcofac={25:0}, g={6:0}, g={6:0}, gcofac={11:0}, gcofac={11:0}] [L923] COND FALSE !(DUPFFdeg(f) != 2 || DUPFFdeg(g) != 1) [L924] EXPR f->coeffs VAL [f={7:0}, f={7:0}, f->coeffs={3:0}, fcofac={25:0}, fcofac={25:0}, g={6:0}, g={6:0}, gcofac={11:0}, gcofac={11:0}] [L924] EXPR f->coeffs[0] VAL [f={7:0}, f={7:0}, f->coeffs={3:0}, f->coeffs[0]=0, fcofac={25:0}, fcofac={25:0}, g={6:0}, g={6:0}, gcofac={11:0}, gcofac={11:0}] [L924] COND TRUE f->coeffs[0] == 0 [L924] return f; VAL [\result={7:0}, f={7:0}, f={7:0}, fcofac={25:0}, fcofac={25:0}, g={6:0}, g={6:0}, gcofac={11:0}, gcofac={11:0}] [L922] RET, EXPR DUPFFexgcd(gcofac, fcofac, g, f) VAL [DUPFFexgcd(gcofac, fcofac, g, f)={7:0}, f={6:0}, f={6:0}, fcofac={11:0}, fcofac={11:0}, g={7:0}, g={7:0}, gcofac={25:0}, gcofac={25:0}] [L922] return DUPFFexgcd(gcofac, fcofac, g, f); [L969] RET, EXPR DUPFFexgcd(&cf, &cg, f, g) VAL [DUPFFexgcd(&cf, &cg, f, g)={7:0}, f={6:0}, f={11:0}, g={7:0}, g={25:0}] [L969] h = DUPFFexgcd(&cf, &cg, f, g) [L970] h = h [L971] return 0; [L971] return 0; [L971] return 0; VAL [\result=0, f={6:0}, g={7:0}, h={7:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 187 locations, 55 error locations. Started 1 CEGAR loops. OverallTime: 485.7s, OverallIterations: 35, TraceHistogramMax: 20, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 106.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3777 SdHoareTripleChecker+Valid, 86.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3691 mSDsluCounter, 54918 SdHoareTripleChecker+Invalid, 77.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 7725 IncrementalHoareTripleChecker+Unchecked, 47932 mSDsCounter, 1077 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19574 IncrementalHoareTripleChecker+Invalid, 28376 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1077 mSolverCounterUnsat, 6986 mSDtfsCounter, 19574 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3710 GetRequests, 2945 SyntacticMatches, 99 SemanticMatches, 666 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 3516 ImplicationChecksByTransitivity, 100.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=446occurred in iteration=30, InterpolantAutomatonStates: 479, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 34 MinimizatonAttempts, 460 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.3s SsaConstructionTime, 16.7s SatisfiabilityAnalysisTime, 344.2s InterpolantComputationTime, 2252 NumberOfCodeBlocks, 2158 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 3437 ConstructedInterpolants, 432 QuantifiedInterpolants, 34269 SizeOfPredicates, 278 NumberOfNonLiveVariables, 15870 ConjunctsInSsa, 742 ConjunctsInUnsatCore, 53 InterpolantComputations, 15 PerfectInterpolantSequences, 8476/9796 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-20 10:47:37,338 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_040fd4d0-a4a6-4631-ad4a-bebde2b587fb/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample