./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 577bc449dc1bd07ff03d533463a99a048a746b45 ........................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 577bc449dc1bd07ff03d533463a99a048a746b45 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 14:59:06,284 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:59:06,285 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:59:06,293 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:59:06,293 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:59:06,294 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:59:06,295 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:59:06,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:59:06,297 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:59:06,298 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:59:06,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:59:06,299 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:59:06,299 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:59:06,300 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:59:06,301 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:59:06,301 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:59:06,302 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:59:06,303 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:59:06,304 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:59:06,305 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:59:06,306 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:59:06,307 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:59:06,308 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:59:06,308 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:59:06,310 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:59:06,310 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:59:06,310 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:59:06,310 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:59:06,311 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:59:06,311 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:59:06,311 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:59:06,312 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:59:06,312 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:59:06,313 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:59:06,313 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:59:06,313 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:59:06,314 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:59:06,314 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:59:06,314 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:59:06,314 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:59:06,315 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:59:06,315 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 14:59:06,325 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:59:06,326 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:59:06,326 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 14:59:06,326 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 14:59:06,326 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 14:59:06,327 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 14:59:06,327 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 14:59:06,327 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 14:59:06,327 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 14:59:06,327 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 14:59:06,327 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 14:59:06,327 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 14:59:06,328 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 14:59:06,328 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 14:59:06,328 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 14:59:06,328 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:59:06,328 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:59:06,329 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:59:06,329 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:59:06,329 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 14:59:06,329 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:59:06,329 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:59:06,329 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:59:06,329 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 14:59:06,329 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 14:59:06,329 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 14:59:06,329 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:59:06,330 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 14:59:06,330 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:59:06,330 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:59:06,330 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:59:06,330 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:59:06,330 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:59:06,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:59:06,330 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:59:06,331 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:59:06,331 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 14:59:06,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:59:06,331 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:59:06,331 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:59:06,331 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan 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 -> Taipan 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 -> 577bc449dc1bd07ff03d533463a99a048a746b45 [2019-12-07 14:59:06,427 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:59:06,435 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:59:06,437 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:59:06,438 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:59:06,438 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:59:06,438 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i [2019-12-07 14:59:06,473 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/data/c3e6d22da/1f0845ec2d8b4b7288c6d0c02c0963c2/FLAG42c4bae6d [2019-12-07 14:59:06,924 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:59:06,924 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i [2019-12-07 14:59:06,935 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/data/c3e6d22da/1f0845ec2d8b4b7288c6d0c02c0963c2/FLAG42c4bae6d [2019-12-07 14:59:06,944 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/data/c3e6d22da/1f0845ec2d8b4b7288c6d0c02c0963c2 [2019-12-07 14:59:06,946 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:59:06,946 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:59:06,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:59:06,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:59:06,950 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:59:06,950 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:59:06" (1/1) ... [2019-12-07 14:59:06,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dd238a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:59:06, skipping insertion in model container [2019-12-07 14:59:06,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:59:06" (1/1) ... [2019-12-07 14:59:06,957 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:59:06,985 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:59:07,231 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:59:07,245 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) [2019-12-07 14:59:07,245 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3f4dd5a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:59:07, skipping insertion in model container [2019-12-07 14:59:07,245 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:59:07,246 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2019-12-07 14:59:07,247 INFO L168 Benchmark]: Toolchain (without parser) took 300.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -160.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-12-07 14:59:07,248 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:59:07,248 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -160.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-12-07 14:59:07,250 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 298.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -160.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * 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... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 14:59:08,411 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:59:08,412 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:59:08,421 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:59:08,421 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:59:08,422 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:59:08,423 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:59:08,425 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:59:08,426 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:59:08,426 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:59:08,427 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:59:08,428 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:59:08,428 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:59:08,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:59:08,429 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:59:08,430 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:59:08,431 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:59:08,431 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:59:08,433 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:59:08,435 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:59:08,436 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:59:08,437 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:59:08,438 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:59:08,439 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:59:08,441 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:59:08,441 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:59:08,441 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:59:08,442 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:59:08,442 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:59:08,443 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:59:08,443 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:59:08,444 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:59:08,444 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:59:08,444 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:59:08,445 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:59:08,445 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:59:08,446 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:59:08,446 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:59:08,446 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:59:08,447 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:59:08,448 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:59:08,448 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 14:59:08,459 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:59:08,460 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:59:08,460 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 14:59:08,461 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 14:59:08,461 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 14:59:08,461 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 14:59:08,461 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 14:59:08,461 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 14:59:08,462 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 14:59:08,462 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:59:08,462 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:59:08,463 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:59:08,463 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:59:08,463 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 14:59:08,463 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:59:08,463 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:59:08,464 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:59:08,464 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 14:59:08,464 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 14:59:08,464 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 14:59:08,464 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:59:08,464 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 14:59:08,465 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 14:59:08,465 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 14:59:08,465 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:59:08,465 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:59:08,465 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:59:08,465 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:59:08,465 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:59:08,466 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:59:08,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:59:08,466 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:59:08,466 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:59:08,466 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 14:59:08,466 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 14:59:08,466 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:59:08,466 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:59:08,467 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan 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 -> Taipan 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 -> 577bc449dc1bd07ff03d533463a99a048a746b45 [2019-12-07 14:59:08,640 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:59:08,650 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:59:08,653 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:59:08,654 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:59:08,654 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:59:08,655 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i [2019-12-07 14:59:08,699 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/data/7e017d352/cf533015ddfe4d6b812c953fd1e79b76/FLAG44251caa0 [2019-12-07 14:59:09,076 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:59:09,077 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i [2019-12-07 14:59:09,087 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/data/7e017d352/cf533015ddfe4d6b812c953fd1e79b76/FLAG44251caa0 [2019-12-07 14:59:09,095 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/data/7e017d352/cf533015ddfe4d6b812c953fd1e79b76 [2019-12-07 14:59:09,097 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:59:09,098 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:59:09,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:59:09,099 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:59:09,101 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:59:09,101 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:59:09" (1/1) ... [2019-12-07 14:59:09,103 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b5dd555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:59:09, skipping insertion in model container [2019-12-07 14:59:09,103 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:59:09" (1/1) ... [2019-12-07 14:59:09,108 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:59:09,135 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:59:09,377 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:59:09,390 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-12-07 14:59:09,399 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:59:09,429 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:59:09,435 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:59:09,467 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:59:09,521 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:59:09,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:59:09 WrapperNode [2019-12-07 14:59:09,522 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:59:09,522 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:59:09,522 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:59:09,522 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:59:09,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:59:09" (1/1) ... [2019-12-07 14:59:09,544 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:59:09" (1/1) ... [2019-12-07 14:59:09,565 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:59:09,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:59:09,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:59:09,565 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:59:09,571 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:59:09" (1/1) ... [2019-12-07 14:59:09,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:59:09" (1/1) ... [2019-12-07 14:59:09,575 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:59:09" (1/1) ... [2019-12-07 14:59:09,575 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:59:09" (1/1) ... [2019-12-07 14:59:09,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:59:09" (1/1) ... [2019-12-07 14:59:09,588 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:59:09" (1/1) ... [2019-12-07 14:59:09,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:59:09" (1/1) ... [2019-12-07 14:59:09,594 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:59:09,594 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:59:09,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:59:09,594 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:59:09,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:59:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:59:09,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 14:59:09,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 14:59:09,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 14:59:09,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:59:09,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 14:59:09,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 14:59:09,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:59:09,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 14:59:09,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:59:09,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:59:10,048 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:59:10,049 INFO L287 CfgBuilder]: Removed 54 assume(true) statements. [2019-12-07 14:59:10,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:59:10 BoogieIcfgContainer [2019-12-07 14:59:10,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:59:10,050 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:59:10,050 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:59:10,052 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:59:10,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:59:09" (1/3) ... [2019-12-07 14:59:10,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c53c93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:59:10, skipping insertion in model container [2019-12-07 14:59:10,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:59:09" (2/3) ... [2019-12-07 14:59:10,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c53c93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:59:10, skipping insertion in model container [2019-12-07 14:59:10,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:59:10" (3/3) ... [2019-12-07 14:59:10,054 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2-2.i [2019-12-07 14:59:10,061 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:59:10,065 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2019-12-07 14:59:10,074 INFO L249 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2019-12-07 14:59:10,088 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:59:10,088 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 14:59:10,088 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:59:10,088 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:59:10,088 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:59:10,088 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:59:10,088 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:59:10,088 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:59:10,100 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states. [2019-12-07 14:59:10,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 14:59:10,104 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:10,105 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 14:59:10,106 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 14:59:10,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:10,109 INFO L82 PathProgramCache]: Analyzing trace with hash 889508776, now seen corresponding path program 1 times [2019-12-07 14:59:10,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:59:10,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1859366979] [2019-12-07 14:59:10,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 14:59:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:10,185 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:59:10,189 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:10,226 INFO L377 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 [2019-12-07 14:59:10,226 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:59:10,231 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:59:10,232 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:59:10,232 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 14:59:10,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:10,252 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:10,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:10,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1859366979] [2019-12-07 14:59:10,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:10,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 14:59:10,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706945444] [2019-12-07 14:59:10,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:59:10,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:59:10,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:59:10,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:59:10,272 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 5 states. [2019-12-07 14:59:10,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:10,788 INFO L93 Difference]: Finished difference Result 316 states and 343 transitions. [2019-12-07 14:59:10,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:59:10,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-12-07 14:59:10,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:10,799 INFO L225 Difference]: With dead ends: 316 [2019-12-07 14:59:10,799 INFO L226 Difference]: Without dead ends: 308 [2019-12-07 14:59:10,800 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:59:10,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-12-07 14:59:10,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 105. [2019-12-07 14:59:10,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-12-07 14:59:10,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2019-12-07 14:59:10,833 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 6 [2019-12-07 14:59:10,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:10,833 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2019-12-07 14:59:10,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:59:10,834 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2019-12-07 14:59:10,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 14:59:10,834 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:10,834 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 14:59:11,035 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 14:59:11,036 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 14:59:11,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:11,037 INFO L82 PathProgramCache]: Analyzing trace with hash 889568358, now seen corresponding path program 1 times [2019-12-07 14:59:11,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:59:11,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377151993] [2019-12-07 14:59:11,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 14:59:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:11,112 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:59:11,113 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:11,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:11,131 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:11,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:11,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377151993] [2019-12-07 14:59:11,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:11,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 14:59:11,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267130143] [2019-12-07 14:59:11,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:59:11,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:59:11,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:59:11,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:59:11,136 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 4 states. [2019-12-07 14:59:11,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:11,169 INFO L93 Difference]: Finished difference Result 259 states and 282 transitions. [2019-12-07 14:59:11,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:59:11,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-07 14:59:11,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:11,172 INFO L225 Difference]: With dead ends: 259 [2019-12-07 14:59:11,172 INFO L226 Difference]: Without dead ends: 259 [2019-12-07 14:59:11,173 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:59:11,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-12-07 14:59:11,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 103. [2019-12-07 14:59:11,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-12-07 14:59:11,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2019-12-07 14:59:11,184 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 6 [2019-12-07 14:59:11,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:11,185 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2019-12-07 14:59:11,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:59:11,185 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2019-12-07 14:59:11,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 14:59:11,185 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:11,185 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:59:11,386 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 14:59:11,388 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 14:59:11,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:11,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1804968328, now seen corresponding path program 1 times [2019-12-07 14:59:11,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:59:11,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1694593084] [2019-12-07 14:59:11,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 14:59:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:11,479 INFO L264 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 14:59:11,480 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:11,490 INFO L377 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 [2019-12-07 14:59:11,491 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:59:11,496 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:59:11,496 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:59:11,497 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 14:59:11,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:11,530 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:11,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:11,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1694593084] [2019-12-07 14:59:11,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:11,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-12-07 14:59:11,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347524106] [2019-12-07 14:59:11,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:59:11,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:59:11,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:59:11,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:59:11,723 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand 10 states. [2019-12-07 14:59:12,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:12,332 INFO L93 Difference]: Finished difference Result 258 states and 281 transitions. [2019-12-07 14:59:12,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:59:12,333 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-12-07 14:59:12,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:12,334 INFO L225 Difference]: With dead ends: 258 [2019-12-07 14:59:12,334 INFO L226 Difference]: Without dead ends: 258 [2019-12-07 14:59:12,335 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:59:12,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-12-07 14:59:12,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 102. [2019-12-07 14:59:12,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 14:59:12,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2019-12-07 14:59:12,340 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 7 [2019-12-07 14:59:12,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:12,341 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2019-12-07 14:59:12,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:59:12,341 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2019-12-07 14:59:12,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 14:59:12,341 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:12,341 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:59:12,542 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 14:59:12,543 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 14:59:12,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:12,544 INFO L82 PathProgramCache]: Analyzing trace with hash 119421555, now seen corresponding path program 1 times [2019-12-07 14:59:12,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:59:12,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165914963] [2019-12-07 14:59:12,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 14:59:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:12,592 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:59:12,593 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:12,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:12,603 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:12,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:12,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165914963] [2019-12-07 14:59:12,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:12,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 14:59:12,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017139049] [2019-12-07 14:59:12,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:59:12,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:59:12,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:59:12,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:59:12,606 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand 4 states. [2019-12-07 14:59:12,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:12,623 INFO L93 Difference]: Finished difference Result 180 states and 196 transitions. [2019-12-07 14:59:12,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:59:12,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 14:59:12,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:12,624 INFO L225 Difference]: With dead ends: 180 [2019-12-07 14:59:12,625 INFO L226 Difference]: Without dead ends: 180 [2019-12-07 14:59:12,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:59:12,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-12-07 14:59:12,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 102. [2019-12-07 14:59:12,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 14:59:12,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2019-12-07 14:59:12,629 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 8 [2019-12-07 14:59:12,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:12,629 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2019-12-07 14:59:12,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:59:12,630 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2019-12-07 14:59:12,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 14:59:12,630 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:12,630 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:59:12,831 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 14:59:12,832 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 14:59:12,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:12,833 INFO L82 PathProgramCache]: Analyzing trace with hash 176679857, now seen corresponding path program 1 times [2019-12-07 14:59:12,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:59:12,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1350201690] [2019-12-07 14:59:12,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 14:59:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:12,933 INFO L264 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 14:59:12,934 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:12,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:12,952 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:12,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:12,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1350201690] [2019-12-07 14:59:12,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:12,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 14:59:12,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866275823] [2019-12-07 14:59:12,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:59:12,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:59:12,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:59:12,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:59:12,957 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 4 states. [2019-12-07 14:59:12,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:12,986 INFO L93 Difference]: Finished difference Result 238 states and 258 transitions. [2019-12-07 14:59:12,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:59:12,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 14:59:12,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:12,988 INFO L225 Difference]: With dead ends: 238 [2019-12-07 14:59:12,988 INFO L226 Difference]: Without dead ends: 238 [2019-12-07 14:59:12,988 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:59:12,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-12-07 14:59:12,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 104. [2019-12-07 14:59:12,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-12-07 14:59:12,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2019-12-07 14:59:12,994 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 8 [2019-12-07 14:59:12,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:12,994 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2019-12-07 14:59:12,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:59:12,995 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2019-12-07 14:59:12,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 14:59:12,995 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:12,995 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:59:13,196 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 14:59:13,198 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 14:59:13,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:13,199 INFO L82 PathProgramCache]: Analyzing trace with hash 2147148924, now seen corresponding path program 1 times [2019-12-07 14:59:13,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:59:13,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [718394624] [2019-12-07 14:59:13,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 14:59:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:13,286 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 14:59:13,288 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:13,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:13,313 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:13,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:13,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [718394624] [2019-12-07 14:59:13,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:13,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 14:59:13,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418000112] [2019-12-07 14:59:13,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:59:13,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:59:13,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:59:13,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:59:13,317 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand 5 states. [2019-12-07 14:59:13,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:13,368 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2019-12-07 14:59:13,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:59:13,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-07 14:59:13,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:13,369 INFO L225 Difference]: With dead ends: 114 [2019-12-07 14:59:13,369 INFO L226 Difference]: Without dead ends: 114 [2019-12-07 14:59:13,369 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:59:13,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-12-07 14:59:13,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 109. [2019-12-07 14:59:13,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-12-07 14:59:13,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2019-12-07 14:59:13,372 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 11 [2019-12-07 14:59:13,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:13,372 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2019-12-07 14:59:13,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:59:13,372 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2019-12-07 14:59:13,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 14:59:13,372 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:13,372 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:59:13,573 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 14:59:13,574 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 14:59:13,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:13,575 INFO L82 PathProgramCache]: Analyzing trace with hash 820865718, now seen corresponding path program 1 times [2019-12-07 14:59:13,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:59:13,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000564715] [2019-12-07 14:59:13,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 14:59:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:13,685 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:59:13,686 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:13,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:13,695 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:13,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:13,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1000564715] [2019-12-07 14:59:13,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:13,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:59:13,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113106641] [2019-12-07 14:59:13,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:59:13,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:59:13,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:59:13,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:59:13,707 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand 6 states. [2019-12-07 14:59:13,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:13,731 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2019-12-07 14:59:13,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:59:13,732 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-12-07 14:59:13,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:13,732 INFO L225 Difference]: With dead ends: 113 [2019-12-07 14:59:13,733 INFO L226 Difference]: Without dead ends: 113 [2019-12-07 14:59:13,733 INFO L630 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 [2019-12-07 14:59:13,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-12-07 14:59:13,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2019-12-07 14:59:13,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 14:59:13,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2019-12-07 14:59:13,735 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 12 [2019-12-07 14:59:13,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:13,735 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2019-12-07 14:59:13,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:59:13,735 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2019-12-07 14:59:13,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 14:59:13,736 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:13,736 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:59:13,936 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 14:59:13,937 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 14:59:13,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:13,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1827233087, now seen corresponding path program 1 times [2019-12-07 14:59:13,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:59:13,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297481938] [2019-12-07 14:59:13,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 14:59:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:14,027 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:59:14,028 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:14,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:14,031 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:14,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:14,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297481938] [2019-12-07 14:59:14,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:14,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 14:59:14,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152121485] [2019-12-07 14:59:14,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:59:14,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:59:14,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:59:14,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:59:14,033 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand 3 states. [2019-12-07 14:59:14,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:14,116 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2019-12-07 14:59:14,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:59:14,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 14:59:14,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:14,117 INFO L225 Difference]: With dead ends: 112 [2019-12-07 14:59:14,117 INFO L226 Difference]: Without dead ends: 102 [2019-12-07 14:59:14,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:59:14,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-12-07 14:59:14,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-12-07 14:59:14,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 14:59:14,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2019-12-07 14:59:14,120 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 13 [2019-12-07 14:59:14,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:14,121 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2019-12-07 14:59:14,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:59:14,121 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2019-12-07 14:59:14,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:59:14,121 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:14,122 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:59:14,322 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 14:59:14,323 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 14:59:14,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:14,324 INFO L82 PathProgramCache]: Analyzing trace with hash 976647734, now seen corresponding path program 1 times [2019-12-07 14:59:14,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:59:14,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [968691941] [2019-12-07 14:59:14,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 14:59:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:14,412 INFO L264 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:59:14,413 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:14,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:14,437 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:14,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:14,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [968691941] [2019-12-07 14:59:14,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1412126856] [2019-12-07 14:59:14,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:59:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:14,591 INFO L264 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:59:14,591 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:14,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:14,594 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:14,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:14,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316568924] [2019-12-07 14:59:14,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:59:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:14,649 INFO L264 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 14:59:14,650 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:14,653 INFO L377 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 [2019-12-07 14:59:14,653 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:59:14,654 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:59:14,654 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:59:14,655 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 14:59:14,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:59:14,710 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:14,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:59:14,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 4 imperfect interpolant sequences. [2019-12-07 14:59:14,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [6, 6, 6, 6] total 15 [2019-12-07 14:59:14,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772248866] [2019-12-07 14:59:14,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:59:14,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:59:14,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:59:14,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-12-07 14:59:14,714 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand 7 states. [2019-12-07 14:59:15,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:15,229 INFO L93 Difference]: Finished difference Result 255 states and 273 transitions. [2019-12-07 14:59:15,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:59:15,229 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-12-07 14:59:15,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:15,231 INFO L225 Difference]: With dead ends: 255 [2019-12-07 14:59:15,231 INFO L226 Difference]: Without dead ends: 255 [2019-12-07 14:59:15,231 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2019-12-07 14:59:15,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-12-07 14:59:15,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 101. [2019-12-07 14:59:15,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-12-07 14:59:15,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2019-12-07 14:59:15,235 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 14 [2019-12-07 14:59:15,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:15,235 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2019-12-07 14:59:15,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:59:15,235 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2019-12-07 14:59:15,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:59:15,236 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:15,236 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:59:15,837 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 mathsat -unsat_core_generation=3,11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:59:15,839 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 14:59:15,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:15,840 INFO L82 PathProgramCache]: Analyzing trace with hash 976647735, now seen corresponding path program 1 times [2019-12-07 14:59:15,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:59:15,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [432332010] [2019-12-07 14:59:15,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 14:59:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:15,929 INFO L264 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:59:15,929 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:15,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:15,955 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:16,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:16,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [432332010] [2019-12-07 14:59:16,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1312269068] [2019-12-07 14:59:16,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:59:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:16,097 INFO L264 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:59:16,098 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:16,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:16,100 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:16,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:16,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76973873] [2019-12-07 14:59:16,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:59:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:16,142 INFO L264 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 14:59:16,143 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:16,154 INFO L377 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 [2019-12-07 14:59:16,154 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:59:16,158 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:59:16,158 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:59:16,158 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 14:59:16,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:59:16,253 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:16,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:59:16,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 4 imperfect interpolant sequences. [2019-12-07 14:59:16,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [6, 6, 6, 6] total 22 [2019-12-07 14:59:16,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223718447] [2019-12-07 14:59:16,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 14:59:16,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:59:16,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 14:59:16,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2019-12-07 14:59:16,646 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand 14 states. [2019-12-07 14:59:17,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:17,538 INFO L93 Difference]: Finished difference Result 258 states and 279 transitions. [2019-12-07 14:59:17,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 14:59:17,539 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-12-07 14:59:17,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:17,540 INFO L225 Difference]: With dead ends: 258 [2019-12-07 14:59:17,540 INFO L226 Difference]: Without dead ends: 258 [2019-12-07 14:59:17,540 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2019-12-07 14:59:17,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-12-07 14:59:17,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 100. [2019-12-07 14:59:17,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-12-07 14:59:17,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2019-12-07 14:59:17,543 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 14 [2019-12-07 14:59:17,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:17,543 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2019-12-07 14:59:17,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 14:59:17,544 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2019-12-07 14:59:17,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 14:59:17,544 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:17,544 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:59:18,145 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3,14 cvc4 --incremental --print-success --lang smt --rewrite-divk,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:59:18,145 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 14:59:18,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:18,146 INFO L82 PathProgramCache]: Analyzing trace with hash -2040718634, now seen corresponding path program 1 times [2019-12-07 14:59:18,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:59:18,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [102666118] [2019-12-07 14:59:18,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-12-07 14:59:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:18,194 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:59:18,195 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:18,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:18,220 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:18,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:18,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [102666118] [2019-12-07 14:59:18,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2133334781] [2019-12-07 14:59:18,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:59:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:18,346 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 14:59:18,347 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:18,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:59:18,378 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:18,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:59:18,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:59:18,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [6, 6] total 13 [2019-12-07 14:59:18,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073438887] [2019-12-07 14:59:18,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:59:18,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:59:18,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:59:18,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:59:18,382 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand 5 states. [2019-12-07 14:59:18,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:18,413 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2019-12-07 14:59:18,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:59:18,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 14:59:18,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:18,414 INFO L225 Difference]: With dead ends: 100 [2019-12-07 14:59:18,414 INFO L226 Difference]: Without dead ends: 100 [2019-12-07 14:59:18,414 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-12-07 14:59:18,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-12-07 14:59:18,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-12-07 14:59:18,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-12-07 14:59:18,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-12-07 14:59:18,416 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 16 [2019-12-07 14:59:18,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:18,417 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-12-07 14:59:18,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:59:18,417 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-12-07 14:59:18,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 14:59:18,417 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:18,417 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:59:18,825 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3,17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:59:18,826 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 14:59:18,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:18,827 INFO L82 PathProgramCache]: Analyzing trace with hash -2039365097, now seen corresponding path program 1 times [2019-12-07 14:59:18,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:59:18,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1308138796] [2019-12-07 14:59:18,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 14:59:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:18,885 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:59:18,886 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:18,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:18,906 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:18,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:18,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1308138796] [2019-12-07 14:59:18,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1734391441] [2019-12-07 14:59:18,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:59:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:19,053 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:59:19,053 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:19,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:19,055 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:19,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:19,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527604207] [2019-12-07 14:59:19,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:59:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:19,097 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 14:59:19,098 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:19,101 INFO L377 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 [2019-12-07 14:59:19,101 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:59:19,103 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:59:19,103 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:59:19,103 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 14:59:19,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:59:19,158 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:19,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:59:19,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 4 imperfect interpolant sequences. [2019-12-07 14:59:19,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [6, 6, 6, 6] total 15 [2019-12-07 14:59:19,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717725395] [2019-12-07 14:59:19,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:59:19,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:59:19,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:59:19,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-12-07 14:59:19,162 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 7 states. [2019-12-07 14:59:19,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:19,509 INFO L93 Difference]: Finished difference Result 189 states and 202 transitions. [2019-12-07 14:59:19,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:59:19,510 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-12-07 14:59:19,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:19,510 INFO L225 Difference]: With dead ends: 189 [2019-12-07 14:59:19,510 INFO L226 Difference]: Without dead ends: 189 [2019-12-07 14:59:19,511 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2019-12-07 14:59:19,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-12-07 14:59:19,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 98. [2019-12-07 14:59:19,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-12-07 14:59:19,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2019-12-07 14:59:19,513 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 16 [2019-12-07 14:59:19,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:19,513 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2019-12-07 14:59:19,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:59:19,513 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2019-12-07 14:59:19,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 14:59:19,514 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:19,514 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:59:20,115 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:59:20,116 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 14:59:20,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:20,117 INFO L82 PathProgramCache]: Analyzing trace with hash -2039365096, now seen corresponding path program 1 times [2019-12-07 14:59:20,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:59:20,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [976141865] [2019-12-07 14:59:20,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-12-07 14:59:20,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:20,188 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:59:20,189 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:20,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:20,214 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:20,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:20,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [976141865] [2019-12-07 14:59:20,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [236315360] [2019-12-07 14:59:20,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:59:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:20,366 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:59:20,367 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:20,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:20,369 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:20,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:20,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881885121] [2019-12-07 14:59:20,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:59:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:20,413 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 14:59:20,414 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:20,425 INFO L377 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 [2019-12-07 14:59:20,425 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:59:20,428 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:59:20,428 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:59:20,429 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 14:59:20,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:59:20,512 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:20,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:59:20,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 4 imperfect interpolant sequences. [2019-12-07 14:59:20,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [6, 6, 6, 6] total 22 [2019-12-07 14:59:20,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911494273] [2019-12-07 14:59:20,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 14:59:20,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:59:20,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 14:59:20,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2019-12-07 14:59:20,951 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 14 states. [2019-12-07 14:59:21,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:21,553 INFO L93 Difference]: Finished difference Result 175 states and 189 transitions. [2019-12-07 14:59:21,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 14:59:21,554 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 16 [2019-12-07 14:59:21,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:21,555 INFO L225 Difference]: With dead ends: 175 [2019-12-07 14:59:21,555 INFO L226 Difference]: Without dead ends: 175 [2019-12-07 14:59:21,555 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2019-12-07 14:59:21,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-12-07 14:59:21,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 96. [2019-12-07 14:59:21,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-07 14:59:21,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2019-12-07 14:59:21,557 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 16 [2019-12-07 14:59:21,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:21,558 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2019-12-07 14:59:21,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 14:59:21,558 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2019-12-07 14:59:21,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 14:59:21,558 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:21,558 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:59:22,159 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3,22 cvc4 --incremental --print-success --lang smt --rewrite-divk,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:59:22,160 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 14:59:22,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:22,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1202804242, now seen corresponding path program 1 times [2019-12-07 14:59:22,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:59:22,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446039097] [2019-12-07 14:59:22,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-12-07 14:59:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:22,302 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:59:22,303 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:22,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:22,323 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:22,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:22,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446039097] [2019-12-07 14:59:22,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [815719214] [2019-12-07 14:59:22,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:59:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:22,447 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 14:59:22,448 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:22,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:59:22,495 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:22,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:59:22,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:59:22,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [6, 6] total 14 [2019-12-07 14:59:22,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998027924] [2019-12-07 14:59:22,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:59:22,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:59:22,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:59:22,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-12-07 14:59:22,498 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 6 states. [2019-12-07 14:59:22,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:22,550 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2019-12-07 14:59:22,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:59:22,550 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-07 14:59:22,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:22,551 INFO L225 Difference]: With dead ends: 96 [2019-12-07 14:59:22,551 INFO L226 Difference]: Without dead ends: 96 [2019-12-07 14:59:22,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-07 14:59:22,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-12-07 14:59:22,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-12-07 14:59:22,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-07 14:59:22,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2019-12-07 14:59:22,553 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 17 [2019-12-07 14:59:22,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:22,553 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2019-12-07 14:59:22,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:59:22,553 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2019-12-07 14:59:22,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 14:59:22,553 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:22,553 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:59:22,954 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 cvc4 --incremental --print-success --lang smt --rewrite-divk,24 mathsat -unsat_core_generation=3 [2019-12-07 14:59:22,955 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 14:59:22,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:22,956 INFO L82 PathProgramCache]: Analyzing trace with hash 208974459, now seen corresponding path program 1 times [2019-12-07 14:59:22,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:59:22,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [674278282] [2019-12-07 14:59:22,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2019-12-07 14:59:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:23,127 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:59:23,128 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:23,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:23,148 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:23,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:23,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [674278282] [2019-12-07 14:59:23,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [822684933] [2019-12-07 14:59:23,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:59:23,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:23,317 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:59:23,317 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:23,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:23,319 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:23,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:23,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126183292] [2019-12-07 14:59:23,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:59:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:23,365 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 14:59:23,366 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:23,370 INFO L377 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 [2019-12-07 14:59:23,370 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:59:23,373 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:59:23,373 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:59:23,373 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 14:59:23,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:59:23,425 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:23,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:59:23,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 4 imperfect interpolant sequences. [2019-12-07 14:59:23,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [6, 6, 6, 6] total 15 [2019-12-07 14:59:23,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136623406] [2019-12-07 14:59:23,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:59:23,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:59:23,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:59:23,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-12-07 14:59:23,460 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 7 states. [2019-12-07 14:59:23,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:23,836 INFO L93 Difference]: Finished difference Result 173 states and 184 transitions. [2019-12-07 14:59:23,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:59:23,836 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-12-07 14:59:23,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:23,837 INFO L225 Difference]: With dead ends: 173 [2019-12-07 14:59:23,837 INFO L226 Difference]: Without dead ends: 173 [2019-12-07 14:59:23,838 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2019-12-07 14:59:23,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-12-07 14:59:23,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 94. [2019-12-07 14:59:23,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-07 14:59:23,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2019-12-07 14:59:23,841 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 21 [2019-12-07 14:59:23,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:23,841 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2019-12-07 14:59:23,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:59:23,842 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2019-12-07 14:59:23,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 14:59:23,842 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:23,842 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:59:24,444 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,27 cvc4 --incremental --print-success --lang smt --rewrite-divk,26 mathsat -unsat_core_generation=3 [2019-12-07 14:59:24,445 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 14:59:24,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:24,446 INFO L82 PathProgramCache]: Analyzing trace with hash 208974460, now seen corresponding path program 1 times [2019-12-07 14:59:24,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:59:24,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [115839595] [2019-12-07 14:59:24,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2019-12-07 14:59:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:24,574 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:59:24,575 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:24,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:24,598 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:24,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:24,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [115839595] [2019-12-07 14:59:24,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2122873026] [2019-12-07 14:59:24,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/cvc4 Starting monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:59:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:24,769 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:59:24,769 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:24,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:24,771 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:24,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:24,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136860862] [2019-12-07 14:59:24,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:59:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:24,822 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 14:59:24,823 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:24,833 INFO L377 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 [2019-12-07 14:59:24,834 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:59:24,837 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:59:24,837 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:59:24,837 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 14:59:24,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:59:24,916 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:25,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:59:25,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 4 imperfect interpolant sequences. [2019-12-07 14:59:25,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [6, 6, 6, 6] total 22 [2019-12-07 14:59:25,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774354940] [2019-12-07 14:59:25,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 14:59:25,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:59:25,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 14:59:25,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2019-12-07 14:59:25,315 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand 14 states. [2019-12-07 14:59:25,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:25,863 INFO L93 Difference]: Finished difference Result 159 states and 171 transitions. [2019-12-07 14:59:25,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 14:59:25,864 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2019-12-07 14:59:25,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:25,864 INFO L225 Difference]: With dead ends: 159 [2019-12-07 14:59:25,864 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 14:59:25,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2019-12-07 14:59:25,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 14:59:25,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 92. [2019-12-07 14:59:25,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-12-07 14:59:25,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2019-12-07 14:59:25,867 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 21 [2019-12-07 14:59:25,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:25,867 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2019-12-07 14:59:25,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 14:59:25,867 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2019-12-07 14:59:25,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 14:59:25,867 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:25,868 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:59:26,469 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 cvc4 --incremental --print-success --lang smt --rewrite-divk,29 mathsat -unsat_core_generation=3,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:59:26,470 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 14:59:26,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:26,471 INFO L82 PathProgramCache]: Analyzing trace with hash -2132004494, now seen corresponding path program 1 times [2019-12-07 14:59:26,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:59:26,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239585774] [2019-12-07 14:59:26,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/mathsat Starting monitored process 32 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with mathsat -unsat_core_generation=3 [2019-12-07 14:59:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:26,543 INFO L264 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:59:26,544 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:26,563 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:26,564 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:26,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:26,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [239585774] [2019-12-07 14:59:26,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [906774429] [2019-12-07 14:59:26,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/cvc4 Starting monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:59:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:26,690 INFO L264 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 14:59:26,690 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:26,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:59:26,727 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:26,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:59:26,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:59:26,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [6, 6] total 14 [2019-12-07 14:59:26,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724414604] [2019-12-07 14:59:26,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:59:26,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:59:26,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:59:26,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-12-07 14:59:26,730 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand 6 states. [2019-12-07 14:59:26,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:26,779 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2019-12-07 14:59:26,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:59:26,779 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 14:59:26,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:26,779 INFO L225 Difference]: With dead ends: 92 [2019-12-07 14:59:26,779 INFO L226 Difference]: Without dead ends: 92 [2019-12-07 14:59:26,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-07 14:59:26,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-12-07 14:59:26,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-12-07 14:59:26,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-12-07 14:59:26,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2019-12-07 14:59:26,782 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 24 [2019-12-07 14:59:26,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:26,782 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2019-12-07 14:59:26,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:59:26,782 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2019-12-07 14:59:26,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 14:59:26,783 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:26,783 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:59:27,183 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 mathsat -unsat_core_generation=3,33 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:59:27,184 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 14:59:27,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:27,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1721326430, now seen corresponding path program 1 times [2019-12-07 14:59:27,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:59:27,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723727934] [2019-12-07 14:59:27,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/mathsat Starting monitored process 34 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with mathsat -unsat_core_generation=3 [2019-12-07 14:59:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:27,266 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:59:27,267 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:27,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:27,287 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:27,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:27,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723727934] [2019-12-07 14:59:27,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [31548931] [2019-12-07 14:59:27,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/cvc4 Starting monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:59:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:27,503 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:59:27,504 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:27,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:27,505 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:27,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:27,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299668471] [2019-12-07 14:59:27,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:59:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:27,563 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 14:59:27,564 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:27,575 INFO L377 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 [2019-12-07 14:59:27,575 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:59:27,579 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:59:27,579 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:59:27,579 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 14:59:27,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:59:27,686 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:28,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:59:28,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 4 imperfect interpolant sequences. [2019-12-07 14:59:28,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [6, 6, 6, 6] total 24 [2019-12-07 14:59:28,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926718319] [2019-12-07 14:59:28,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 14:59:28,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:59:28,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 14:59:28,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2019-12-07 14:59:28,259 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 16 states. [2019-12-07 14:59:28,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:28,914 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2019-12-07 14:59:28,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:59:28,914 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2019-12-07 14:59:28,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:28,915 INFO L225 Difference]: With dead ends: 92 [2019-12-07 14:59:28,915 INFO L226 Difference]: Without dead ends: 92 [2019-12-07 14:59:28,915 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2019-12-07 14:59:28,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-12-07 14:59:28,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2019-12-07 14:59:28,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-12-07 14:59:28,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2019-12-07 14:59:28,917 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 29 [2019-12-07 14:59:28,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:28,917 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2019-12-07 14:59:28,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 14:59:28,917 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2019-12-07 14:59:28,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 14:59:28,918 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:28,918 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:59:29,519 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 cvc4 --incremental --print-success --lang smt --rewrite-divk,34 mathsat -unsat_core_generation=3,36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:59:29,520 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 14:59:29,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:29,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1721326431, now seen corresponding path program 1 times [2019-12-07 14:59:29,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:59:29,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1287642817] [2019-12-07 14:59:29,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/mathsat Starting monitored process 37 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with mathsat -unsat_core_generation=3 [2019-12-07 14:59:29,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:29,711 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:59:29,711 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:29,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:29,731 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:29,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:29,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1287642817] [2019-12-07 14:59:29,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [542569256] [2019-12-07 14:59:29,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/cvc4 Starting monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:59:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:29,932 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:59:29,932 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:29,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:29,934 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:29,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:29,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294704162] [2019-12-07 14:59:29,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:59:29,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:29,989 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 14:59:29,990 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:29,992 INFO L377 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 [2019-12-07 14:59:29,993 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:59:29,994 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:59:29,994 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:59:29,994 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 14:59:30,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:59:30,058 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:30,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:59:30,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 4 imperfect interpolant sequences. [2019-12-07 14:59:30,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [6, 6, 6, 6] total 16 [2019-12-07 14:59:30,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565195208] [2019-12-07 14:59:30,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 14:59:30,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:59:30,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 14:59:30,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-07 14:59:30,073 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 8 states. [2019-12-07 14:59:30,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:30,444 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2019-12-07 14:59:30,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:59:30,445 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-12-07 14:59:30,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:30,445 INFO L225 Difference]: With dead ends: 117 [2019-12-07 14:59:30,445 INFO L226 Difference]: Without dead ends: 117 [2019-12-07 14:59:30,445 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2019-12-07 14:59:30,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-12-07 14:59:30,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 90. [2019-12-07 14:59:30,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-12-07 14:59:30,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2019-12-07 14:59:30,447 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 29 [2019-12-07 14:59:30,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:30,447 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2019-12-07 14:59:30,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 14:59:30,447 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2019-12-07 14:59:30,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 14:59:30,448 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:30,448 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:59:31,049 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 mathsat -unsat_core_generation=3,39 z3 -smt2 -in SMTLIB2_COMPLIANT=true,38 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:59:31,050 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 14:59:31,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:31,051 INFO L82 PathProgramCache]: Analyzing trace with hash -630871067, now seen corresponding path program 1 times [2019-12-07 14:59:31,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:59:31,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111694603] [2019-12-07 14:59:31,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/mathsat Starting monitored process 40 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with mathsat -unsat_core_generation=3 [2019-12-07 14:59:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:31,204 INFO L264 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:59:31,204 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:31,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:31,224 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:31,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:31,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1111694603] [2019-12-07 14:59:31,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1485012663] [2019-12-07 14:59:31,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/cvc4 Starting monitored process 41 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:59:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:31,354 INFO L264 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 14:59:31,354 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:31,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:59:31,401 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:31,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:59:31,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:59:31,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [6, 6] total 15 [2019-12-07 14:59:31,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864689891] [2019-12-07 14:59:31,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:59:31,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:59:31,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:59:31,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-12-07 14:59:31,404 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand 7 states. [2019-12-07 14:59:31,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:31,480 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2019-12-07 14:59:31,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:59:31,480 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-12-07 14:59:31,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:31,481 INFO L225 Difference]: With dead ends: 90 [2019-12-07 14:59:31,481 INFO L226 Difference]: Without dead ends: 90 [2019-12-07 14:59:31,481 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2019-12-07 14:59:31,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-12-07 14:59:31,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-12-07 14:59:31,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-12-07 14:59:31,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2019-12-07 14:59:31,483 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 31 [2019-12-07 14:59:31,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:31,483 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2019-12-07 14:59:31,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:59:31,483 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2019-12-07 14:59:31,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 14:59:31,483 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:31,483 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:59:31,884 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 mathsat -unsat_core_generation=3,41 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:59:31,885 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 14:59:31,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:31,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1851477083, now seen corresponding path program 1 times [2019-12-07 14:59:31,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:59:31,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1572085502] [2019-12-07 14:59:31,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/mathsat Starting monitored process 42 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with mathsat -unsat_core_generation=3 [2019-12-07 14:59:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:32,097 INFO L264 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:59:32,098 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:32,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:32,119 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:32,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:32,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1572085502] [2019-12-07 14:59:32,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [177469287] [2019-12-07 14:59:32,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/cvc4 Starting monitored process 43 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:59:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:32,365 INFO L264 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:59:32,366 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:32,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:32,368 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:32,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:32,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638494146] [2019-12-07 14:59:32,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:59:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:32,433 INFO L264 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 14:59:32,434 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:32,436 INFO L377 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 [2019-12-07 14:59:32,437 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:59:32,438 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:59:32,438 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:59:32,438 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 14:59:32,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:59:32,516 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:32,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:59:32,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 4 imperfect interpolant sequences. [2019-12-07 14:59:32,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [6, 6, 6, 6] total 17 [2019-12-07 14:59:32,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439799497] [2019-12-07 14:59:32,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 14:59:32,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:59:32,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 14:59:32,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-12-07 14:59:32,536 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 9 states. [2019-12-07 14:59:33,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:33,010 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2019-12-07 14:59:33,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:59:33,011 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-12-07 14:59:33,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:33,011 INFO L225 Difference]: With dead ends: 104 [2019-12-07 14:59:33,011 INFO L226 Difference]: Without dead ends: 104 [2019-12-07 14:59:33,012 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2019-12-07 14:59:33,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-12-07 14:59:33,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 93. [2019-12-07 14:59:33,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-12-07 14:59:33,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2019-12-07 14:59:33,014 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 35 [2019-12-07 14:59:33,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:33,014 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2019-12-07 14:59:33,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 14:59:33,014 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2019-12-07 14:59:33,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 14:59:33,014 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:33,015 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:59:33,616 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 mathsat -unsat_core_generation=3,44 z3 -smt2 -in SMTLIB2_COMPLIANT=true,43 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:59:33,617 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 14:59:33,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:33,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1851477082, now seen corresponding path program 1 times [2019-12-07 14:59:33,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:59:33,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [153218997] [2019-12-07 14:59:33,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/mathsat Starting monitored process 45 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with mathsat -unsat_core_generation=3 [2019-12-07 14:59:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:33,794 INFO L264 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:59:33,795 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:33,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:33,818 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:33,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:33,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [153218997] [2019-12-07 14:59:33,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1198945876] [2019-12-07 14:59:33,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/cvc4 Starting monitored process 46 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:59:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:34,056 INFO L264 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:59:34,056 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:34,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:34,058 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:34,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:34,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923680425] [2019-12-07 14:59:34,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:59:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:34,124 INFO L264 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:59:34,125 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:34,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:34,127 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:34,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:34,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:59:34,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 10 [2019-12-07 14:59:34,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923031208] [2019-12-07 14:59:34,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:59:34,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:59:34,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:59:34,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:59:34,130 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand 10 states. [2019-12-07 14:59:34,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:34,245 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2019-12-07 14:59:34,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:59:34,245 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2019-12-07 14:59:34,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:34,246 INFO L225 Difference]: With dead ends: 97 [2019-12-07 14:59:34,246 INFO L226 Difference]: Without dead ends: 97 [2019-12-07 14:59:34,246 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:59:34,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-12-07 14:59:34,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-12-07 14:59:34,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-12-07 14:59:34,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2019-12-07 14:59:34,248 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 35 [2019-12-07 14:59:34,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:34,248 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2019-12-07 14:59:34,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:59:34,248 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2019-12-07 14:59:34,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 14:59:34,248 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:34,248 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:59:34,849 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true,45 mathsat -unsat_core_generation=3,46 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:59:34,850 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 14:59:34,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:34,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1178180774, now seen corresponding path program 2 times [2019-12-07 14:59:34,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:59:34,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183743928] [2019-12-07 14:59:34,852 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/mathsat Starting monitored process 48 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with mathsat -unsat_core_generation=3 [2019-12-07 14:59:34,986 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-12-07 14:59:34,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:59:34,996 INFO L264 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-07 14:59:34,997 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:35,002 INFO L377 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 [2019-12-07 14:59:35,002 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:59:35,007 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:59:35,008 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:59:35,008 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 14:59:35,086 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 14:59:35,086 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:35,611 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 14:59:35,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183743928] [2019-12-07 14:59:35,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:35,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 17 [2019-12-07 14:59:35,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946456587] [2019-12-07 14:59:35,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 14:59:35,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:59:35,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 14:59:35,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-12-07 14:59:35,612 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand 18 states. [2019-12-07 14:59:36,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:36,404 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2019-12-07 14:59:36,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:59:36,405 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2019-12-07 14:59:36,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:36,406 INFO L225 Difference]: With dead ends: 97 [2019-12-07 14:59:36,406 INFO L226 Difference]: Without dead ends: 97 [2019-12-07 14:59:36,406 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2019-12-07 14:59:36,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-12-07 14:59:36,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2019-12-07 14:59:36,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-12-07 14:59:36,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2019-12-07 14:59:36,407 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 39 [2019-12-07 14:59:36,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:36,408 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2019-12-07 14:59:36,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 14:59:36,408 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2019-12-07 14:59:36,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 14:59:36,408 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:36,408 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:59:36,608 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 mathsat -unsat_core_generation=3 [2019-12-07 14:59:36,609 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 14:59:36,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:36,610 INFO L82 PathProgramCache]: Analyzing trace with hash 710729147, now seen corresponding path program 1 times [2019-12-07 14:59:36,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:59:36,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [379374054] [2019-12-07 14:59:36,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/mathsat Starting monitored process 49 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with mathsat -unsat_core_generation=3 [2019-12-07 14:59:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:36,757 INFO L264 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 14:59:36,758 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:36,817 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:36,817 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:37,092 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:37,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [379374054] [2019-12-07 14:59:37,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2074596168] [2019-12-07 14:59:37,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/cvc4 Starting monitored process 50 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:59:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:37,195 INFO L264 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 14:59:37,196 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:37,372 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 14:59:37,372 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:37,376 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 14:59:37,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:59:37,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [10, 10] total 25 [2019-12-07 14:59:37,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65534356] [2019-12-07 14:59:37,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 14:59:37,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:59:37,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 14:59:37,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2019-12-07 14:59:37,377 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand 9 states. [2019-12-07 14:59:37,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:37,764 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2019-12-07 14:59:37,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:59:37,765 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2019-12-07 14:59:37,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:37,766 INFO L225 Difference]: With dead ends: 95 [2019-12-07 14:59:37,766 INFO L226 Difference]: Without dead ends: 95 [2019-12-07 14:59:37,766 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=165, Invalid=765, Unknown=0, NotChecked=0, Total=930 [2019-12-07 14:59:37,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-12-07 14:59:37,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2019-12-07 14:59:37,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-12-07 14:59:37,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2019-12-07 14:59:37,768 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 42 [2019-12-07 14:59:37,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:37,768 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2019-12-07 14:59:37,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 14:59:37,768 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2019-12-07 14:59:37,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 14:59:37,768 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:37,768 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:59:38,169 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 cvc4 --incremental --print-success --lang smt --rewrite-divk,49 mathsat -unsat_core_generation=3 [2019-12-07 14:59:38,169 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 14:59:38,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:38,169 INFO L82 PathProgramCache]: Analyzing trace with hash -856621815, now seen corresponding path program 1 times [2019-12-07 14:59:38,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:59:38,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561536474] [2019-12-07 14:59:38,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/mathsat Starting monitored process 51 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with mathsat -unsat_core_generation=3 [2019-12-07 14:59:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:38,272 INFO L264 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 14:59:38,273 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:38,328 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:38,328 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:38,599 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:38,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561536474] [2019-12-07 14:59:38,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [227959584] [2019-12-07 14:59:38,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/cvc4 Starting monitored process 52 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:59:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:38,794 INFO L264 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 14:59:38,795 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:38,798 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:38,798 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:38,801 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:38,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903678335] [2019-12-07 14:59:38,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:59:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:38,873 INFO L264 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 14:59:38,873 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:38,877 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:38,877 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:38,879 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:38,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:59:38,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 10, 10, 10] total 18 [2019-12-07 14:59:38,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868009769] [2019-12-07 14:59:38,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 14:59:38,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:59:38,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 14:59:38,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-12-07 14:59:38,881 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand 18 states. [2019-12-07 14:59:39,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:39,492 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2019-12-07 14:59:39,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 14:59:39,493 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2019-12-07 14:59:39,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:39,493 INFO L225 Difference]: With dead ends: 99 [2019-12-07 14:59:39,493 INFO L226 Difference]: Without dead ends: 99 [2019-12-07 14:59:39,493 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=223, Invalid=377, Unknown=0, NotChecked=0, Total=600 [2019-12-07 14:59:39,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-12-07 14:59:39,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-12-07 14:59:39,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-12-07 14:59:39,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2019-12-07 14:59:39,495 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 45 [2019-12-07 14:59:39,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:39,495 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2019-12-07 14:59:39,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 14:59:39,495 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2019-12-07 14:59:39,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 14:59:39,495 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:39,496 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:59:40,097 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 mathsat -unsat_core_generation=3,53 z3 -smt2 -in SMTLIB2_COMPLIANT=true,52 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:59:40,098 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 14:59:40,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:40,099 INFO L82 PathProgramCache]: Analyzing trace with hash -729821431, now seen corresponding path program 2 times [2019-12-07 14:59:40,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:59:40,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [312868061] [2019-12-07 14:59:40,100 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/mathsat Starting monitored process 54 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with mathsat -unsat_core_generation=3 [2019-12-07 14:59:40,268 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-12-07 14:59:40,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:59:40,286 INFO L264 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 68 conjunts are in the unsatisfiable core [2019-12-07 14:59:40,287 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:40,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:59:40,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:59:40,336 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:59:40,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:59:40,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:59:40,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:59:40,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:59:40,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:59:40,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:59:40,341 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:59:40,341 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:59:40,343 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2019-12-07 14:59:40,343 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:59:40,358 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:59:40,358 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:59:40,358 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:50 [2019-12-07 14:59:40,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:59:40,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:59:40,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:59:40,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:59:40,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:59:40,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:59:40,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:59:40,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:59:40,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:59:40,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:59:40,436 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 53 [2019-12-07 14:59:40,436 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:59:40,454 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:59:40,454 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:59:40,455 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:52 [2019-12-07 14:59:40,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:59:40,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:59:40,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:59:40,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:59:40,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:59:40,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:59:40,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:59:40,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:59:40,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:59:40,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:59:40,465 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:59:40,466 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 53 [2019-12-07 14:59:40,466 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:59:40,477 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:59:40,477 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:59:40,477 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:44 [2019-12-07 14:59:40,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:59:40,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:59:40,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:59:40,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:59:40,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:59:40,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:59:40,776 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:59:40,777 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 201 treesize of output 89 [2019-12-07 14:59:40,777 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:59:40,789 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:59:40,789 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:59:40,790 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:204, output treesize:92 [2019-12-07 14:59:40,942 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:59:40,942 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 106 treesize of output 74 [2019-12-07 14:59:40,943 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:59:40,947 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:59:40,947 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:59:40,947 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:109, output treesize:65 [2019-12-07 14:59:41,103 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-12-07 14:59:41,103 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:42,925 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:59:42,933 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:59:42,933 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:59:42,933 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:538, output treesize:1067 [2019-12-07 14:59:43,174 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:59:43,182 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:59:43,183 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:59:43,183 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:1084, output treesize:1232 [2019-12-07 15:00:10,864 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:00:10,864 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:00:10,865 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:00:10,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:00:10,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:09:42,233 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-12-07 15:09:42,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [312868061] [2019-12-07 15:09:42,234 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") [2019-12-07 15:09:42,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [699208972] [2019-12-07 15:09:42,234 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/cvc4 Starting monitored process 55 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 15:09:42,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-12-07 15:09:42,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:09:42,686 INFO L264 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 70 conjunts are in the unsatisfiable core [2019-12-07 15:09:42,748 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:09:42,751 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken [2019-12-07 15:09:42,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086176139] [2019-12-07 15:09:42,751 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d213d516-df65-4665-a8e7-fe8110ae81a1/bin/utaipan/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:09:42,815 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-12-07 15:09:42,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:09:42,819 INFO L264 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 68 conjunts are in the unsatisfiable core [2019-12-07 15:09:42,821 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:09:42,824 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@4feba9c5 [2019-12-07 15:09:42,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:09:42,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 15:09:42,824 ERROR L206 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2019-12-07 15:09:42,824 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 15:09:43,429 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 cvc4 --incremental --print-success --lang smt --rewrite-divk,56 z3 -smt2 -in SMTLIB2_COMPLIANT=true,54 mathsat -unsat_core_generation=3 [2019-12-07 15:09:43,454 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 15:09:43,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 03:09:43 BoogieIcfgContainer [2019-12-07 15:09:43,454 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 15:09:43,454 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 15:09:43,454 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 15:09:43,454 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 15:09:43,455 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:59:10" (3/4) ... [2019-12-07 15:09:43,457 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 15:09:43,457 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 15:09:43,458 INFO L168 Benchmark]: Toolchain (without parser) took 634360.04 ms. Allocated memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: 2.1 GB). Free memory was 948.4 MB in the beginning and 2.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 629.2 MB. Max. memory is 11.5 GB. [2019-12-07 15:09:43,458 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:09:43,458 INFO L168 Benchmark]: CACSL2BoogieTranslator took 423.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -148.9 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2019-12-07 15:09:43,459 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-12-07 15:09:43,459 INFO L168 Benchmark]: Boogie Preprocessor took 29.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:09:43,459 INFO L168 Benchmark]: RCFGBuilder took 455.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.5 MB). Peak memory consumption was 47.5 MB. Max. memory is 11.5 GB. [2019-12-07 15:09:43,459 INFO L168 Benchmark]: TraceAbstraction took 633403.84 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 2.0 GB). Free memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 588.0 MB. Max. memory is 11.5 GB. [2019-12-07 15:09:43,459 INFO L168 Benchmark]: Witness Printer took 2.85 ms. Allocated memory is still 3.1 GB. Free memory is still 2.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:09:43,461 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 423.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -148.9 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 455.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.5 MB). Peak memory consumption was 47.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 633403.84 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 2.0 GB). Free memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 588.0 MB. Max. memory is 11.5 GB. * Witness Printer took 2.85 ms. Allocated memory is still 3.1 GB. Free memory is still 2.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 702]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L758] struct ldv_kobject *kobj; [L740] struct ldv_kobject *kobj; [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); [L741] kobj = ldv_malloc(sizeof(*kobj)) [L742] COND FALSE !(!kobj) [L730] COND FALSE !(!kobj) [L723] COND FALSE !(!kobj) [L682] ((&kref->refcount)->counter) = (1) [L540] list->next = list [L541] list->prev = list [L746] return kobj; [L759] kobj = ldv_kobject_create() [L717] COND TRUE \read(*kobj) [L657] int temp; [L658] EXPR v->counter [L658] temp = v->counter [L659] temp += i [L660] v->counter = temp [L661] return temp; [L719] return kobj; [L711] COND TRUE \read(*kobj) [L665] int temp; [L666] EXPR v->counter [L666] temp = v->counter [L667] temp -= i [L668] v->counter = temp [L669] return temp; [L674] COND TRUE (ldv_atomic_sub_return(((int) count), (&kref->refcount)) == 0) [L706] const typeof( ((struct ldv_kobject *)0)->kref ) *__mptr = (kref); [L706] struct ldv_kobject *kobj = ({ const typeof( ((struct ldv_kobject *)0)->kref ) *__mptr = (kref); (struct ldv_kobject *)( (char *)__mptr - ((size_t) &((struct ldv_kobject *)0)->kref) );}); [L699] EXPR kobj->name [L699] char *name = kobj->name; [L700] free(kobj) [L700] free(kobj) [L700] free(kobj) [L701] COND TRUE \read(*name) [L702] free(name) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 104 locations, 37 error locations. Result: UNKNOWN, OverallTime: 633.3s, OverallIterations: 26, TraceHistogramMax: 14, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2767 SDtfs, 8869 SDslu, 4758 SDs, 0 SdLazy, 2426 SolverSat, 151 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2376 GetRequests, 1995 SyntacticMatches, 5 SemanticMatches, 376 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1471 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 1412 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 1195 NumberOfCodeBlocks, 1189 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 2286 ConstructedInterpolants, 0 QuantifiedInterpolants, 205144 SizeOfPredicates, 325 NumberOfNonLiveVariables, 6252 ConjunctsInSsa, 464 ConjunctsInUnsatCore, 104 InterpolantComputations, 46 PerfectInterpolantSequences, 162/480 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...