./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF --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 27e059eb1633b1ab9c045484375455e2667fa3360a55d0bc53eccfa53fe7600f --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 06:35:24,043 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 06:35:24,045 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 06:35:24,102 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 06:35:24,102 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 06:35:24,106 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 06:35:24,108 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 06:35:24,112 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 06:35:24,115 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 06:35:24,121 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 06:35:24,123 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 06:35:24,125 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 06:35:24,126 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 06:35:24,129 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 06:35:24,132 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 06:35:24,136 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 06:35:24,138 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 06:35:24,140 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 06:35:24,143 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 06:35:24,153 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 06:35:24,155 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 06:35:24,156 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 06:35:24,160 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 06:35:24,161 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 06:35:24,170 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 06:35:24,171 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 06:35:24,171 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 06:35:24,173 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 06:35:24,174 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 06:35:24,175 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 06:35:24,176 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 06:35:24,176 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 06:35:24,178 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 06:35:24,179 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 06:35:24,181 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 06:35:24,181 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 06:35:24,182 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 06:35:24,182 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 06:35:24,182 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 06:35:24,183 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 06:35:24,184 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 06:35:24,185 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-11-20 06:35:24,229 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 06:35:24,229 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 06:35:24,230 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 06:35:24,230 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 06:35:24,237 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 06:35:24,239 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 06:35:24,239 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 06:35:24,240 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 06:35:24,240 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 06:35:24,240 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 06:35:24,241 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 06:35:24,242 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-20 06:35:24,242 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 06:35:24,242 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 06:35:24,242 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 06:35:24,243 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-20 06:35:24,243 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-20 06:35:24,243 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-20 06:35:24,243 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 06:35:24,243 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-20 06:35:24,244 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 06:35:24,244 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 06:35:24,244 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 06:35:24,244 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 06:35:24,245 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 06:35:24,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 06:35:24,245 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 06:35:24,245 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 06:35:24,245 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 06:35:24,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 06:35:24,246 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 06:35:24,246 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_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/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_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF 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 -> 27e059eb1633b1ab9c045484375455e2667fa3360a55d0bc53eccfa53fe7600f [2021-11-20 06:35:24,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 06:35:24,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 06:35:24,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 06:35:24,536 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 06:35:24,537 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 06:35:24,539 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i [2021-11-20 06:35:24,621 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/data/5db2bbe74/02f5461183894e5abd230ce0f2ecf984/FLAG5d2eb4b6a [2021-11-20 06:35:25,111 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 06:35:25,112 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i [2021-11-20 06:35:25,142 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/data/5db2bbe74/02f5461183894e5abd230ce0f2ecf984/FLAG5d2eb4b6a [2021-11-20 06:35:25,412 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/data/5db2bbe74/02f5461183894e5abd230ce0f2ecf984 [2021-11-20 06:35:25,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 06:35:25,416 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 06:35:25,418 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 06:35:25,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 06:35:25,421 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 06:35:25,422 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:35:25" (1/1) ... [2021-11-20 06:35:25,423 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ab91d7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:35:25, skipping insertion in model container [2021-11-20 06:35:25,423 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:35:25" (1/1) ... [2021-11-20 06:35:25,431 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 06:35:25,485 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 06:35:25,956 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:35:25,981 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2021-11-20 06:35:25,983 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@25f8a476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:35:25, skipping insertion in model container [2021-11-20 06:35:25,983 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 06:35:25,983 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-11-20 06:35:25,987 INFO L158 Benchmark]: Toolchain (without parser) took 568.50ms. Allocated memory is still 117.4MB. Free memory was 80.7MB in the beginning and 86.8MB in the end (delta: -6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-20 06:35:25,988 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 91.2MB in the end (delta: 21.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 06:35:25,990 INFO L158 Benchmark]: CACSL2BoogieTranslator took 565.70ms. Allocated memory is still 117.4MB. Free memory was 80.4MB in the beginning and 86.8MB in the end (delta: -6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-20 06:35:25,992 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.31ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 91.2MB in the end (delta: 21.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 565.70ms. Allocated memory is still 117.4MB. Free memory was 80.4MB in the beginning and 86.8MB in the end (delta: -6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type 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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF --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 27e059eb1633b1ab9c045484375455e2667fa3360a55d0bc53eccfa53fe7600f --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 06:35:28,304 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 06:35:28,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 06:35:28,363 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 06:35:28,363 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 06:35:28,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 06:35:28,371 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 06:35:28,378 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 06:35:28,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 06:35:28,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 06:35:28,391 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 06:35:28,393 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 06:35:28,394 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 06:35:28,396 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 06:35:28,399 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 06:35:28,404 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 06:35:28,406 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 06:35:28,407 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 06:35:28,409 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 06:35:28,419 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 06:35:28,421 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 06:35:28,423 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 06:35:28,426 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 06:35:28,428 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 06:35:28,432 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 06:35:28,433 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 06:35:28,433 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 06:35:28,435 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 06:35:28,436 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 06:35:28,437 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 06:35:28,437 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 06:35:28,438 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 06:35:28,440 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 06:35:28,441 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 06:35:28,442 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 06:35:28,442 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 06:35:28,443 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 06:35:28,444 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 06:35:28,444 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 06:35:28,446 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 06:35:28,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 06:35:28,447 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-11-20 06:35:28,491 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 06:35:28,491 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 06:35:28,492 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 06:35:28,492 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 06:35:28,493 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 06:35:28,493 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 06:35:28,495 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 06:35:28,495 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 06:35:28,496 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 06:35:28,496 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 06:35:28,497 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 06:35:28,497 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-20 06:35:28,497 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 06:35:28,498 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 06:35:28,498 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 06:35:28,498 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-20 06:35:28,498 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-20 06:35:28,498 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-20 06:35:28,499 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 06:35:28,499 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-20 06:35:28,499 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-20 06:35:28,499 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-20 06:35:28,500 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 06:35:28,500 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 06:35:28,500 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 06:35:28,500 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 06:35:28,501 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 06:35:28,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 06:35:28,501 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 06:35:28,501 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 06:35:28,502 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-20 06:35:28,502 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-20 06:35:28,502 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 06:35:28,502 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-20 06:35:28,503 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_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/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_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF 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 -> 27e059eb1633b1ab9c045484375455e2667fa3360a55d0bc53eccfa53fe7600f [2021-11-20 06:35:28,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 06:35:28,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 06:35:28,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 06:35:28,946 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 06:35:28,947 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 06:35:28,949 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i [2021-11-20 06:35:29,024 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/data/63ff34c04/f81d0e9dc48f494b928ccefd0c859a57/FLAG0445c6155 [2021-11-20 06:35:29,754 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 06:35:29,755 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i [2021-11-20 06:35:29,782 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/data/63ff34c04/f81d0e9dc48f494b928ccefd0c859a57/FLAG0445c6155 [2021-11-20 06:35:29,980 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/data/63ff34c04/f81d0e9dc48f494b928ccefd0c859a57 [2021-11-20 06:35:29,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 06:35:29,984 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 06:35:29,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 06:35:29,986 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 06:35:29,992 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 06:35:29,993 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:35:29" (1/1) ... [2021-11-20 06:35:29,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11f4a2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:35:29, skipping insertion in model container [2021-11-20 06:35:29,997 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:35:29" (1/1) ... [2021-11-20 06:35:30,004 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 06:35:30,075 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 06:35:30,486 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:35:30,515 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-11-20 06:35:30,532 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 06:35:30,621 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:35:30,629 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 06:35:30,707 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:35:30,774 INFO L208 MainTranslator]: Completed translation [2021-11-20 06:35:30,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:35:30 WrapperNode [2021-11-20 06:35:30,774 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 06:35:30,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 06:35:30,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 06:35:30,776 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 06:35:30,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:35:30" (1/1) ... [2021-11-20 06:35:30,809 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:35:30" (1/1) ... [2021-11-20 06:35:30,850 INFO L137 Inliner]: procedures = 165, calls = 73, calls flagged for inlining = 21, calls inlined = 3, statements flattened = 54 [2021-11-20 06:35:30,850 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 06:35:30,851 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 06:35:30,851 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 06:35:30,851 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 06:35:30,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:35:30" (1/1) ... [2021-11-20 06:35:30,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:35:30" (1/1) ... [2021-11-20 06:35:30,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:35:30" (1/1) ... [2021-11-20 06:35:30,876 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:35:30" (1/1) ... [2021-11-20 06:35:30,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:35:30" (1/1) ... [2021-11-20 06:35:30,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:35:30" (1/1) ... [2021-11-20 06:35:30,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:35:30" (1/1) ... [2021-11-20 06:35:30,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 06:35:30,908 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 06:35:30,908 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 06:35:30,908 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 06:35:30,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:35:30" (1/1) ... [2021-11-20 06:35:30,917 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 06:35:30,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:35:30,941 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 06:35:30,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 06:35:30,992 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-20 06:35:30,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-20 06:35:30,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-20 06:35:30,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 06:35:30,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-20 06:35:30,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-20 06:35:30,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 06:35:30,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-20 06:35:30,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 06:35:30,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 06:35:31,098 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 06:35:31,099 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 06:35:31,378 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 06:35:31,384 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 06:35:31,384 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-20 06:35:31,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:35:31 BoogieIcfgContainer [2021-11-20 06:35:31,386 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 06:35:31,390 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 06:35:31,391 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 06:35:31,393 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 06:35:31,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:35:29" (1/3) ... [2021-11-20 06:35:31,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1578bd7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:35:31, skipping insertion in model container [2021-11-20 06:35:31,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:35:30" (2/3) ... [2021-11-20 06:35:31,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1578bd7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:35:31, skipping insertion in model container [2021-11-20 06:35:31,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:35:31" (3/3) ... [2021-11-20 06:35:31,409 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test18_2.i [2021-11-20 06:35:31,415 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 06:35:31,415 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2021-11-20 06:35:31,466 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 06:35:31,473 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 06:35:31,473 INFO L340 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2021-11-20 06:35:31,488 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.72) internal successors, (43), 36 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 06:35:31,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-20 06:35:31,496 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:35:31,497 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:35:31,497 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:35:31,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:35:31,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1121226903, now seen corresponding path program 1 times [2021-11-20 06:35:31,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:35:31,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1172760042] [2021-11-20 06:35:31,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:35:31,517 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:35:31,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:35:31,523 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:35:31,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-20 06:35:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:35:31,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-20 06:35:31,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:35:31,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:35:31,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:35:31,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:35:31,858 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:35:31,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1172760042] [2021-11-20 06:35:31,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1172760042] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 06:35:31,861 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:35:31,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-20 06:35:31,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290718851] [2021-11-20 06:35:31,866 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 06:35:31,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 06:35:31,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:35:31,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 06:35:31,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:35:31,917 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.72) internal successors, (43), 36 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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) [2021-11-20 06:35:32,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:35:32,111 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2021-11-20 06:35:32,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 06:35:32,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 11 [2021-11-20 06:35:32,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:35:32,126 INFO L225 Difference]: With dead ends: 74 [2021-11-20 06:35:32,127 INFO L226 Difference]: Without dead ends: 70 [2021-11-20 06:35:32,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:35:32,147 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 33 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 06:35:32,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 142 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 06:35:32,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-11-20 06:35:32,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 42. [2021-11-20 06:35:32,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 37 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-20 06:35:32,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2021-11-20 06:35:32,212 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 11 [2021-11-20 06:35:32,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:35:32,214 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2021-11-20 06:35:32,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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) [2021-11-20 06:35:32,215 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2021-11-20 06:35:32,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-20 06:35:32,217 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:35:32,217 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:35:32,229 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-20 06:35:32,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:35:32,428 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:35:32,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:35:32,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2008730584, now seen corresponding path program 1 times [2021-11-20 06:35:32,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:35:32,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1484408330] [2021-11-20 06:35:32,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:35:32,437 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:35:32,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:35:32,438 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:35:32,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-20 06:35:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:35:32,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-20 06:35:32,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:35:32,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:35:32,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:35:32,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:35:32,615 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:35:32,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1484408330] [2021-11-20 06:35:32,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1484408330] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 06:35:32,617 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:35:32,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-20 06:35:32,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182179358] [2021-11-20 06:35:32,617 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 06:35:32,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 06:35:32,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:35:32,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 06:35:32,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 06:35:32,621 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) [2021-11-20 06:35:32,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:35:32,770 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2021-11-20 06:35:32,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 06:35:32,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 11 [2021-11-20 06:35:32,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:35:32,772 INFO L225 Difference]: With dead ends: 69 [2021-11-20 06:35:32,772 INFO L226 Difference]: Without dead ends: 67 [2021-11-20 06:35:32,772 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 06:35:32,773 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 26 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:35:32,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 145 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 06:35:32,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-11-20 06:35:32,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 48. [2021-11-20 06:35:32,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.53125) internal successors, (49), 42 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2021-11-20 06:35:32,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2021-11-20 06:35:32,788 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 11 [2021-11-20 06:35:32,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:35:32,789 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2021-11-20 06:35:32,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) [2021-11-20 06:35:32,789 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2021-11-20 06:35:32,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-20 06:35:32,790 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:35:32,790 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:35:32,804 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-20 06:35:33,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:35:33,002 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:35:33,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:35:33,003 INFO L85 PathProgramCache]: Analyzing trace with hash 398308128, now seen corresponding path program 1 times [2021-11-20 06:35:33,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:35:33,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385691986] [2021-11-20 06:35:33,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:35:33,003 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:35:33,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:35:33,005 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:35:33,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-20 06:35:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:35:33,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-20 06:35:33,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:35:33,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:35:33,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:35:33,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:35:33,177 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:35:33,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [385691986] [2021-11-20 06:35:33,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [385691986] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 06:35:33,177 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:35:33,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-20 06:35:33,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033030884] [2021-11-20 06:35:33,178 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 06:35:33,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 06:35:33,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:35:33,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 06:35:33,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:35:33,180 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 06:35:33,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:35:33,264 INFO L93 Difference]: Finished difference Result 88 states and 105 transitions. [2021-11-20 06:35:33,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 06:35:33,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 12 [2021-11-20 06:35:33,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:35:33,266 INFO L225 Difference]: With dead ends: 88 [2021-11-20 06:35:33,266 INFO L226 Difference]: Without dead ends: 88 [2021-11-20 06:35:33,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:35:33,268 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 176 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:35:33,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 77 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 06:35:33,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-11-20 06:35:33,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 57. [2021-11-20 06:35:33,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 50 states have internal predecessors, (59), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2021-11-20 06:35:33,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2021-11-20 06:35:33,279 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 12 [2021-11-20 06:35:33,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:35:33,280 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2021-11-20 06:35:33,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 06:35:33,280 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2021-11-20 06:35:33,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-20 06:35:33,281 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:35:33,282 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:35:33,298 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-11-20 06:35:33,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:35:33,494 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:35:33,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:35:33,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1387011810, now seen corresponding path program 1 times [2021-11-20 06:35:33,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:35:33,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [302360725] [2021-11-20 06:35:33,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:35:33,496 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:35:33,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:35:33,497 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:35:33,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-20 06:35:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:35:33,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-20 06:35:33,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:35:33,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:35:33,797 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-20 06:35:33,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 32 [2021-11-20 06:35:33,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:35:33,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:35:44,734 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:35:44,735 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:35:44,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [302360725] [2021-11-20 06:35:44,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [302360725] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:35:44,735 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:35:44,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-11-20 06:35:44,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030845094] [2021-11-20 06:35:44,736 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:35:44,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-20 06:35:44,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:35:44,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-20 06:35:44,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=119, Unknown=5, NotChecked=0, Total=156 [2021-11-20 06:35:44,738 INFO L87 Difference]: Start difference. First operand 57 states and 74 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-20 06:35:44,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:35:44,816 INFO L93 Difference]: Finished difference Result 75 states and 104 transitions. [2021-11-20 06:35:44,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 06:35:44,817 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 18 [2021-11-20 06:35:44,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:35:44,819 INFO L225 Difference]: With dead ends: 75 [2021-11-20 06:35:44,819 INFO L226 Difference]: Without dead ends: 75 [2021-11-20 06:35:44,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=39, Invalid=138, Unknown=5, NotChecked=0, Total=182 [2021-11-20 06:35:44,821 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 25 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 06:35:44,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 194 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 104 Unchecked, 0.0s Time] [2021-11-20 06:35:44,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-11-20 06:35:44,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 60. [2021-11-20 06:35:44,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 52 states have internal predecessors, (64), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2021-11-20 06:35:44,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 79 transitions. [2021-11-20 06:35:44,833 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 79 transitions. Word has length 18 [2021-11-20 06:35:44,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:35:44,833 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 79 transitions. [2021-11-20 06:35:44,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-20 06:35:44,834 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 79 transitions. [2021-11-20 06:35:44,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-20 06:35:44,835 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:35:44,835 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:35:44,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-20 06:35:45,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:35:45,046 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:35:45,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:35:45,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1387011811, now seen corresponding path program 1 times [2021-11-20 06:35:45,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:35:45,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [447388125] [2021-11-20 06:35:45,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:35:45,048 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:35:45,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:35:45,049 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:35:45,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-20 06:35:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:35:45,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-20 06:35:45,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:35:45,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:35:45,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:35:47,509 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 06:35:47,509 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 31 [2021-11-20 06:35:47,523 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:35:47,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2021-11-20 06:35:47,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:35:47,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:36:04,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 27 [2021-11-20 06:36:05,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 26 [2021-11-20 06:36:05,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:36:05,726 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:36:05,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [447388125] [2021-11-20 06:36:05,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [447388125] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:36:05,726 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:36:05,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2021-11-20 06:36:05,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368018753] [2021-11-20 06:36:05,727 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:36:05,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-20 06:36:05,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:36:05,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-20 06:36:05,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=257, Unknown=6, NotChecked=0, Total=306 [2021-11-20 06:36:05,728 INFO L87 Difference]: Start difference. First operand 60 states and 79 transitions. Second operand has 18 states, 15 states have (on average 1.8) internal successors, (27), 16 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 06:36:11,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:36:11,203 INFO L93 Difference]: Finished difference Result 201 states and 230 transitions. [2021-11-20 06:36:11,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-20 06:36:11,204 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 1.8) internal successors, (27), 16 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 18 [2021-11-20 06:36:11,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:36:11,205 INFO L225 Difference]: With dead ends: 201 [2021-11-20 06:36:11,206 INFO L226 Difference]: Without dead ends: 201 [2021-11-20 06:36:11,206 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=92, Invalid=500, Unknown=8, NotChecked=0, Total=600 [2021-11-20 06:36:11,207 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 234 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 478 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-20 06:36:11,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 386 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 196 Invalid, 0 Unknown, 478 Unchecked, 0.8s Time] [2021-11-20 06:36:11,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-11-20 06:36:11,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 88. [2021-11-20 06:36:11,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 67 states have (on average 1.507462686567164) internal successors, (101), 77 states have internal predecessors, (101), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2021-11-20 06:36:11,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 119 transitions. [2021-11-20 06:36:11,228 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 119 transitions. Word has length 18 [2021-11-20 06:36:11,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:36:11,229 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 119 transitions. [2021-11-20 06:36:11,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 1.8) internal successors, (27), 16 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 06:36:11,229 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 119 transitions. [2021-11-20 06:36:11,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-20 06:36:11,230 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:36:11,230 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:36:11,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-20 06:36:11,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:36:11,442 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:36:11,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:36:11,443 INFO L85 PathProgramCache]: Analyzing trace with hash 881453185, now seen corresponding path program 1 times [2021-11-20 06:36:11,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:36:11,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [566156328] [2021-11-20 06:36:11,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:36:11,443 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:36:11,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:36:11,445 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:36:11,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-20 06:36:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:36:11,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-20 06:36:11,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:36:11,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:36:11,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:36:11,686 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 06:36:11,686 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:36:11,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [566156328] [2021-11-20 06:36:11,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [566156328] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-20 06:36:11,687 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 06:36:11,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2021-11-20 06:36:11,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593874241] [2021-11-20 06:36:11,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:36:11,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 06:36:11,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:36:11,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 06:36:11,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:36:11,688 INFO L87 Difference]: Start difference. First operand 88 states and 119 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 06:36:11,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:36:11,765 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2021-11-20 06:36:11,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 06:36:11,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2021-11-20 06:36:11,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:36:11,767 INFO L225 Difference]: With dead ends: 75 [2021-11-20 06:36:11,767 INFO L226 Difference]: Without dead ends: 73 [2021-11-20 06:36:11,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:36:11,768 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:36:11,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 06:36:11,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-11-20 06:36:11,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-11-20 06:36:11,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 65 states have internal predecessors, (82), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-20 06:36:11,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 93 transitions. [2021-11-20 06:36:11,777 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 93 transitions. Word has length 18 [2021-11-20 06:36:11,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:36:11,777 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 93 transitions. [2021-11-20 06:36:11,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 06:36:11,778 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2021-11-20 06:36:11,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-20 06:36:11,779 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:36:11,779 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:36:11,791 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-20 06:36:11,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:36:11,991 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:36:11,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:36:11,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1478437294, now seen corresponding path program 1 times [2021-11-20 06:36:11,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:36:11,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606307746] [2021-11-20 06:36:11,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:36:11,992 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:36:11,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:36:11,993 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:36:11,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-20 06:36:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:36:12,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-20 06:36:12,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:36:12,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 06:36:12,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:36:12,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 06:36:12,174 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:36:12,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1606307746] [2021-11-20 06:36:12,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1606307746] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 06:36:12,174 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:36:12,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-20 06:36:12,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531540263] [2021-11-20 06:36:12,175 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 06:36:12,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 06:36:12,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:36:12,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 06:36:12,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:36:12,176 INFO L87 Difference]: Start difference. First operand 73 states and 93 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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) [2021-11-20 06:36:12,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:36:12,238 INFO L93 Difference]: Finished difference Result 90 states and 113 transitions. [2021-11-20 06:36:12,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 06:36:12,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 20 [2021-11-20 06:36:12,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:36:12,240 INFO L225 Difference]: With dead ends: 90 [2021-11-20 06:36:12,240 INFO L226 Difference]: Without dead ends: 90 [2021-11-20 06:36:12,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:36:12,241 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 9 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 06:36:12,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 166 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 06:36:12,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-11-20 06:36:12,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 74. [2021-11-20 06:36:12,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 55 states have (on average 1.490909090909091) internal successors, (82), 65 states have internal predecessors, (82), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-20 06:36:12,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2021-11-20 06:36:12,250 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 20 [2021-11-20 06:36:12,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:36:12,251 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2021-11-20 06:36:12,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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) [2021-11-20 06:36:12,251 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2021-11-20 06:36:12,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-20 06:36:12,252 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:36:12,252 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:36:12,274 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-20 06:36:12,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:36:12,471 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:36:12,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:36:12,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1073719666, now seen corresponding path program 1 times [2021-11-20 06:36:12,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:36:12,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1912395734] [2021-11-20 06:36:12,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:36:12,472 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:36:12,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:36:12,480 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:36:12,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-20 06:36:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:36:12,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-20 06:36:12,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:36:12,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-20 06:36:12,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:36:12,702 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-20 06:36:12,703 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:36:12,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1912395734] [2021-11-20 06:36:12,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1912395734] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 06:36:12,703 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:36:12,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-20 06:36:12,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229800565] [2021-11-20 06:36:12,703 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 06:36:12,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 06:36:12,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:36:12,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 06:36:12,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:36:12,705 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 06:36:12,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:36:12,818 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2021-11-20 06:36:12,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 06:36:12,819 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 20 [2021-11-20 06:36:12,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:36:12,819 INFO L225 Difference]: With dead ends: 73 [2021-11-20 06:36:12,820 INFO L226 Difference]: Without dead ends: 73 [2021-11-20 06:36:12,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:36:12,821 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 35 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:36:12,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 133 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 06:36:12,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-11-20 06:36:12,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2021-11-20 06:36:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 57 states have internal predecessors, (66), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-20 06:36:12,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2021-11-20 06:36:12,827 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 20 [2021-11-20 06:36:12,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:36:12,828 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2021-11-20 06:36:12,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 06:36:12,828 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2021-11-20 06:36:12,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-20 06:36:12,829 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:36:12,829 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:36:12,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-20 06:36:13,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:36:13,041 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:36:13,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:36:13,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1074427268, now seen corresponding path program 1 times [2021-11-20 06:36:13,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:36:13,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234600708] [2021-11-20 06:36:13,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:36:13,042 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:36:13,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:36:13,045 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:36:13,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-20 06:36:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:36:13,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-20 06:36:13,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:36:13,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:36:13,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:36:13,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 06:36:13,644 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:36:13,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234600708] [2021-11-20 06:36:13,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [234600708] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:36:13,645 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:36:13,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2021-11-20 06:36:13,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141961463] [2021-11-20 06:36:13,645 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:36:13,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 06:36:13,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:36:13,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 06:36:13,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-11-20 06:36:13,648 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 06:36:13,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:36:13,837 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2021-11-20 06:36:13,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 06:36:13,838 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 21 [2021-11-20 06:36:13,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:36:13,839 INFO L225 Difference]: With dead ends: 69 [2021-11-20 06:36:13,839 INFO L226 Difference]: Without dead ends: 67 [2021-11-20 06:36:13,839 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-11-20 06:36:13,840 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 40 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 06:36:13,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 108 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 9 Unchecked, 0.2s Time] [2021-11-20 06:36:13,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-11-20 06:36:13,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-11-20 06:36:13,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 49 states have (on average 1.346938775510204) internal successors, (66), 57 states have internal predecessors, (66), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-20 06:36:13,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2021-11-20 06:36:13,869 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 21 [2021-11-20 06:36:13,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:36:13,870 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2021-11-20 06:36:13,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 06:36:13,870 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2021-11-20 06:36:13,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-20 06:36:13,871 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:36:13,872 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:36:13,886 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-20 06:36:14,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:36:14,083 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:36:14,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:36:14,083 INFO L85 PathProgramCache]: Analyzing trace with hash -2128418719, now seen corresponding path program 1 times [2021-11-20 06:36:14,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:36:14,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662092823] [2021-11-20 06:36:14,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:36:14,084 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:36:14,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:36:14,085 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:36:14,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-20 06:36:14,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:36:14,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-20 06:36:14,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:36:14,378 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 06:36:14,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:36:19,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:36:19,070 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:36:19,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662092823] [2021-11-20 06:36:19,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1662092823] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:36:19,070 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:36:19,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2021-11-20 06:36:19,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438531850] [2021-11-20 06:36:19,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:36:19,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-20 06:36:19,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:36:19,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-20 06:36:19,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=117, Unknown=9, NotChecked=0, Total=156 [2021-11-20 06:36:19,072 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand has 13 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 06:36:19,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:36:19,460 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2021-11-20 06:36:19,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 06:36:19,461 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 24 [2021-11-20 06:36:19,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:36:19,463 INFO L225 Difference]: With dead ends: 112 [2021-11-20 06:36:19,463 INFO L226 Difference]: Without dead ends: 103 [2021-11-20 06:36:19,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=36, Invalid=137, Unknown=9, NotChecked=0, Total=182 [2021-11-20 06:36:19,464 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 20 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 06:36:19,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 335 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 161 Invalid, 0 Unknown, 76 Unchecked, 0.4s Time] [2021-11-20 06:36:19,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-11-20 06:36:19,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 91. [2021-11-20 06:36:19,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 77 states have internal predecessors, (91), 6 states have call successors, (6), 5 states have call predecessors, (6), 8 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2021-11-20 06:36:19,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2021-11-20 06:36:19,471 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 24 [2021-11-20 06:36:19,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:36:19,472 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 108 transitions. [2021-11-20 06:36:19,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 06:36:19,472 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2021-11-20 06:36:19,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 06:36:19,473 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:36:19,473 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:36:19,493 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-20 06:36:19,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:36:19,674 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:36:19,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:36:19,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1844216073, now seen corresponding path program 1 times [2021-11-20 06:36:19,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:36:19,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214569719] [2021-11-20 06:36:19,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:36:19,675 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:36:19,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:36:19,676 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:36:19,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-20 06:36:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:36:19,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-20 06:36:19,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:36:19,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:36:19,927 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-20 06:36:19,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 21 [2021-11-20 06:36:19,965 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 06:36:19,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:36:20,188 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-20 06:36:20,188 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:36:20,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214569719] [2021-11-20 06:36:20,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214569719] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 06:36:20,188 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:36:20,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 3] imperfect sequences [] total 6 [2021-11-20 06:36:20,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773778015] [2021-11-20 06:36:20,189 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 06:36:20,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 06:36:20,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:36:20,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 06:36:20,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:36:20,190 INFO L87 Difference]: Start difference. First operand 91 states and 108 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-20 06:36:20,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:36:20,242 INFO L93 Difference]: Finished difference Result 105 states and 121 transitions. [2021-11-20 06:36:20,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 06:36:20,242 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 28 [2021-11-20 06:36:20,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:36:20,244 INFO L225 Difference]: With dead ends: 105 [2021-11-20 06:36:20,244 INFO L226 Difference]: Without dead ends: 105 [2021-11-20 06:36:20,244 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:36:20,245 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 21 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 06:36:20,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 121 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 22 Unchecked, 0.0s Time] [2021-11-20 06:36:20,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-11-20 06:36:20,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 99. [2021-11-20 06:36:20,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 84 states have internal predecessors, (97), 6 states have call successors, (6), 6 states have call predecessors, (6), 11 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2021-11-20 06:36:20,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2021-11-20 06:36:20,261 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 28 [2021-11-20 06:36:20,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:36:20,262 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2021-11-20 06:36:20,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-20 06:36:20,262 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2021-11-20 06:36:20,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 06:36:20,265 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:36:20,265 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:36:20,281 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-20 06:36:20,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:36:20,475 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:36:20,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:36:20,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1844216072, now seen corresponding path program 1 times [2021-11-20 06:36:20,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:36:20,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1318475502] [2021-11-20 06:36:20,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:36:20,476 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:36:20,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:36:20,477 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:36:20,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-20 06:36:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:36:20,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-20 06:36:20,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:36:20,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:36:20,625 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:36:22,960 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 06:36:22,960 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 35 [2021-11-20 06:36:22,974 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:36:22,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 27 [2021-11-20 06:36:23,253 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 06:36:23,253 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 35 [2021-11-20 06:36:23,266 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:36:23,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 27 [2021-11-20 06:36:23,338 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-20 06:36:23,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:36:36,476 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-20 06:36:36,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 45 treesize of output 44 [2021-11-20 06:36:51,485 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_77| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14| (_ BitVec 32))) (or (= |v_ldv_malloc_#res.base_77| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|) (and (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)))) (bvule (bvadd .cse0 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv4 32)) (bvadd .cse0 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32)))) (forall ((v_ldv_malloc_~size_72 (_ BitVec 32))) (bvule (bvadd (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32)) (select (store |c_#length| |v_ldv_malloc_#res.base_77| v_ldv_malloc_~size_72) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|)))) (exists ((|v_ldv_malloc_#res.base_77| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_81|))) (not (= |v_ldv_malloc_#res.base_77| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|)) (or (exists ((v_ldv_malloc_~size_76 (_ BitVec 32)) (v_ldv_malloc_~size_72 (_ BitVec 32))) (not (bvule (bvadd (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32)) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ldv_malloc_#res.base_77| v_ldv_malloc_~size_72) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|)))) (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)))) (bvule (bvadd .cse1 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv4 32)) (bvadd .cse1 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32)))))))))) is different from false [2021-11-20 06:37:10,362 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_77| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_ldv_malloc_#res.base_82| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14| (_ BitVec 32))) (or (and (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_72 (_ BitVec 32))) (bvule (bvadd (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32)) (select (store (store |c_#length| |v_ldv_malloc_#res.base_82| ldv_malloc_~size) |v_ldv_malloc_#res.base_77| v_ldv_malloc_~size_72) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|))) (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)))) (bvule (bvadd .cse0 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv4 32)) (bvadd .cse0 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32))))) (= |v_ldv_malloc_#res.base_77| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_82|)))) (exists ((|v_ldv_malloc_#res.base_77| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_81|))) (not (= |v_ldv_malloc_#res.base_77| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|)) (or (exists ((v_ldv_malloc_~size_76 (_ BitVec 32)) (v_ldv_malloc_~size_72 (_ BitVec 32))) (not (bvule (bvadd (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32)) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ldv_malloc_#res.base_77| v_ldv_malloc_~size_72) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|)))) (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)))) (bvule (bvadd .cse1 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv4 32)) (bvadd .cse1 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32)))))))))) is different from false [2021-11-20 06:37:21,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 59 treesize of output 57 [2021-11-20 06:37:23,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 55 treesize of output 53 [2021-11-20 06:37:23,235 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2021-11-20 06:37:23,235 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:37:23,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1318475502] [2021-11-20 06:37:23,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1318475502] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:37:23,235 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:37:23,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 24 [2021-11-20 06:37:23,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563348082] [2021-11-20 06:37:23,236 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:37:23,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-20 06:37:23,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:37:23,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-20 06:37:23,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=433, Unknown=11, NotChecked=86, Total=600 [2021-11-20 06:37:23,237 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand has 25 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 23 states have internal predecessors, (40), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-20 06:37:25,631 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_old(#valid)| |c_#valid|) (forall ((|v_ldv_malloc_#res.base_77| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_ldv_malloc_#res.base_82| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14| (_ BitVec 32))) (or (and (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_72 (_ BitVec 32))) (bvule (bvadd (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32)) (select (store (store |c_#length| |v_ldv_malloc_#res.base_82| ldv_malloc_~size) |v_ldv_malloc_#res.base_77| v_ldv_malloc_~size_72) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|))) (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)))) (bvule (bvadd .cse0 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv4 32)) (bvadd .cse0 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32))))) (= |v_ldv_malloc_#res.base_77| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_82|)))) (exists ((|v_ldv_malloc_#res.base_77| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_81|))) (not (= |v_ldv_malloc_#res.base_77| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|)) (or (exists ((v_ldv_malloc_~size_76 (_ BitVec 32)) (v_ldv_malloc_~size_72 (_ BitVec 32))) (not (bvule (bvadd (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32)) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ldv_malloc_#res.base_77| v_ldv_malloc_~size_72) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|)))) (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)))) (bvule (bvadd .cse1 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv4 32)) (bvadd .cse1 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32)))))))))) (= |c_#length| |c_old(#length)|)) is different from false [2021-11-20 06:37:27,648 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_old(#valid)| |c_#valid|) (forall ((|v_ldv_malloc_#res.base_77| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_ldv_malloc_#res.base_82| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14| (_ BitVec 32))) (or (and (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_72 (_ BitVec 32))) (bvule (bvadd (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32)) (select (store (store |c_#length| |v_ldv_malloc_#res.base_82| ldv_malloc_~size) |v_ldv_malloc_#res.base_77| v_ldv_malloc_~size_72) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|))) (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)))) (bvule (bvadd .cse0 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv4 32)) (bvadd .cse0 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32))))) (= |v_ldv_malloc_#res.base_77| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_82|)))) (exists ((|v_ldv_malloc_#res.base_77| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_81|))) (not (= |v_ldv_malloc_#res.base_77| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|)) (or (exists ((v_ldv_malloc_~size_76 (_ BitVec 32)) (v_ldv_malloc_~size_72 (_ BitVec 32))) (not (bvule (bvadd (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32)) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ldv_malloc_#res.base_77| v_ldv_malloc_~size_72) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|)))) (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)))) (bvule (bvadd .cse1 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv4 32)) (bvadd .cse1 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32)))))))))) (= c_ldv_malloc_~size |c_ldv_malloc_#in~size|) (= |c_#length| |c_old(#length)|)) is different from false [2021-11-20 06:37:29,673 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| ldv_malloc_~size) |c_#length|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |ldv_malloc_#res.base|)))))))) (= (select |c_#length| |c_ldv_malloc_#res.base|) |c_ldv_malloc_#in~size|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ldv_malloc_#res.base|))) (forall ((|v_ldv_malloc_#res.base_77| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14| (_ BitVec 32))) (or (= |v_ldv_malloc_#res.base_77| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|) (and (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)))) (bvule (bvadd .cse0 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv4 32)) (bvadd .cse0 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32)))) (forall ((v_ldv_malloc_~size_72 (_ BitVec 32))) (bvule (bvadd (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32)) (select (store |c_#length| |v_ldv_malloc_#res.base_77| v_ldv_malloc_~size_72) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|)))) (exists ((|v_ldv_malloc_#res.base_77| (_ BitVec 32)) (|v_ldv_malloc_#res.base_81| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_81|))) (not (= |v_ldv_malloc_#res.base_77| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|)) (or (exists ((v_ldv_malloc_~size_76 (_ BitVec 32)) (v_ldv_malloc_~size_72 (_ BitVec 32))) (not (bvule (bvadd (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32)) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_81| v_ldv_malloc_~size_76) |v_ldv_malloc_#res.base_77| v_ldv_malloc_~size_72) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|)))) (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)))) (bvule (bvadd .cse1 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv4 32)) (bvadd .cse1 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32)))))))))) (= |c_ldv_malloc_#res.offset| (_ bv0 32))) is different from false [2021-11-20 06:37:51,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:37:51,693 INFO L93 Difference]: Finished difference Result 114 states and 131 transitions. [2021-11-20 06:37:51,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-20 06:37:51,695 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 23 states have internal predecessors, (40), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 28 [2021-11-20 06:37:51,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:37:51,700 INFO L225 Difference]: With dead ends: 114 [2021-11-20 06:37:51,701 INFO L226 Difference]: Without dead ends: 114 [2021-11-20 06:37:51,701 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 54.6s TimeCoverageRelationStatistics Valid=119, Invalid=690, Unknown=23, NotChecked=290, Total=1122 [2021-11-20 06:37:51,702 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 27 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 345 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 06:37:51,702 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 428 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 111 Invalid, 0 Unknown, 345 Unchecked, 0.3s Time] [2021-11-20 06:37:51,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-11-20 06:37:51,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2021-11-20 06:37:51,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 95 states have internal predecessors, (110), 7 states have call successors, (7), 7 states have call predecessors, (7), 13 states have return successors, (13), 10 states have call predecessors, (13), 7 states have call successors, (13) [2021-11-20 06:37:51,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 130 transitions. [2021-11-20 06:37:51,720 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 130 transitions. Word has length 28 [2021-11-20 06:37:51,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:37:51,721 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 130 transitions. [2021-11-20 06:37:51,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 23 states have internal predecessors, (40), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-20 06:37:51,721 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 130 transitions. [2021-11-20 06:37:51,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 06:37:51,722 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:37:51,722 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:37:51,735 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-20 06:37:51,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:37:51,932 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:37:51,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:37:51,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1940217047, now seen corresponding path program 1 times [2021-11-20 06:37:51,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:37:51,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475731198] [2021-11-20 06:37:51,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:37:51,933 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:37:51,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:37:51,934 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:37:51,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-20 06:37:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:37:51,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-20 06:37:51,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:37:52,086 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 06:37:52,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:37:52,211 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-20 06:37:52,212 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:37:52,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475731198] [2021-11-20 06:37:52,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [475731198] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-20 06:37:52,212 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 06:37:52,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2021-11-20 06:37:52,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086893423] [2021-11-20 06:37:52,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:37:52,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 06:37:52,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:37:52,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 06:37:52,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:37:52,214 INFO L87 Difference]: Start difference. First operand 113 states and 130 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-20 06:37:52,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:37:52,247 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2021-11-20 06:37:52,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 06:37:52,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2021-11-20 06:37:52,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:37:52,249 INFO L225 Difference]: With dead ends: 88 [2021-11-20 06:37:52,249 INFO L226 Difference]: Without dead ends: 84 [2021-11-20 06:37:52,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:37:52,251 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 21 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 06:37:52,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 141 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 06:37:52,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-11-20 06:37:52,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2021-11-20 06:37:52,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.280701754385965) internal successors, (73), 67 states have internal predecessors, (73), 5 states have call successors, (5), 5 states have call predecessors, (5), 8 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2021-11-20 06:37:52,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2021-11-20 06:37:52,256 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 28 [2021-11-20 06:37:52,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:37:52,257 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2021-11-20 06:37:52,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-20 06:37:52,257 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2021-11-20 06:37:52,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-20 06:37:52,258 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:37:52,258 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:37:52,268 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-20 06:37:52,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:37:52,463 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:37:52,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:37:52,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1022360221, now seen corresponding path program 1 times [2021-11-20 06:37:52,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:37:52,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [257349240] [2021-11-20 06:37:52,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:37:52,464 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:37:52,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:37:52,465 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:37:52,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-20 06:37:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:37:52,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-20 06:37:52,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:37:52,862 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 06:37:52,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:37:53,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 9 [2021-11-20 06:37:54,423 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 06:37:54,423 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:37:54,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [257349240] [2021-11-20 06:37:54,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [257349240] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:37:54,423 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:37:54,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2021-11-20 06:37:54,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561199087] [2021-11-20 06:37:54,423 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:37:54,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-20 06:37:54,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:37:54,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-20 06:37:54,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-11-20 06:37:54,425 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-20 06:37:56,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:37:56,289 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2021-11-20 06:37:56,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-20 06:37:56,290 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 30 [2021-11-20 06:37:56,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:37:56,291 INFO L225 Difference]: With dead ends: 117 [2021-11-20 06:37:56,292 INFO L226 Difference]: Without dead ends: 117 [2021-11-20 06:37:56,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2021-11-20 06:37:56,293 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 86 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-20 06:37:56,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 305 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 322 Invalid, 0 Unknown, 44 Unchecked, 1.4s Time] [2021-11-20 06:37:56,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-11-20 06:37:56,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 91. [2021-11-20 06:37:56,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 78 states have internal predecessors, (90), 5 states have call successors, (5), 5 states have call predecessors, (5), 8 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2021-11-20 06:37:56,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2021-11-20 06:37:56,299 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 30 [2021-11-20 06:37:56,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:37:56,300 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2021-11-20 06:37:56,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-20 06:37:56,300 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2021-11-20 06:37:56,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 06:37:56,301 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:37:56,301 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:37:56,319 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-11-20 06:37:56,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:37:56,513 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:37:56,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:37:56,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1628395789, now seen corresponding path program 1 times [2021-11-20 06:37:56,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:37:56,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1167235762] [2021-11-20 06:37:56,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:37:56,514 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:37:56,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:37:56,541 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:37:56,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-20 06:37:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:37:56,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-20 06:37:56,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:37:56,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 11 [2021-11-20 06:37:57,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:37:57,079 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-20 06:37:57,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:37:57,411 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-20 06:37:57,411 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:37:57,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1167235762] [2021-11-20 06:37:57,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1167235762] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:37:57,411 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:37:57,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2021-11-20 06:37:57,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822260792] [2021-11-20 06:37:57,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:37:57,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-20 06:37:57,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:37:57,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-20 06:37:57,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2021-11-20 06:37:57,414 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand has 17 states, 16 states have (on average 2.375) internal successors, (38), 14 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-20 06:37:58,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:37:58,749 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2021-11-20 06:37:58,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-20 06:37:58,750 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.375) internal successors, (38), 14 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 31 [2021-11-20 06:37:58,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:37:58,751 INFO L225 Difference]: With dead ends: 122 [2021-11-20 06:37:58,751 INFO L226 Difference]: Without dead ends: 122 [2021-11-20 06:37:58,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=151, Invalid=779, Unknown=0, NotChecked=0, Total=930 [2021-11-20 06:37:58,753 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 171 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-20 06:37:58,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 330 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 429 Invalid, 0 Unknown, 40 Unchecked, 0.8s Time] [2021-11-20 06:37:58,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-11-20 06:37:58,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 93. [2021-11-20 06:37:58,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 71 states have (on average 1.295774647887324) internal successors, (92), 80 states have internal predecessors, (92), 5 states have call successors, (5), 5 states have call predecessors, (5), 8 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2021-11-20 06:37:58,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2021-11-20 06:37:58,759 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 31 [2021-11-20 06:37:58,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:37:58,760 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2021-11-20 06:37:58,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.375) internal successors, (38), 14 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-20 06:37:58,760 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2021-11-20 06:37:58,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-20 06:37:58,761 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:37:58,761 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:37:58,780 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-11-20 06:37:58,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:37:58,976 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:37:58,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:37:58,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1304384650, now seen corresponding path program 1 times [2021-11-20 06:37:58,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:37:58,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1077090998] [2021-11-20 06:37:58,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:37:58,978 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:37:58,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:37:58,979 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:37:58,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-20 06:37:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:37:59,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 06:37:59,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:37:59,261 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-20 06:37:59,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:37:59,480 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-20 06:37:59,481 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:37:59,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1077090998] [2021-11-20 06:37:59,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1077090998] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:37:59,481 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:37:59,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-11-20 06:37:59,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998116695] [2021-11-20 06:37:59,481 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:37:59,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 06:37:59,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:37:59,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 06:37:59,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-20 06:37:59,482 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-20 06:37:59,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:37:59,810 INFO L93 Difference]: Finished difference Result 198 states and 209 transitions. [2021-11-20 06:37:59,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 06:37:59,811 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 32 [2021-11-20 06:37:59,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:37:59,813 INFO L225 Difference]: With dead ends: 198 [2021-11-20 06:37:59,813 INFO L226 Difference]: Without dead ends: 198 [2021-11-20 06:37:59,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2021-11-20 06:37:59,814 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 419 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 06:37:59,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [420 Valid, 250 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 06:37:59,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-20 06:37:59,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 107. [2021-11-20 06:37:59,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 83 states have (on average 1.2650602409638554) internal successors, (105), 92 states have internal predecessors, (105), 7 states have call successors, (7), 5 states have call predecessors, (7), 8 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2021-11-20 06:37:59,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 124 transitions. [2021-11-20 06:37:59,822 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 124 transitions. Word has length 32 [2021-11-20 06:37:59,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:37:59,823 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 124 transitions. [2021-11-20 06:37:59,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-20 06:37:59,823 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 124 transitions. [2021-11-20 06:37:59,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-20 06:37:59,823 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:37:59,824 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:37:59,836 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-11-20 06:38:00,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:38:00,035 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:38:00,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:38:00,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1059338178, now seen corresponding path program 1 times [2021-11-20 06:38:00,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:38:00,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [979286446] [2021-11-20 06:38:00,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:38:00,036 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:38:00,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:38:00,037 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:38:00,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-11-20 06:38:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:38:00,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-20 06:38:00,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:38:00,561 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 15 [2021-11-20 06:38:01,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:38:01,246 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:38:01,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:38:01,825 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-20 06:38:01,825 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:38:01,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [979286446] [2021-11-20 06:38:01,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [979286446] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:38:01,825 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:38:01,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 21 [2021-11-20 06:38:01,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896091231] [2021-11-20 06:38:01,826 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:38:01,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-20 06:38:01,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:38:01,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-20 06:38:01,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2021-11-20 06:38:01,827 INFO L87 Difference]: Start difference. First operand 107 states and 124 transitions. Second operand has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 19 states have internal predecessors, (49), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-20 06:38:02,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:38:02,602 INFO L93 Difference]: Finished difference Result 120 states and 135 transitions. [2021-11-20 06:38:02,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-20 06:38:02,604 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 19 states have internal predecessors, (49), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 32 [2021-11-20 06:38:02,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:38:02,605 INFO L225 Difference]: With dead ends: 120 [2021-11-20 06:38:02,605 INFO L226 Difference]: Without dead ends: 120 [2021-11-20 06:38:02,606 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=135, Invalid=677, Unknown=0, NotChecked=0, Total=812 [2021-11-20 06:38:02,607 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 53 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 225 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 06:38:02,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 289 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 225 Unchecked, 0.3s Time] [2021-11-20 06:38:02,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-11-20 06:38:02,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 109. [2021-11-20 06:38:02,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 94 states have internal predecessors, (107), 7 states have call successors, (7), 5 states have call predecessors, (7), 8 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2021-11-20 06:38:02,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2021-11-20 06:38:02,614 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 32 [2021-11-20 06:38:02,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:38:02,615 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2021-11-20 06:38:02,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 19 states have internal predecessors, (49), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-20 06:38:02,615 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2021-11-20 06:38:02,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-20 06:38:02,616 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:38:02,616 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:38:02,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-11-20 06:38:02,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:38:02,829 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:38:02,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:38:02,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1520254763, now seen corresponding path program 1 times [2021-11-20 06:38:02,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:38:02,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [142435013] [2021-11-20 06:38:02,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:38:02,831 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:38:02,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:38:02,832 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:38:02,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-11-20 06:38:02,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:38:02,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-20 06:38:02,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:38:02,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:38:03,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 21 [2021-11-20 06:38:03,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 13 [2021-11-20 06:38:03,354 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 [2021-11-20 06:38:03,394 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 06:38:03,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:38:03,956 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 06:38:03,957 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:38:03,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [142435013] [2021-11-20 06:38:03,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [142435013] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:38:03,957 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:38:03,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2021-11-20 06:38:03,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090567052] [2021-11-20 06:38:03,958 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:38:03,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-20 06:38:03,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:38:03,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-20 06:38:03,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-11-20 06:38:03,960 INFO L87 Difference]: Start difference. First operand 109 states and 126 transitions. Second operand has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-20 06:38:05,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:38:05,518 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2021-11-20 06:38:05,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-20 06:38:05,519 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 33 [2021-11-20 06:38:05,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:38:05,521 INFO L225 Difference]: With dead ends: 119 [2021-11-20 06:38:05,521 INFO L226 Difference]: Without dead ends: 119 [2021-11-20 06:38:05,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2021-11-20 06:38:05,522 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 48 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-20 06:38:05,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 276 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 407 Invalid, 0 Unknown, 39 Unchecked, 0.9s Time] [2021-11-20 06:38:05,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-11-20 06:38:05,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111. [2021-11-20 06:38:05,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 87 states have (on average 1.2528735632183907) internal successors, (109), 96 states have internal predecessors, (109), 7 states have call successors, (7), 5 states have call predecessors, (7), 8 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2021-11-20 06:38:05,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 128 transitions. [2021-11-20 06:38:05,531 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 128 transitions. Word has length 33 [2021-11-20 06:38:05,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:38:05,531 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 128 transitions. [2021-11-20 06:38:05,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-20 06:38:05,532 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 128 transitions. [2021-11-20 06:38:05,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 06:38:05,532 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:38:05,533 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:38:05,544 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-11-20 06:38:05,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:38:05,735 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:38:05,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:38:05,736 INFO L85 PathProgramCache]: Analyzing trace with hash 520579815, now seen corresponding path program 1 times [2021-11-20 06:38:05,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:38:05,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583479764] [2021-11-20 06:38:05,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:38:05,736 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:38:05,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:38:05,737 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:38:05,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-11-20 06:38:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:38:05,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 06:38:05,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:38:05,984 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-20 06:38:05,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:38:06,203 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-20 06:38:06,203 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:38:06,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1583479764] [2021-11-20 06:38:06,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1583479764] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:38:06,203 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:38:06,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-11-20 06:38:06,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108977033] [2021-11-20 06:38:06,204 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:38:06,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 06:38:06,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:38:06,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 06:38:06,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-20 06:38:06,205 INFO L87 Difference]: Start difference. First operand 111 states and 128 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-20 06:38:06,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:38:06,470 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2021-11-20 06:38:06,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 06:38:06,471 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 36 [2021-11-20 06:38:06,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:38:06,472 INFO L225 Difference]: With dead ends: 116 [2021-11-20 06:38:06,472 INFO L226 Difference]: Without dead ends: 116 [2021-11-20 06:38:06,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-11-20 06:38:06,473 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 47 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 06:38:06,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 243 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 06:38:06,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-11-20 06:38:06,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2021-11-20 06:38:06,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 83 states have (on average 1.1927710843373494) internal successors, (99), 92 states have internal predecessors, (99), 7 states have call successors, (7), 5 states have call predecessors, (7), 8 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2021-11-20 06:38:06,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2021-11-20 06:38:06,481 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 36 [2021-11-20 06:38:06,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:38:06,481 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2021-11-20 06:38:06,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-20 06:38:06,482 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2021-11-20 06:38:06,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-20 06:38:06,482 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:38:06,483 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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] [2021-11-20 06:38:06,495 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-11-20 06:38:06,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:38:06,687 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:38:06,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:38:06,688 INFO L85 PathProgramCache]: Analyzing trace with hash 2060951864, now seen corresponding path program 1 times [2021-11-20 06:38:06,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:38:06,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877726035] [2021-11-20 06:38:06,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:38:06,688 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:38:06,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:38:06,689 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:38:06,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-11-20 06:38:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:38:06,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-20 06:38:06,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:38:06,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:38:06,981 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-20 06:38:06,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 32 [2021-11-20 06:38:07,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 25 [2021-11-20 06:38:07,332 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-20 06:38:07,333 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 30 [2021-11-20 06:38:11,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 23 [2021-11-20 06:38:11,739 INFO L354 Elim1Store]: treesize reduction 20, result has 28.6 percent of original size [2021-11-20 06:38:11,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 38 [2021-11-20 06:38:11,837 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:38:11,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:38:21,116 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:38:21,116 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:38:21,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [877726035] [2021-11-20 06:38:21,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [877726035] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:38:21,117 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:38:21,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2021-11-20 06:38:21,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318038822] [2021-11-20 06:38:21,117 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:38:21,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-20 06:38:21,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:38:21,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-20 06:38:21,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=613, Unknown=5, NotChecked=0, Total=702 [2021-11-20 06:38:21,119 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 23 states have internal predecessors, (61), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-20 06:38:47,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:38:47,861 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2021-11-20 06:38:47,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-20 06:38:47,862 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 23 states have internal predecessors, (61), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 38 [2021-11-20 06:38:47,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:38:47,863 INFO L225 Difference]: With dead ends: 127 [2021-11-20 06:38:47,863 INFO L226 Difference]: Without dead ends: 127 [2021-11-20 06:38:47,864 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 38.8s TimeCoverageRelationStatistics Valid=191, Invalid=1434, Unknown=15, NotChecked=0, Total=1640 [2021-11-20 06:38:47,865 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 65 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-20 06:38:47,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 302 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 509 Invalid, 0 Unknown, 171 Unchecked, 1.2s Time] [2021-11-20 06:38:47,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-11-20 06:38:47,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 113. [2021-11-20 06:38:47,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 89 states have (on average 1.2134831460674158) internal successors, (108), 98 states have internal predecessors, (108), 7 states have call successors, (7), 5 states have call predecessors, (7), 8 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2021-11-20 06:38:47,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2021-11-20 06:38:47,873 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 38 [2021-11-20 06:38:47,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:38:47,873 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2021-11-20 06:38:47,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 23 states have internal predecessors, (61), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-20 06:38:47,874 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2021-11-20 06:38:47,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-20 06:38:47,874 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:38:47,875 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:38:47,897 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-11-20 06:38:48,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:38:48,088 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:38:48,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:38:48,088 INFO L85 PathProgramCache]: Analyzing trace with hash -752423482, now seen corresponding path program 1 times [2021-11-20 06:38:48,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:38:48,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1530580176] [2021-11-20 06:38:48,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:38:48,088 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:38:48,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:38:48,089 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:38:48,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-11-20 06:38:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:38:48,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 06:38:48,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:38:48,278 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-20 06:38:48,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:38:48,487 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-20 06:38:48,488 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:38:48,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1530580176] [2021-11-20 06:38:48,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1530580176] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:38:48,488 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:38:48,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-11-20 06:38:48,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335873055] [2021-11-20 06:38:48,489 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:38:48,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 06:38:48,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:38:48,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 06:38:48,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-11-20 06:38:48,491 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-20 06:38:48,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:38:48,906 INFO L93 Difference]: Finished difference Result 151 states and 163 transitions. [2021-11-20 06:38:48,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 06:38:48,907 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 40 [2021-11-20 06:38:48,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:38:48,909 INFO L225 Difference]: With dead ends: 151 [2021-11-20 06:38:48,909 INFO L226 Difference]: Without dead ends: 151 [2021-11-20 06:38:48,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-11-20 06:38:48,910 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 213 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 06:38:48,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 243 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 06:38:48,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-11-20 06:38:48,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 123. [2021-11-20 06:38:48,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 99 states have (on average 1.1818181818181819) internal successors, (117), 107 states have internal predecessors, (117), 7 states have call successors, (7), 5 states have call predecessors, (7), 8 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2021-11-20 06:38:48,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 136 transitions. [2021-11-20 06:38:48,930 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 136 transitions. Word has length 40 [2021-11-20 06:38:48,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:38:48,930 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 136 transitions. [2021-11-20 06:38:48,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-20 06:38:48,931 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2021-11-20 06:38:48,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-20 06:38:48,931 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:38:48,932 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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] [2021-11-20 06:38:48,950 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-11-20 06:38:49,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:38:49,146 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:38:49,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:38:49,146 INFO L85 PathProgramCache]: Analyzing trace with hash 594821051, now seen corresponding path program 1 times [2021-11-20 06:38:49,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:38:49,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526559255] [2021-11-20 06:38:49,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:38:49,147 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:38:49,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:38:49,148 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:38:49,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-11-20 06:38:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:38:49,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-20 06:38:49,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:38:49,702 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 36 [2021-11-20 06:38:49,901 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-20 06:38:49,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 31 [2021-11-20 06:38:54,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 31 [2021-11-20 06:38:56,668 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 06:38:56,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:39:06,440 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_30| (_ BitVec 32)) (|v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_ULTIMATE.start_entry_point_#t~ret40#1.base_111| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_entry_point_#t~ret40#1.base_111|)))) (not (= (store (store |c_old(#valid)| |v_ULTIMATE.start_entry_point_#t~ret40#1.base_111| (_ bv0 1)) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_30| (_ bv0 1)) |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_11|)))) (= (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_30| (_ bv0 1)) |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_11|))) is different from false [2021-11-20 06:39:27,030 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret40#1.base_111| (_ BitVec 32)) (|v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_192| (_ BitVec 32))) (let ((.cse0 (store |c_#valid| |v_ldv_malloc_#res.base_192| (_ bv1 1)))) (or (= (store (store .cse0 |v_ULTIMATE.start_entry_point_#t~ret40#1.base_111| (_ bv0 1)) |v_ldv_malloc_#res.base_192| (_ bv0 1)) |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_12|) (not (= (_ bv0 1) (bvneg (bvneg (select .cse0 |v_ULTIMATE.start_entry_point_#t~ret40#1.base_111|))))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_192|))))) (exists ((|v_ULTIMATE.start_entry_point_#t~ret40#1.base_111| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_#t~ret38#1.base_72| (_ BitVec 32))) (let ((.cse1 (store |c_old(#valid)| |v_ULTIMATE.start_entry_point_#t~ret38#1.base_72| (_ bv1 1)))) (and (not (= (store (store .cse1 |v_ULTIMATE.start_entry_point_#t~ret40#1.base_111| (_ bv0 1)) |v_ULTIMATE.start_entry_point_#t~ret38#1.base_72| (_ bv0 1)) |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_12|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_entry_point_#t~ret38#1.base_72|)))))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select .cse1 |v_ULTIMATE.start_entry_point_#t~ret40#1.base_111|)))))))))))) is different from false [2021-11-20 06:39:27,453 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2021-11-20 06:39:27,453 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:39:27,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526559255] [2021-11-20 06:39:27,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526559255] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:39:27,453 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:39:27,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2021-11-20 06:39:27,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039193761] [2021-11-20 06:39:27,454 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:39:27,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-20 06:39:27,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:39:27,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-20 06:39:27,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=758, Unknown=36, NotChecked=114, Total=992 [2021-11-20 06:39:27,456 INFO L87 Difference]: Start difference. First operand 123 states and 136 transitions. Second operand has 32 states, 30 states have (on average 2.2) internal successors, (66), 28 states have internal predecessors, (66), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-20 06:39:29,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:39:29,326 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2021-11-20 06:39:29,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-20 06:39:29,344 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 2.2) internal successors, (66), 28 states have internal predecessors, (66), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2021-11-20 06:39:29,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:39:29,345 INFO L225 Difference]: With dead ends: 127 [2021-11-20 06:39:29,345 INFO L226 Difference]: Without dead ends: 110 [2021-11-20 06:39:29,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 37.4s TimeCoverageRelationStatistics Valid=117, Invalid=1042, Unknown=39, NotChecked=134, Total=1332 [2021-11-20 06:39:29,346 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 24 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 257 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-20 06:39:29,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 426 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 359 Invalid, 0 Unknown, 257 Unchecked, 0.9s Time] [2021-11-20 06:39:29,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-11-20 06:39:29,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2021-11-20 06:39:29,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 87 states have (on average 1.1954022988505748) internal successors, (104), 95 states have internal predecessors, (104), 7 states have call successors, (7), 5 states have call predecessors, (7), 7 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2021-11-20 06:39:29,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2021-11-20 06:39:29,353 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 40 [2021-11-20 06:39:29,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:39:29,353 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2021-11-20 06:39:29,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 2.2) internal successors, (66), 28 states have internal predecessors, (66), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-20 06:39:29,354 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2021-11-20 06:39:29,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-20 06:39:29,355 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:39:29,355 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:39:29,368 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-11-20 06:39:29,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:39:29,569 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:39:29,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:39:29,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1236217923, now seen corresponding path program 1 times [2021-11-20 06:39:29,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:39:29,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1027646529] [2021-11-20 06:39:29,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:39:29,569 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:39:29,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:39:29,570 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:39:29,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-11-20 06:39:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:39:29,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-20 06:39:29,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:39:30,106 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-20 06:39:30,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:39:30,534 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 30 [2021-11-20 06:39:32,790 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-20 06:39:32,791 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:39:32,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1027646529] [2021-11-20 06:39:32,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1027646529] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:39:32,791 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:39:32,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2021-11-20 06:39:32,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582722899] [2021-11-20 06:39:32,791 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:39:32,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-20 06:39:32,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:39:32,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-20 06:39:32,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-11-20 06:39:32,792 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand has 18 states, 17 states have (on average 3.411764705882353) internal successors, (58), 16 states have internal predecessors, (58), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2021-11-20 06:39:42,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:39:42,856 INFO L93 Difference]: Finished difference Result 216 states and 223 transitions. [2021-11-20 06:39:42,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-20 06:39:42,858 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.411764705882353) internal successors, (58), 16 states have internal predecessors, (58), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 46 [2021-11-20 06:39:42,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:39:42,859 INFO L225 Difference]: With dead ends: 216 [2021-11-20 06:39:42,859 INFO L226 Difference]: Without dead ends: 216 [2021-11-20 06:39:42,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2021-11-20 06:39:42,860 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 337 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-11-20 06:39:42,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [337 Valid, 500 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2021-11-20 06:39:42,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-11-20 06:39:42,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 118. [2021-11-20 06:39:42,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 95 states have (on average 1.231578947368421) internal successors, (117), 103 states have internal predecessors, (117), 7 states have call successors, (7), 5 states have call predecessors, (7), 7 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2021-11-20 06:39:42,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 135 transitions. [2021-11-20 06:39:42,868 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 135 transitions. Word has length 46 [2021-11-20 06:39:42,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:39:42,868 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 135 transitions. [2021-11-20 06:39:42,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.411764705882353) internal successors, (58), 16 states have internal predecessors, (58), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2021-11-20 06:39:42,869 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 135 transitions. [2021-11-20 06:39:42,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-20 06:39:42,869 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:39:42,869 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:39:42,880 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-11-20 06:39:43,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:39:43,070 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:39:43,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:39:43,070 INFO L85 PathProgramCache]: Analyzing trace with hash -519500702, now seen corresponding path program 2 times [2021-11-20 06:39:43,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:39:43,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [30291913] [2021-11-20 06:39:43,071 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:39:43,071 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:39:43,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:39:43,072 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:39:43,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-11-20 06:39:43,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:39:43,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:39:43,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 42 conjunts are in the unsatisfiable core [2021-11-20 06:39:43,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:39:43,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:39:43,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:39:45,561 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 06:39:45,562 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 34 [2021-11-20 06:39:45,581 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:39:45,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 26 [2021-11-20 06:39:45,878 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 06:39:45,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 33 [2021-11-20 06:39:45,892 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:39:45,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2021-11-20 06:39:46,182 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 06:39:46,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 32 [2021-11-20 06:39:46,201 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:39:46,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 24 [2021-11-20 06:39:46,488 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 06:39:46,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 33 [2021-11-20 06:39:46,501 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:39:46,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2021-11-20 06:39:46,605 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 4 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-20 06:39:46,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:40:08,819 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-20 06:40:08,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 44 treesize of output 43 [2021-11-20 06:41:01,510 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-20 06:41:01,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 44 treesize of output 43 [2021-11-20 06:41:25,987 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| (_ BitVec 32))) (or (exists ((|v_ldv_malloc_#res.base_216| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_208|)) (or (exists ((v_ldv_malloc_~size_196 (_ BitVec 32)) (v_ldv_malloc_~size_204 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)) (_ bv12 32)) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_216| v_ldv_malloc_~size_204) |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37|)))) (not (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (_ bv8 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse0 (_ bv12 32)))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_216|)))))))) (and (forall ((v_ldv_malloc_~size_196 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)) (_ bv12 32)) (select (store |c_#length| |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37|))) (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (_ bv8 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse1 (_ bv12 32))))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_208|))) is different from false [2021-11-20 06:41:46,413 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_217| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| (_ BitVec 32))) (or (exists ((|v_ldv_malloc_#res.base_216| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_208|)) (or (exists ((v_ldv_malloc_~size_196 (_ BitVec 32)) (v_ldv_malloc_~size_204 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)) (_ bv12 32)) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_216| v_ldv_malloc_~size_204) |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37|)))) (not (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (_ bv8 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse0 (_ bv12 32)))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_216|)))))))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_208|) (and (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_196 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)) (_ bv12 32)) (select (store (store |c_#length| |v_ldv_malloc_#res.base_217| ldv_malloc_~size) |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37|))) (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (_ bv8 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse1 (_ bv12 32))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_217|)))))) is different from false [2021-11-20 06:42:07,708 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-20 06:42:07,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 49 [2021-11-20 06:42:10,176 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_216| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32))) (or (= |c_ULTIMATE.start_entry_point_~array~0#1.base| |v_ldv_malloc_#res.base_216|) (= |c_ULTIMATE.start_entry_point_~array~0#1.base| |v_ldv_malloc_#res.base_208|) (and (forall ((v_ldv_malloc_~size_196 (_ BitVec 32)) (v_ldv_malloc_~size_204 (_ BitVec 32))) (bvule (bvadd (_ bv16 32) |c_ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul |c_ULTIMATE.start_entry_point_~i~0#1| (_ bv4 32))) (select (store (store |c_#length| |v_ldv_malloc_#res.base_216| v_ldv_malloc_~size_204) |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |c_ULTIMATE.start_entry_point_~array~0#1.base|))) (let ((.cse0 (bvmul |c_ULTIMATE.start_entry_point_~i~0#1| (_ bv4 32)))) (bvule (bvadd |c_ULTIMATE.start_entry_point_~array~0#1.offset| .cse0 (_ bv12 32)) (bvadd (_ bv16 32) |c_ULTIMATE.start_entry_point_~array~0#1.offset| .cse0)))))) is different from false [2021-11-20 06:42:35,102 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_216| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_55| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| (_ BitVec 32))) (or (exists ((|v_ldv_malloc_#res.base_216| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32)) (|v_ldv_malloc_#res.base_220| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_208|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_220|))))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_216|)) (or (not (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_55| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| .cse0 (_ bv12 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) .cse0)))) (exists ((v_ldv_malloc_~size_196 (_ BitVec 32)) (v_ldv_malloc_~size_208 (_ BitVec 32)) (v_ldv_malloc_~size_204 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_55| (_ bv4 32))) (select (store (store (store |c_old(#length)| |v_ldv_malloc_#res.base_220| v_ldv_malloc_~size_208) |v_ldv_malloc_#res.base_216| v_ldv_malloc_~size_204) |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38|))))))) (and (forall ((v_ldv_malloc_~size_196 (_ BitVec 32)) (v_ldv_malloc_~size_204 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_55| (_ bv4 32))) (select (store (store |c_#length| |v_ldv_malloc_#res.base_216| v_ldv_malloc_~size_204) |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38|))) (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_55| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| .cse1 (_ bv12 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) .cse1)))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_208|) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_216|))) is different from false [2021-11-20 06:43:04,749 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_216| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_55| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ BitVec 32)) (|v_ldv_malloc_#res.base_221| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| (_ BitVec 32))) (or (exists ((|v_ldv_malloc_#res.base_216| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32)) (|v_ldv_malloc_#res.base_220| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_208|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_220|))))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_216|)) (or (not (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_55| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| .cse0 (_ bv12 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) .cse0)))) (exists ((v_ldv_malloc_~size_196 (_ BitVec 32)) (v_ldv_malloc_~size_208 (_ BitVec 32)) (v_ldv_malloc_~size_204 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_55| (_ bv4 32))) (select (store (store (store |c_old(#length)| |v_ldv_malloc_#res.base_220| v_ldv_malloc_~size_208) |v_ldv_malloc_#res.base_216| v_ldv_malloc_~size_204) |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38|))))))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_221|))))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_208|) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_216|) (and (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_196 (_ BitVec 32)) (v_ldv_malloc_~size_204 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_55| (_ bv4 32))) (select (store (store (store |c_#length| |v_ldv_malloc_#res.base_221| ldv_malloc_~size) |v_ldv_malloc_#res.base_216| v_ldv_malloc_~size_204) |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38|))) (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_55| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| .cse1 (_ bv12 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) .cse1)))))) is different from false [2021-11-20 06:43:22,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 114 treesize of output 112 [2021-11-20 06:43:24,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 111 treesize of output 109 [2021-11-20 06:43:25,179 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 4 proven. 30 refuted. 4 times theorem prover too weak. 0 trivial. 35 not checked. [2021-11-20 06:43:25,179 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:43:25,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [30291913] [2021-11-20 06:43:25,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [30291913] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:43:25,180 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:43:25,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 23] total 37 [2021-11-20 06:43:25,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454757809] [2021-11-20 06:43:25,180 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:43:25,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-11-20 06:43:25,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:43:25,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-11-20 06:43:25,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=894, Unknown=48, NotChecked=330, Total=1406 [2021-11-20 06:43:25,182 INFO L87 Difference]: Start difference. First operand 118 states and 135 transitions. Second operand has 38 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 36 states have internal predecessors, (66), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-11-20 06:43:31,647 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_old(#valid)| |c_#valid|) (= |c_#length| |c_old(#length)|) (forall ((|v_ldv_malloc_#res.base_216| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_55| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ BitVec 32)) (|v_ldv_malloc_#res.base_221| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| (_ BitVec 32))) (or (exists ((|v_ldv_malloc_#res.base_216| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32)) (|v_ldv_malloc_#res.base_220| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_208|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_220|))))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_216|)) (or (not (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_55| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| .cse0 (_ bv12 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) .cse0)))) (exists ((v_ldv_malloc_~size_196 (_ BitVec 32)) (v_ldv_malloc_~size_208 (_ BitVec 32)) (v_ldv_malloc_~size_204 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_55| (_ bv4 32))) (select (store (store (store |c_old(#length)| |v_ldv_malloc_#res.base_220| v_ldv_malloc_~size_208) |v_ldv_malloc_#res.base_216| v_ldv_malloc_~size_204) |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38|))))))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_221|))))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_208|) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_216|) (and (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_196 (_ BitVec 32)) (v_ldv_malloc_~size_204 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_55| (_ bv4 32))) (select (store (store (store |c_#length| |v_ldv_malloc_#res.base_221| ldv_malloc_~size) |v_ldv_malloc_#res.base_216| v_ldv_malloc_~size_204) |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38|))) (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_55| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| .cse1 (_ bv12 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) .cse1)))))) (forall ((|v_ldv_malloc_#res.base_217| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| (_ BitVec 32))) (or (exists ((|v_ldv_malloc_#res.base_216| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_208|)) (or (exists ((v_ldv_malloc_~size_196 (_ BitVec 32)) (v_ldv_malloc_~size_204 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)) (_ bv12 32)) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_216| v_ldv_malloc_~size_204) |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37|)))) (not (let ((.cse2 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (_ bv8 32) .cse2) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse2 (_ bv12 32)))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_216|)))))))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_208|) (and (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_196 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)) (_ bv12 32)) (select (store (store |c_#length| |v_ldv_malloc_#res.base_217| ldv_malloc_~size) |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37|))) (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (_ bv8 32) .cse3) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse3 (_ bv12 32))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_217|))))))) is different from false [2021-11-20 06:43:33,677 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_old(#valid)| |c_#valid|) (= c_ldv_malloc_~size |c_ldv_malloc_#in~size|) (= |c_#length| |c_old(#length)|) (forall ((|v_ldv_malloc_#res.base_216| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_55| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ BitVec 32)) (|v_ldv_malloc_#res.base_221| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| (_ BitVec 32))) (or (exists ((|v_ldv_malloc_#res.base_216| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32)) (|v_ldv_malloc_#res.base_220| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_208|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_220|))))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_216|)) (or (not (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_55| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| .cse0 (_ bv12 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) .cse0)))) (exists ((v_ldv_malloc_~size_196 (_ BitVec 32)) (v_ldv_malloc_~size_208 (_ BitVec 32)) (v_ldv_malloc_~size_204 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_55| (_ bv4 32))) (select (store (store (store |c_old(#length)| |v_ldv_malloc_#res.base_220| v_ldv_malloc_~size_208) |v_ldv_malloc_#res.base_216| v_ldv_malloc_~size_204) |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38|))))))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_221|))))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_208|) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_216|) (and (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_196 (_ BitVec 32)) (v_ldv_malloc_~size_204 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_55| (_ bv4 32))) (select (store (store (store |c_#length| |v_ldv_malloc_#res.base_221| ldv_malloc_~size) |v_ldv_malloc_#res.base_216| v_ldv_malloc_~size_204) |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38|))) (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_55| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| .cse1 (_ bv12 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) .cse1)))))) (forall ((|v_ldv_malloc_#res.base_217| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| (_ BitVec 32))) (or (exists ((|v_ldv_malloc_#res.base_216| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_208|)) (or (exists ((v_ldv_malloc_~size_196 (_ BitVec 32)) (v_ldv_malloc_~size_204 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)) (_ bv12 32)) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_216| v_ldv_malloc_~size_204) |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37|)))) (not (let ((.cse2 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (_ bv8 32) .cse2) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse2 (_ bv12 32)))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_216|)))))))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_208|) (and (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_196 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)) (_ bv12 32)) (select (store (store |c_#length| |v_ldv_malloc_#res.base_217| ldv_malloc_~size) |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37|))) (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (_ bv8 32) .cse3) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse3 (_ bv12 32))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_217|))))))) is different from false [2021-11-20 06:43:35,724 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| ldv_malloc_~size) |c_#length|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |ldv_malloc_#res.base|)))))))) (forall ((|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| (_ BitVec 32))) (or (exists ((|v_ldv_malloc_#res.base_216| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_208|)) (or (exists ((v_ldv_malloc_~size_196 (_ BitVec 32)) (v_ldv_malloc_~size_204 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)) (_ bv12 32)) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_216| v_ldv_malloc_~size_204) |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37|)))) (not (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (_ bv8 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse0 (_ bv12 32)))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_216|)))))))) (and (forall ((v_ldv_malloc_~size_196 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)) (_ bv12 32)) (select (store |c_#length| |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37|))) (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (_ bv8 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse1 (_ bv12 32))))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_208|))) (= (select |c_#length| |c_ldv_malloc_#res.base|) |c_ldv_malloc_#in~size|) (forall ((|v_ldv_malloc_#res.base_216| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_55| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| (_ BitVec 32))) (or (exists ((|v_ldv_malloc_#res.base_216| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32)) (|v_ldv_malloc_#res.base_220| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_208|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_220|))))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_216|)) (or (not (let ((.cse2 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_55| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| .cse2 (_ bv12 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) .cse2)))) (exists ((v_ldv_malloc_~size_196 (_ BitVec 32)) (v_ldv_malloc_~size_208 (_ BitVec 32)) (v_ldv_malloc_~size_204 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_55| (_ bv4 32))) (select (store (store (store |c_old(#length)| |v_ldv_malloc_#res.base_220| v_ldv_malloc_~size_208) |v_ldv_malloc_#res.base_216| v_ldv_malloc_~size_204) |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38|))))))) (and (forall ((v_ldv_malloc_~size_196 (_ BitVec 32)) (v_ldv_malloc_~size_204 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_55| (_ bv4 32))) (select (store (store |c_#length| |v_ldv_malloc_#res.base_216| v_ldv_malloc_~size_204) |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38|))) (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_55| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| .cse3 (_ bv12 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) .cse3)))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_208|) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_216|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ldv_malloc_#res.base|))) (= |c_ldv_malloc_#res.offset| (_ bv0 32))) is different from false [2021-11-20 06:43:51,937 WARN L227 SmtUtils]: Spent 8.46s on a formula simplification. DAG size of input: 53 DAG size of output: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 06:43:53,957 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ldv_malloc_#res.base_213| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| (_ BitVec 32))) (or (exists ((|v_ldv_malloc_#res.base_208| (_ BitVec 32))) (and (or (exists ((v_ldv_malloc_~size_196 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32))) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36|)))) (not (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv4 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) .cse0))))) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_208|))))) (and (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv4 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) .cse1))) (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_196 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32))) (select (store (store |c_#length| |v_ldv_malloc_#res.base_213| ldv_malloc_~size) |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36|)))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| |v_ldv_malloc_#res.base_208|) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_213|)))))) (forall ((|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_35| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ BitVec 32)) (|v_ldv_malloc_#res.base_209| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (_ BitVec 32))) (or (exists ((|v_ldv_malloc_#res.base_208| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_208|))) (or (not (let ((.cse2 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| .cse2) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| .cse2 (_ bv4 32))))) (exists ((v_ldv_malloc_~size_196 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)) (_ bv4 32)) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_35|))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_209|)))) (and (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| .cse3) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| .cse3 (_ bv4 32)))) (forall ((ldv_malloc_~size (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)) (_ bv4 32)) (select (store |c_#length| |v_ldv_malloc_#res.base_209| ldv_malloc_~size) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_35|)))))) (forall ((|v_ldv_malloc_#res.base_217| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| (_ BitVec 32))) (or (exists ((|v_ldv_malloc_#res.base_216| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_208|)) (or (exists ((v_ldv_malloc_~size_196 (_ BitVec 32)) (v_ldv_malloc_~size_204 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)) (_ bv12 32)) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_216| v_ldv_malloc_~size_204) |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37|)))) (not (let ((.cse4 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (_ bv8 32) .cse4) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse4 (_ bv12 32)))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_216|)))))))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_208|) (and (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_196 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)) (_ bv12 32)) (select (store (store |c_#length| |v_ldv_malloc_#res.base_217| ldv_malloc_~size) |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37|))) (let ((.cse5 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (_ bv8 32) .cse5) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse5 (_ bv12 32))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_217|))))))) is different from false [2021-11-20 06:43:56,129 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ldv_malloc_#res.base_213| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| (_ BitVec 32))) (or (exists ((|v_ldv_malloc_#res.base_208| (_ BitVec 32))) (and (or (exists ((v_ldv_malloc_~size_196 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32))) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36|)))) (not (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv4 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) .cse0))))) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_208|))))) (and (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv4 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) .cse1))) (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_196 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32))) (select (store (store |c_#length| |v_ldv_malloc_#res.base_213| ldv_malloc_~size) |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36|)))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| |v_ldv_malloc_#res.base_208|) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_213|)))))) (= c_ldv_malloc_~size |c_ldv_malloc_#in~size|) (forall ((|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_35| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ BitVec 32)) (|v_ldv_malloc_#res.base_209| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (_ BitVec 32))) (or (exists ((|v_ldv_malloc_#res.base_208| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_208|))) (or (not (let ((.cse2 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| .cse2) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| .cse2 (_ bv4 32))))) (exists ((v_ldv_malloc_~size_196 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)) (_ bv4 32)) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_35|))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_209|)))) (and (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| .cse3) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| .cse3 (_ bv4 32)))) (forall ((ldv_malloc_~size (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)) (_ bv4 32)) (select (store |c_#length| |v_ldv_malloc_#res.base_209| ldv_malloc_~size) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_35|)))))) (forall ((|v_ldv_malloc_#res.base_217| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| (_ BitVec 32))) (or (exists ((|v_ldv_malloc_#res.base_216| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_208|)) (or (exists ((v_ldv_malloc_~size_196 (_ BitVec 32)) (v_ldv_malloc_~size_204 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)) (_ bv12 32)) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_216| v_ldv_malloc_~size_204) |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37|)))) (not (let ((.cse4 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (_ bv8 32) .cse4) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse4 (_ bv12 32)))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_216|)))))))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_208|) (and (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_196 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)) (_ bv12 32)) (select (store (store |c_#length| |v_ldv_malloc_#res.base_217| ldv_malloc_~size) |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37|))) (let ((.cse5 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (_ bv8 32) .cse5) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse5 (_ bv12 32))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_217|))))))) is different from false [2021-11-20 06:43:58,226 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| (_ BitVec 32))) (or (and (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv4 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) .cse0))) (forall ((v_ldv_malloc_~size_196 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36|)))) (exists ((|v_ldv_malloc_#res.base_208| (_ BitVec 32))) (and (or (exists ((v_ldv_malloc_~size_196 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32))) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36|)))) (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv4 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) .cse1))))) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_208|))))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| |v_ldv_malloc_#res.base_208|))) (forall ((|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| (_ BitVec 32))) (or (exists ((|v_ldv_malloc_#res.base_216| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_208|)) (or (exists ((v_ldv_malloc_~size_196 (_ BitVec 32)) (v_ldv_malloc_~size_204 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)) (_ bv12 32)) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_216| v_ldv_malloc_~size_204) |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37|)))) (not (let ((.cse2 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (_ bv8 32) .cse2) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse2 (_ bv12 32)))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_216|)))))))) (and (forall ((v_ldv_malloc_~size_196 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)) (_ bv12 32)) (select (store |c_#length| |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37|))) (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_54| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (_ bv8 32) .cse3) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse3 (_ bv12 32))))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_208|))) (= (select |c_#length| |c_ldv_malloc_#res.base|) |c_ldv_malloc_#in~size|) (forall ((|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_35| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (_ BitVec 32))) (or (let ((.cse5 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)))) (let ((.cse4 (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| .cse5 (_ bv4 32)))) (and (bvule .cse4 (select |c_#length| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_35|)) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| .cse5) .cse4)))) (exists ((|v_ldv_malloc_#res.base_208| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_208|))) (or (not (let ((.cse6 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| .cse6) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| .cse6 (_ bv4 32))))) (exists ((v_ldv_malloc_~size_196 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)) (_ bv4 32)) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_208| v_ldv_malloc_~size_196) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_35|))))))))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ldv_malloc_#res.base|))) (= |c_ldv_malloc_#res.offset| (_ bv0 32))) is different from false [2021-11-20 06:44:10,921 WARN L227 SmtUtils]: Spent 6.67s on a formula simplification. DAG size of input: 43 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 06:45:02,281 WARN L227 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 06:45:42,227 WARN L227 SmtUtils]: Spent 10.34s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 06:46:06,865 WARN L227 SmtUtils]: Spent 6.82s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 06:46:57,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:46:57,951 INFO L93 Difference]: Finished difference Result 150 states and 167 transitions. [2021-11-20 06:46:57,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-20 06:46:57,952 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 36 states have internal predecessors, (66), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 48 [2021-11-20 06:46:57,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:46:57,953 INFO L225 Difference]: With dead ends: 150 [2021-11-20 06:46:57,953 INFO L226 Difference]: Without dead ends: 150 [2021-11-20 06:46:57,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 57 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 333.6s TimeCoverageRelationStatistics Valid=271, Invalid=1732, Unknown=111, NotChecked=1078, Total=3192 [2021-11-20 06:46:57,955 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 47 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 745 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-20 06:46:57,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 755 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 243 Invalid, 0 Unknown, 745 Unchecked, 0.6s Time] [2021-11-20 06:46:57,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-11-20 06:46:57,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2021-11-20 06:46:57,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 118 states have (on average 1.2118644067796611) internal successors, (143), 129 states have internal predecessors, (143), 9 states have call successors, (9), 9 states have call predecessors, (9), 14 states have return successors, (15), 11 states have call predecessors, (15), 9 states have call successors, (15) [2021-11-20 06:46:57,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 167 transitions. [2021-11-20 06:46:57,963 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 167 transitions. Word has length 48 [2021-11-20 06:46:57,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:46:57,963 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 167 transitions. [2021-11-20 06:46:57,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 36 states have internal predecessors, (66), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-11-20 06:46:57,964 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 167 transitions. [2021-11-20 06:46:57,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-20 06:46:57,965 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:46:57,965 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:46:57,988 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-11-20 06:46:58,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:46:58,185 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:46:58,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:46:58,186 INFO L85 PathProgramCache]: Analyzing trace with hash 331950041, now seen corresponding path program 1 times [2021-11-20 06:46:58,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:46:58,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778468199] [2021-11-20 06:46:58,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:46:58,186 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:46:58,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:46:58,187 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:46:58,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-11-20 06:46:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:46:58,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-20 06:46:58,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:46:58,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 11 [2021-11-20 06:46:58,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:46:58,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 27 [2021-11-20 06:46:59,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:46:59,528 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-20 06:46:59,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:47:02,305 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-20 06:47:02,305 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:47:02,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778468199] [2021-11-20 06:47:02,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778468199] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:47:02,306 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:47:02,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 20 [2021-11-20 06:47:02,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483302641] [2021-11-20 06:47:02,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:47:02,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-20 06:47:02,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:47:02,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-20 06:47:02,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2021-11-20 06:47:02,308 INFO L87 Difference]: Start difference. First operand 150 states and 167 transitions. Second operand has 21 states, 20 states have (on average 3.05) internal successors, (61), 18 states have internal predecessors, (61), 6 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2021-11-20 06:47:05,829 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:47:06,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:47:06,782 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2021-11-20 06:47:06,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-20 06:47:06,783 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.05) internal successors, (61), 18 states have internal predecessors, (61), 6 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 47 [2021-11-20 06:47:06,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:47:06,785 INFO L225 Difference]: With dead ends: 177 [2021-11-20 06:47:06,785 INFO L226 Difference]: Without dead ends: 177 [2021-11-20 06:47:06,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=286, Invalid=1606, Unknown=0, NotChecked=0, Total=1892 [2021-11-20 06:47:06,787 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 277 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-11-20 06:47:06,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 369 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 586 Invalid, 0 Unknown, 47 Unchecked, 2.8s Time] [2021-11-20 06:47:06,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-11-20 06:47:06,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 152. [2021-11-20 06:47:06,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.2083333333333333) internal successors, (145), 131 states have internal predecessors, (145), 9 states have call successors, (9), 9 states have call predecessors, (9), 14 states have return successors, (15), 11 states have call predecessors, (15), 9 states have call successors, (15) [2021-11-20 06:47:06,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 169 transitions. [2021-11-20 06:47:06,796 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 169 transitions. Word has length 47 [2021-11-20 06:47:06,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:47:06,796 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 169 transitions. [2021-11-20 06:47:06,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.05) internal successors, (61), 18 states have internal predecessors, (61), 6 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2021-11-20 06:47:06,797 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 169 transitions. [2021-11-20 06:47:06,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-20 06:47:06,797 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:47:06,798 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:47:06,809 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-11-20 06:47:07,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:47:07,007 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:47:07,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:47:07,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1700516764, now seen corresponding path program 1 times [2021-11-20 06:47:07,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:47:07,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939144698] [2021-11-20 06:47:07,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:47:07,009 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:47:07,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:47:07,010 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:47:07,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-11-20 06:47:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:47:07,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-20 06:47:07,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:47:07,320 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 15 [2021-11-20 06:47:07,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:47:07,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-20 06:47:08,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:47:08,165 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-20 06:47:08,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:47:11,155 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-20 06:47:11,155 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:47:11,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939144698] [2021-11-20 06:47:11,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939144698] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:47:11,155 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:47:11,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2021-11-20 06:47:11,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550568729] [2021-11-20 06:47:11,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:47:11,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-20 06:47:11,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:47:11,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-20 06:47:11,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2021-11-20 06:47:11,157 INFO L87 Difference]: Start difference. First operand 152 states and 169 transitions. Second operand has 22 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 19 states have internal predecessors, (64), 6 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2021-11-20 06:47:15,807 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:47:17,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:47:17,403 INFO L93 Difference]: Finished difference Result 169 states and 180 transitions. [2021-11-20 06:47:17,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-20 06:47:17,404 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 19 states have internal predecessors, (64), 6 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 48 [2021-11-20 06:47:17,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:47:17,406 INFO L225 Difference]: With dead ends: 169 [2021-11-20 06:47:17,406 INFO L226 Difference]: Without dead ends: 169 [2021-11-20 06:47:17,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 78 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=289, Invalid=1781, Unknown=0, NotChecked=0, Total=2070 [2021-11-20 06:47:17,408 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 263 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 48 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2021-11-20 06:47:17,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 242 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 629 Invalid, 1 Unknown, 67 Unchecked, 3.8s Time] [2021-11-20 06:47:17,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-11-20 06:47:17,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 154. [2021-11-20 06:47:17,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 122 states have (on average 1.2049180327868851) internal successors, (147), 133 states have internal predecessors, (147), 9 states have call successors, (9), 9 states have call predecessors, (9), 14 states have return successors, (15), 11 states have call predecessors, (15), 9 states have call successors, (15) [2021-11-20 06:47:17,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 171 transitions. [2021-11-20 06:47:17,416 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 171 transitions. Word has length 48 [2021-11-20 06:47:17,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:47:17,417 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 171 transitions. [2021-11-20 06:47:17,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 19 states have internal predecessors, (64), 6 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2021-11-20 06:47:17,417 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 171 transitions. [2021-11-20 06:47:17,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-20 06:47:17,418 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:47:17,418 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:47:17,448 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2021-11-20 06:47:17,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:47:17,634 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:47:17,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:47:17,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1176412219, now seen corresponding path program 1 times [2021-11-20 06:47:17,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:47:17,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556072771] [2021-11-20 06:47:17,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:47:17,635 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:47:17,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:47:17,636 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:47:17,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-11-20 06:47:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:47:17,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-20 06:47:17,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:47:17,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:47:18,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 21 [2021-11-20 06:47:18,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 10 [2021-11-20 06:47:18,338 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-11-20 06:47:18,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 43 [2021-11-20 06:47:18,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:47:18,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 56 treesize of output 51 [2021-11-20 06:47:18,871 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-11-20 06:47:18,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 59 treesize of output 47 [2021-11-20 06:47:19,577 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 06:47:19,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2021-11-20 06:47:19,947 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 06:47:19,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 33 [2021-11-20 06:47:20,103 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 06:47:20,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:47:30,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 62 treesize of output 60 [2021-11-20 06:47:31,322 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 06:47:31,322 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:47:31,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556072771] [2021-11-20 06:47:31,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556072771] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:47:31,323 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:47:31,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 37 [2021-11-20 06:47:31,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286728924] [2021-11-20 06:47:31,323 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:47:31,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-11-20 06:47:31,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:47:31,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-11-20 06:47:31,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1282, Unknown=2, NotChecked=0, Total=1406 [2021-11-20 06:47:31,325 INFO L87 Difference]: Start difference. First operand 154 states and 171 transitions. Second operand has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 33 states have internal predecessors, (75), 6 states have call successors, (7), 5 states have call predecessors, (7), 7 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2021-11-20 06:47:44,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:47:44,267 INFO L93 Difference]: Finished difference Result 157 states and 173 transitions. [2021-11-20 06:47:44,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-20 06:47:44,268 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 33 states have internal predecessors, (75), 6 states have call successors, (7), 5 states have call predecessors, (7), 7 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 49 [2021-11-20 06:47:44,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:47:44,270 INFO L225 Difference]: With dead ends: 157 [2021-11-20 06:47:44,270 INFO L226 Difference]: Without dead ends: 157 [2021-11-20 06:47:44,271 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 23.8s TimeCoverageRelationStatistics Valid=197, Invalid=2149, Unknown=6, NotChecked=0, Total=2352 [2021-11-20 06:47:44,272 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 21 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 209 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-20 06:47:44,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 404 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 286 Invalid, 0 Unknown, 209 Unchecked, 0.7s Time] [2021-11-20 06:47:44,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-11-20 06:47:44,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2021-11-20 06:47:44,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 124 states have (on average 1.2016129032258065) internal successors, (149), 135 states have internal predecessors, (149), 9 states have call successors, (9), 9 states have call predecessors, (9), 14 states have return successors, (15), 11 states have call predecessors, (15), 9 states have call successors, (15) [2021-11-20 06:47:44,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 173 transitions. [2021-11-20 06:47:44,280 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 173 transitions. Word has length 49 [2021-11-20 06:47:44,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:47:44,281 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 173 transitions. [2021-11-20 06:47:44,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 33 states have internal predecessors, (75), 6 states have call successors, (7), 5 states have call predecessors, (7), 7 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2021-11-20 06:47:44,281 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 173 transitions. [2021-11-20 06:47:44,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-20 06:47:44,282 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:47:44,282 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:47:44,311 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2021-11-20 06:47:44,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:47:44,497 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:47:44,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:47:44,497 INFO L85 PathProgramCache]: Analyzing trace with hash -436631103, now seen corresponding path program 2 times [2021-11-20 06:47:44,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:47:44,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743491741] [2021-11-20 06:47:44,498 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:47:44,498 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:47:44,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:47:44,499 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:47:44,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-11-20 06:47:44,588 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:47:44,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:47:44,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-20 06:47:44,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:47:44,899 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-20 06:47:44,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:47:45,363 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-20 06:47:45,363 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:47:45,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743491741] [2021-11-20 06:47:45,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1743491741] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:47:45,363 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:47:45,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-11-20 06:47:45,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828397812] [2021-11-20 06:47:45,364 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:47:45,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 06:47:45,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:47:45,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 06:47:45,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-11-20 06:47:45,366 INFO L87 Difference]: Start difference. First operand 156 states and 173 transitions. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-20 06:47:45,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:47:45,791 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2021-11-20 06:47:45,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 06:47:45,792 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 52 [2021-11-20 06:47:45,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:47:45,794 INFO L225 Difference]: With dead ends: 161 [2021-11-20 06:47:45,794 INFO L226 Difference]: Without dead ends: 161 [2021-11-20 06:47:45,794 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2021-11-20 06:47:45,795 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 40 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 06:47:45,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 382 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-20 06:47:45,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-11-20 06:47:45,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 152. [2021-11-20 06:47:45,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.1583333333333334) internal successors, (139), 131 states have internal predecessors, (139), 9 states have call successors, (9), 9 states have call predecessors, (9), 14 states have return successors, (15), 11 states have call predecessors, (15), 9 states have call successors, (15) [2021-11-20 06:47:45,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 163 transitions. [2021-11-20 06:47:45,803 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 163 transitions. Word has length 52 [2021-11-20 06:47:45,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:47:45,804 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 163 transitions. [2021-11-20 06:47:45,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-20 06:47:45,804 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 163 transitions. [2021-11-20 06:47:45,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-20 06:47:45,805 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:47:45,805 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:47:45,817 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2021-11-20 06:47:46,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:47:46,015 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:47:46,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:47:46,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1304261010, now seen corresponding path program 2 times [2021-11-20 06:47:46,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:47:46,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936538780] [2021-11-20 06:47:46,016 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:47:46,016 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:47:46,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:47:46,017 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:47:46,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2021-11-20 06:47:46,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:47:46,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:47:46,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-20 06:47:46,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:47:46,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:47:46,263 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:47:46,263 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 18 [2021-11-20 06:47:46,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 16 [2021-11-20 06:47:48,490 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_55| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_52| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_52| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_52|) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_55|)))) is different from true [2021-11-20 06:47:48,617 INFO L354 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-11-20 06:47:48,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 28 [2021-11-20 06:47:50,701 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_53| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_56| (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_53|) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_56|) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_53|))) is different from true [2021-11-20 06:47:51,003 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-11-20 06:47:51,111 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-20 06:47:51,112 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 24 [2021-11-20 06:47:51,445 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2021-11-20 06:47:51,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:47:51,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 28 [2021-11-20 06:47:52,960 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-20 06:47:52,960 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:47:52,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936538780] [2021-11-20 06:47:52,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936538780] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:47:52,961 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:47:52,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 28 [2021-11-20 06:47:52,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196277797] [2021-11-20 06:47:52,961 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:47:52,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-20 06:47:52,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:47:52,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-20 06:47:52,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=636, Unknown=2, NotChecked=102, Total=812 [2021-11-20 06:47:52,963 INFO L87 Difference]: Start difference. First operand 152 states and 163 transitions. Second operand has 29 states, 28 states have (on average 2.9642857142857144) internal successors, (83), 26 states have internal predecessors, (83), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-20 06:48:08,924 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:48:14,552 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:48:17,022 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:48:19,047 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:48:23,648 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:48:24,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:48:24,015 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2021-11-20 06:48:24,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-11-20 06:48:24,016 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.9642857142857144) internal successors, (83), 26 states have internal predecessors, (83), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 54 [2021-11-20 06:48:24,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:48:24,018 INFO L225 Difference]: With dead ends: 168 [2021-11-20 06:48:24,018 INFO L226 Difference]: Without dead ends: 168 [2021-11-20 06:48:24,019 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 68 SyntacticMatches, 13 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 24.8s TimeCoverageRelationStatistics Valid=277, Invalid=2377, Unknown=6, NotChecked=202, Total=2862 [2021-11-20 06:48:24,020 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 102 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 59 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 311 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2021-11-20 06:48:24,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 473 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 848 Invalid, 5 Unknown, 311 Unchecked, 12.0s Time] [2021-11-20 06:48:24,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-11-20 06:48:24,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 154. [2021-11-20 06:48:24,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 122 states have (on average 1.1639344262295082) internal successors, (142), 133 states have internal predecessors, (142), 9 states have call successors, (9), 9 states have call predecessors, (9), 14 states have return successors, (15), 11 states have call predecessors, (15), 9 states have call successors, (15) [2021-11-20 06:48:24,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2021-11-20 06:48:24,028 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 54 [2021-11-20 06:48:24,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:48:24,029 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2021-11-20 06:48:24,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.9642857142857144) internal successors, (83), 26 states have internal predecessors, (83), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-20 06:48:24,029 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2021-11-20 06:48:24,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-20 06:48:24,030 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:48:24,030 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:48:24,041 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (30)] Ended with exit code 0 [2021-11-20 06:48:24,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:48:24,238 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:48:24,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:48:24,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1099567584, now seen corresponding path program 1 times [2021-11-20 06:48:24,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:48:24,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [802891452] [2021-11-20 06:48:24,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:48:24,239 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:48:24,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:48:24,240 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:48:24,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-11-20 06:48:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:48:24,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-20 06:48:24,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:48:24,581 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-11-20 06:48:24,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:48:24,968 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-11-20 06:48:24,968 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:48:24,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [802891452] [2021-11-20 06:48:24,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [802891452] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:48:24,969 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:48:24,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-11-20 06:48:24,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133886191] [2021-11-20 06:48:24,969 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:48:24,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 06:48:24,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:48:24,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 06:48:24,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-11-20 06:48:24,971 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-11-20 06:48:25,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:48:25,763 INFO L93 Difference]: Finished difference Result 197 states and 206 transitions. [2021-11-20 06:48:25,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-20 06:48:25,764 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 56 [2021-11-20 06:48:25,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:48:25,766 INFO L225 Difference]: With dead ends: 197 [2021-11-20 06:48:25,766 INFO L226 Difference]: Without dead ends: 197 [2021-11-20 06:48:25,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2021-11-20 06:48:25,768 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 289 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 06:48:25,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 318 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-20 06:48:25,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-11-20 06:48:25,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 170. [2021-11-20 06:48:25,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 148 states have internal predecessors, (157), 9 states have call successors, (9), 9 states have call predecessors, (9), 14 states have return successors, (15), 12 states have call predecessors, (15), 9 states have call successors, (15) [2021-11-20 06:48:25,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 181 transitions. [2021-11-20 06:48:25,776 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 181 transitions. Word has length 56 [2021-11-20 06:48:25,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:48:25,776 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 181 transitions. [2021-11-20 06:48:25,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-11-20 06:48:25,777 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 181 transitions. [2021-11-20 06:48:25,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-20 06:48:25,778 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:48:25,778 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:48:25,801 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2021-11-20 06:48:25,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:48:25,992 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:48:25,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:48:25,992 INFO L85 PathProgramCache]: Analyzing trace with hash -735616619, now seen corresponding path program 2 times [2021-11-20 06:48:25,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:48:25,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1479634332] [2021-11-20 06:48:25,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:48:25,993 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:48:25,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:48:25,993 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:48:25,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1cf5ee-e953-4914-8132-c4595cb7696a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2021-11-20 06:48:26,111 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:48:26,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:48:26,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-20 06:48:26,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:48:26,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 33 [2021-11-20 06:48:26,726 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-20 06:48:26,726 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 26 [2021-11-20 06:48:35,327 INFO L354 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-11-20 06:48:35,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 89 treesize of output 70 [2021-11-20 06:48:35,701 INFO L354 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2021-11-20 06:48:35,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 66 [2021-11-20 06:48:37,317 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-20 06:48:37,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 54 [2021-11-20 06:48:42,303 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 14 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-20 06:48:42,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:48:44,291 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 30 [2021-11-20 06:48:54,033 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_61| (_ BitVec 32)) (|v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_18| (Array (_ BitVec 32) (_ BitVec 1))) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_94| (_ BitVec 32))) (let ((.cse0 (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)))) (or (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select .cse0 |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_61|)))))))))) (_ bv1 1)))) (= (store (store .cse0 (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_94| (_ bv4 32)))) (select (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_61|) .cse1 |c_ldv_malloc_#res.base|) (bvadd (_ bv4294967292 32) .cse1))) (_ bv0 1)) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_61| (_ bv0 1)) |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_18|) (exists ((|v_ldv_malloc_#res.base_314| (_ BitVec 32))) (let ((.cse2 (store |c_old(#valid)| |v_ldv_malloc_#res.base_314| (_ bv0 1)))) (and (not (= (store (store .cse2 (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_94| (_ bv4 32)))) (select (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_61|) .cse3 |v_ldv_malloc_#res.base_314|) (bvadd (_ bv4294967292 32) .cse3))) (_ bv0 1)) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_61| (_ bv0 1)) |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_18|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_314|))))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select .cse2 |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_61|)))))))))))))))))))))) is different from false [2021-11-20 06:48:54,420 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_315| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_61| (_ BitVec 32)) (|v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_18| (Array (_ BitVec 32) (_ BitVec 1))) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_94| (_ BitVec 32))) (let ((.cse0 (store |c_#valid| |v_ldv_malloc_#res.base_315| (_ bv0 1)))) (or (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_315|)))))) (= (store (store .cse0 (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_94| (_ bv4 32)))) (select (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_61|) .cse1 |v_ldv_malloc_#res.base_315|) (bvadd (_ bv4294967292 32) .cse1))) (_ bv0 1)) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_61| (_ bv0 1)) |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_18|) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select .cse0 |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_61|))))))))))) (_ bv1 1)))) (exists ((|v_ldv_malloc_#res.base_314| (_ BitVec 32))) (let ((.cse2 (store |c_old(#valid)| |v_ldv_malloc_#res.base_314| (_ bv0 1)))) (and (not (= (store (store .cse2 (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_94| (_ bv4 32)))) (select (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_61|) .cse3 |v_ldv_malloc_#res.base_314|) (bvadd (_ bv4294967292 32) .cse3))) (_ bv0 1)) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_61| (_ bv0 1)) |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_18|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_314|))))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select .cse2 |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_61|)))))))))))))))))))))) is different from false [2021-11-20 06:48:57,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 62