./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/getNumbers4-1.c --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_a268d69e-e6cb-452c-b63b-fcb9ee9b9d98/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a268d69e-e6cb-452c-b63b-fcb9ee9b9d98/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a268d69e-e6cb-452c-b63b-fcb9ee9b9d98/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a268d69e-e6cb-452c-b63b-fcb9ee9b9d98/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/getNumbers4-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a268d69e-e6cb-452c-b63b-fcb9ee9b9d98/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a268d69e-e6cb-452c-b63b-fcb9ee9b9d98/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 b8a667539b0a7850f9a7aa38ebbe1ead0e2c55d4 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 20:09:19,046 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:09:19,047 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:09:19,054 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:09:19,055 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:09:19,055 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:09:19,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:09:19,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:09:19,059 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:09:19,059 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:09:19,060 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:09:19,061 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:09:19,061 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:09:19,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:09:19,062 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:09:19,063 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:09:19,063 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:09:19,064 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:09:19,065 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:09:19,067 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:09:19,068 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:09:19,068 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:09:19,069 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:09:19,070 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:09:19,071 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:09:19,071 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:09:19,072 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:09:19,072 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:09:19,072 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:09:19,073 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:09:19,073 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:09:19,073 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:09:19,074 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:09:19,074 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:09:19,075 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:09:19,075 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:09:19,075 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:09:19,076 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:09:19,076 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:09:19,076 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:09:19,077 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:09:19,077 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a268d69e-e6cb-452c-b63b-fcb9ee9b9d98/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 20:09:19,086 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:09:19,087 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:09:19,087 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:09:19,087 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:09:19,087 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:09:19,087 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:09:19,087 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:09:19,088 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:09:19,088 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:09:19,088 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:09:19,088 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:09:19,088 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:09:19,088 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:09:19,088 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:09:19,088 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:09:19,089 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 20:09:19,089 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 20:09:19,089 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:09:19,089 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:09:19,089 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 20:09:19,089 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:09:19,089 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:09:19,089 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:09:19,090 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 20:09:19,090 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 20:09:19,090 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 20:09:19,090 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:09:19,090 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:09:19,090 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:09:19,090 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:09:19,090 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:09:19,091 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:09:19,091 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:09:19,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:09:19,091 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:09:19,091 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:09:19,091 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:09:19,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:09:19,091 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:09:19,092 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:09:19,092 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_a268d69e-e6cb-452c-b63b-fcb9ee9b9d98/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 -> b8a667539b0a7850f9a7aa38ebbe1ead0e2c55d4 [2019-12-07 20:09:19,189 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:09:19,197 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:09:19,199 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:09:19,200 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:09:19,200 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:09:19,200 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a268d69e-e6cb-452c-b63b-fcb9ee9b9d98/bin/utaipan/../../sv-benchmarks/c/memsafety-ext3/getNumbers4-1.c [2019-12-07 20:09:19,238 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a268d69e-e6cb-452c-b63b-fcb9ee9b9d98/bin/utaipan/data/85e467ec1/d6e73da0988e47eaabeecf47cc74272c/FLAGff93f60c2 [2019-12-07 20:09:19,577 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:09:19,577 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a268d69e-e6cb-452c-b63b-fcb9ee9b9d98/sv-benchmarks/c/memsafety-ext3/getNumbers4-1.c [2019-12-07 20:09:19,581 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a268d69e-e6cb-452c-b63b-fcb9ee9b9d98/bin/utaipan/data/85e467ec1/d6e73da0988e47eaabeecf47cc74272c/FLAGff93f60c2 [2019-12-07 20:09:19,589 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a268d69e-e6cb-452c-b63b-fcb9ee9b9d98/bin/utaipan/data/85e467ec1/d6e73da0988e47eaabeecf47cc74272c [2019-12-07 20:09:19,591 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:09:19,592 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:09:19,592 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:09:19,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:09:19,595 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:09:19,595 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:09:19" (1/1) ... [2019-12-07 20:09:19,597 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@562a9304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:09:19, skipping insertion in model container [2019-12-07 20:09:19,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:09:19" (1/1) ... [2019-12-07 20:09:19,602 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:09:19,613 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:09:19,750 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:09:19,760 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:09:19,775 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:09:19,788 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:09:19,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:09:19 WrapperNode [2019-12-07 20:09:19,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:09:19,789 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:09:19,789 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:09:19,789 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:09:19,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:09:19" (1/1) ... [2019-12-07 20:09:19,801 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:09:19" (1/1) ... [2019-12-07 20:09:19,818 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:09:19,818 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:09:19,818 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:09:19,818 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:09:19,824 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:09:19" (1/1) ... [2019-12-07 20:09:19,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:09:19" (1/1) ... [2019-12-07 20:09:19,826 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:09:19" (1/1) ... [2019-12-07 20:09:19,826 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:09:19" (1/1) ... [2019-12-07 20:09:19,831 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:09:19" (1/1) ... [2019-12-07 20:09:19,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:09:19" (1/1) ... [2019-12-07 20:09:19,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:09:19" (1/1) ... [2019-12-07 20:09:19,836 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:09:19,837 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:09:19,837 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:09:19,837 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:09:19,837 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:09:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a268d69e-e6cb-452c-b63b-fcb9ee9b9d98/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 20:09:19,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 20:09:19,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:09:19,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:09:19,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 20:09:19,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-07 20:09:19,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 20:09:20,165 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:09:20,165 INFO L287 CfgBuilder]: Removed 17 assume(true) statements. [2019-12-07 20:09:20,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:09:20 BoogieIcfgContainer [2019-12-07 20:09:20,166 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:09:20,167 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:09:20,167 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:09:20,170 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:09:20,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:09:19" (1/3) ... [2019-12-07 20:09:20,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad9e394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:09:20, skipping insertion in model container [2019-12-07 20:09:20,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:09:19" (2/3) ... [2019-12-07 20:09:20,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad9e394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:09:20, skipping insertion in model container [2019-12-07 20:09:20,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:09:20" (3/3) ... [2019-12-07 20:09:20,172 INFO L109 eAbstractionObserver]: Analyzing ICFG getNumbers4-1.c [2019-12-07 20:09:20,179 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:09:20,183 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-12-07 20:09:20,191 INFO L249 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-12-07 20:09:20,204 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:09:20,204 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 20:09:20,205 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:09:20,205 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:09:20,205 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:09:20,205 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:09:20,205 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:09:20,205 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:09:20,215 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-12-07 20:09:20,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 20:09:20,219 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:09:20,220 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 20:09:20,220 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:09:20,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:09:20,224 INFO L82 PathProgramCache]: Analyzing trace with hash 144472, now seen corresponding path program 1 times [2019-12-07 20:09:20,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:09:20,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435875499] [2019-12-07 20:09:20,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:09:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:20,358 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 20:09:20,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435875499] [2019-12-07 20:09:20,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:09:20,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:09:20,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326685705] [2019-12-07 20:09:20,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:09:20,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:09:20,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:09:20,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:09:20,373 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2019-12-07 20:09:20,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:09:20,408 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-12-07 20:09:20,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:09:20,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 20:09:20,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:09:20,415 INFO L225 Difference]: With dead ends: 32 [2019-12-07 20:09:20,415 INFO L226 Difference]: Without dead ends: 31 [2019-12-07 20:09:20,416 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 20:09:20,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-07 20:09:20,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-07 20:09:20,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 20:09:20,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-12-07 20:09:20,438 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 3 [2019-12-07 20:09:20,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:09:20,438 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-12-07 20:09:20,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:09:20,438 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-12-07 20:09:20,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 20:09:20,438 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:09:20,438 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 20:09:20,439 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:09:20,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:09:20,439 INFO L82 PathProgramCache]: Analyzing trace with hash 144473, now seen corresponding path program 1 times [2019-12-07 20:09:20,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:09:20,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094469994] [2019-12-07 20:09:20,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:09:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:20,479 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 20:09:20,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094469994] [2019-12-07 20:09:20,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:09:20,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:09:20,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694426895] [2019-12-07 20:09:20,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:09:20,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:09:20,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:09:20,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:09:20,481 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 3 states. [2019-12-07 20:09:20,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:09:20,509 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-12-07 20:09:20,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:09:20,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 20:09:20,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:09:20,510 INFO L225 Difference]: With dead ends: 33 [2019-12-07 20:09:20,510 INFO L226 Difference]: Without dead ends: 33 [2019-12-07 20:09:20,511 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 20:09:20,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-12-07 20:09:20,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-12-07 20:09:20,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 20:09:20,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-12-07 20:09:20,516 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 3 [2019-12-07 20:09:20,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:09:20,516 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-12-07 20:09:20,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:09:20,516 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-12-07 20:09:20,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 20:09:20,516 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:09:20,517 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-12-07 20:09:20,517 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:09:20,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:09:20,517 INFO L82 PathProgramCache]: Analyzing trace with hash 138938820, now seen corresponding path program 1 times [2019-12-07 20:09:20,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:09:20,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673434156] [2019-12-07 20:09:20,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:09:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:20,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:09:20,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673434156] [2019-12-07 20:09:20,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929616195] [2019-12-07 20:09:20,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a268d69e-e6cb-452c-b63b-fcb9ee9b9d98/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:09:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:20,606 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 20:09:20,609 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:09:20,637 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_39|], 15=[|v_#valid_45|]} [2019-12-07 20:09:20,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:09:20,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:09:20,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:09:20,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:09:20,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:09:20,651 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:09:20,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:09:20,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:09:20,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:09:20,672 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:09:20,672 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 40 [2019-12-07 20:09:20,673 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:09:20,710 INFO L614 ElimStorePlain]: treesize reduction 10, result has 89.7 percent of original size [2019-12-07 20:09:20,741 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:09:20,742 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 495 treesize of output 507 [2019-12-07 20:09:20,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:20,783 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:09:21,080 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 42 [2019-12-07 20:09:21,081 INFO L614 ElimStorePlain]: treesize reduction 11264, result has 0.5 percent of original size [2019-12-07 20:09:21,082 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 20:09:21,083 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:76, output treesize:51 [2019-12-07 20:09:21,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:09:21,129 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:09:21,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:09:21,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1943833597] [2019-12-07 20:09:21,164 INFO L159 IcfgInterpreter]: Started Sifa with 4 locations of interest [2019-12-07 20:09:21,165 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:09:21,168 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:09:21,172 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:09:21,172 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:09:21,800 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:09:22,263 WARN L192 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 118 [2019-12-07 20:09:22,341 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:09:22,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:09:22,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-12-07 20:09:22,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703238781] [2019-12-07 20:09:22,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 20:09:22,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:09:22,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 20:09:22,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:09:22,343 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2019-12-07 20:09:22,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:09:22,483 INFO L93 Difference]: Finished difference Result 93 states and 105 transitions. [2019-12-07 20:09:22,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:09:22,484 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-12-07 20:09:22,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:09:22,485 INFO L225 Difference]: With dead ends: 93 [2019-12-07 20:09:22,485 INFO L226 Difference]: Without dead ends: 93 [2019-12-07 20:09:22,485 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-07 20:09:22,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-12-07 20:09:22,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 39. [2019-12-07 20:09:22,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-12-07 20:09:22,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-12-07 20:09:22,490 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 5 [2019-12-07 20:09:22,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:09:22,490 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-12-07 20:09:22,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 20:09:22,490 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2019-12-07 20:09:22,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 20:09:22,491 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:09:22,491 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-12-07 20:09:22,691 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:09:22,692 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:09:22,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:09:22,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1218859716, now seen corresponding path program 1 times [2019-12-07 20:09:22,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:09:22,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474657602] [2019-12-07 20:09:22,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:09:22,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:22,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:09:22,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474657602] [2019-12-07 20:09:22,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450333074] [2019-12-07 20:09:22,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a268d69e-e6cb-452c-b63b-fcb9ee9b9d98/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:09:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:22,786 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 20:09:22,787 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:09:22,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:09:22,793 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:09:22,807 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:09:22,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1687223785] [2019-12-07 20:09:22,808 INFO L159 IcfgInterpreter]: Started Sifa with 6 locations of interest [2019-12-07 20:09:22,808 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:09:22,808 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:09:22,808 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:09:22,808 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:09:23,257 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:09:23,640 WARN L192 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 118 [2019-12-07 20:09:23,878 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 61 [2019-12-07 20:09:23,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:09:23,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4, 4] total 11 [2019-12-07 20:09:23,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481667949] [2019-12-07 20:09:23,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:09:23,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:09:23,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:09:23,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-12-07 20:09:23,907 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 5 states. [2019-12-07 20:09:24,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:09:24,112 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2019-12-07 20:09:24,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:09:24,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-12-07 20:09:24,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:09:24,113 INFO L225 Difference]: With dead ends: 71 [2019-12-07 20:09:24,113 INFO L226 Difference]: Without dead ends: 71 [2019-12-07 20:09:24,113 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-12-07 20:09:24,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-12-07 20:09:24,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 41. [2019-12-07 20:09:24,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 20:09:24,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-12-07 20:09:24,117 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 8 [2019-12-07 20:09:24,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:09:24,117 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-12-07 20:09:24,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:09:24,117 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-12-07 20:09:24,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 20:09:24,117 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:09:24,117 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-12-07 20:09:24,317 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:09:24,318 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:09:24,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:09:24,319 INFO L82 PathProgramCache]: Analyzing trace with hash 870054440, now seen corresponding path program 1 times [2019-12-07 20:09:24,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:09:24,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856203163] [2019-12-07 20:09:24,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:09:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:24,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:09:24,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856203163] [2019-12-07 20:09:24,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378868384] [2019-12-07 20:09:24,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a268d69e-e6cb-452c-b63b-fcb9ee9b9d98/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:09:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:24,406 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 20:09:24,406 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:09:24,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:09:24,411 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:09:24,423 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:09:24,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2136297517] [2019-12-07 20:09:24,424 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 20:09:24,424 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:09:24,424 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:09:24,425 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:09:24,425 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:09:24,835 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:09:24,999 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 70 [2019-12-07 20:09:25,362 WARN L192 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 118 [2019-12-07 20:09:25,638 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 61 [2019-12-07 20:09:25,866 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 67 [2019-12-07 20:09:25,866 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:09:25,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:09:25,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2019-12-07 20:09:25,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648305140] [2019-12-07 20:09:25,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 20:09:25,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:09:25,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 20:09:25,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-12-07 20:09:25,868 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 9 states. [2019-12-07 20:09:25,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:09:25,888 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-12-07 20:09:25,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 20:09:25,888 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-12-07 20:09:25,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:09:25,889 INFO L225 Difference]: With dead ends: 45 [2019-12-07 20:09:25,889 INFO L226 Difference]: Without dead ends: 45 [2019-12-07 20:09:25,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-12-07 20:09:25,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-12-07 20:09:25,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-12-07 20:09:25,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-07 20:09:25,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2019-12-07 20:09:25,892 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 9 [2019-12-07 20:09:25,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:09:25,892 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2019-12-07 20:09:25,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 20:09:25,892 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2019-12-07 20:09:25,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 20:09:25,892 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:09:25,892 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2019-12-07 20:09:26,092 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:09:26,093 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:09:26,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:09:26,093 INFO L82 PathProgramCache]: Analyzing trace with hash -541970043, now seen corresponding path program 2 times [2019-12-07 20:09:26,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:09:26,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478576603] [2019-12-07 20:09:26,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:09:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:26,161 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:09:26,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478576603] [2019-12-07 20:09:26,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986888342] [2019-12-07 20:09:26,161 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a268d69e-e6cb-452c-b63b-fcb9ee9b9d98/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:09:26,188 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-07 20:09:26,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:09:26,189 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 20:09:26,190 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:09:26,370 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 38 [2019-12-07 20:09:26,451 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 20:09:26,451 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:09:26,496 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 20:09:26,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-12-07 20:09:26,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 11 [2019-12-07 20:09:26,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105348941] [2019-12-07 20:09:26,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:09:26,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:09:26,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:09:26,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-12-07 20:09:26,497 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 5 states. [2019-12-07 20:09:26,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:09:26,547 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-12-07 20:09:26,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:09:26,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-07 20:09:26,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:09:26,548 INFO L225 Difference]: With dead ends: 43 [2019-12-07 20:09:26,548 INFO L226 Difference]: Without dead ends: 43 [2019-12-07 20:09:26,548 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-12-07 20:09:26,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-07 20:09:26,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-12-07 20:09:26,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-12-07 20:09:26,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-12-07 20:09:26,551 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 11 [2019-12-07 20:09:26,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:09:26,552 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-12-07 20:09:26,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:09:26,552 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-12-07 20:09:26,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 20:09:26,552 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:09:26,552 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1] [2019-12-07 20:09:26,753 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:09:26,753 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:09:26,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:09:26,753 INFO L82 PathProgramCache]: Analyzing trace with hash -194222508, now seen corresponding path program 2 times [2019-12-07 20:09:26,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:09:26,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074384585] [2019-12-07 20:09:26,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:09:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:26,802 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:09:26,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074384585] [2019-12-07 20:09:26,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426484188] [2019-12-07 20:09:26,802 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a268d69e-e6cb-452c-b63b-fcb9ee9b9d98/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:09:26,828 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-12-07 20:09:26,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:09:26,829 INFO L264 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 20:09:26,830 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:09:27,069 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 47 [2019-12-07 20:09:27,770 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-07 20:09:27,770 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:09:27,779 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-07 20:09:27,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 20:09:27,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [8] total 10 [2019-12-07 20:09:27,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501447268] [2019-12-07 20:09:27,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:09:27,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:09:27,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:09:27,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:09:27,780 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 4 states. [2019-12-07 20:09:27,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:09:27,803 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-12-07 20:09:27,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:09:27,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 20:09:27,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:09:27,804 INFO L225 Difference]: With dead ends: 42 [2019-12-07 20:09:27,805 INFO L226 Difference]: Without dead ends: 42 [2019-12-07 20:09:27,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 15 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:09:27,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-07 20:09:27,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-12-07 20:09:27,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 20:09:27,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-12-07 20:09:27,807 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 17 [2019-12-07 20:09:27,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:09:27,807 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-12-07 20:09:27,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:09:27,807 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-12-07 20:09:27,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 20:09:27,808 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:09:27,808 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1] [2019-12-07 20:09:28,008 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:09:28,009 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:09:28,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:09:28,010 INFO L82 PathProgramCache]: Analyzing trace with hash -194222507, now seen corresponding path program 1 times [2019-12-07 20:09:28,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:09:28,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166684275] [2019-12-07 20:09:28,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:09:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:28,083 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:09:28,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166684275] [2019-12-07 20:09:28,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625658768] [2019-12-07 20:09:28,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a268d69e-e6cb-452c-b63b-fcb9ee9b9d98/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:09:28,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:28,115 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 20:09:28,116 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:09:28,122 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:09:28,122 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:09:28,158 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:09:28,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1447950538] [2019-12-07 20:09:28,159 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 20:09:28,159 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:09:28,159 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:09:28,159 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:09:28,160 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:09:28,612 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:09:28,808 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 71 [2019-12-07 20:09:29,151 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 118 [2019-12-07 20:09:29,388 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 61 [2019-12-07 20:09:29,631 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 67 [2019-12-07 20:09:29,631 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:09:29,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:09:29,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2019-12-07 20:09:29,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422628067] [2019-12-07 20:09:29,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 20:09:29,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:09:29,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 20:09:29,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2019-12-07 20:09:29,632 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 13 states. [2019-12-07 20:09:29,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:09:29,657 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-12-07 20:09:29,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 20:09:29,657 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2019-12-07 20:09:29,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:09:29,658 INFO L225 Difference]: With dead ends: 50 [2019-12-07 20:09:29,658 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 20:09:29,658 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2019-12-07 20:09:29,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 20:09:29,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-12-07 20:09:29,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 20:09:29,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-12-07 20:09:29,660 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2019-12-07 20:09:29,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:09:29,661 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-12-07 20:09:29,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 20:09:29,661 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-12-07 20:09:29,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 20:09:29,661 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:09:29,661 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1] [2019-12-07 20:09:29,862 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:09:29,862 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:09:29,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:09:29,863 INFO L82 PathProgramCache]: Analyzing trace with hash 2140399233, now seen corresponding path program 2 times [2019-12-07 20:09:29,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:09:29,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085648830] [2019-12-07 20:09:29,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:09:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:29,923 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 20:09:29,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085648830] [2019-12-07 20:09:29,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:09:29,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:09:29,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570070298] [2019-12-07 20:09:29,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:09:29,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:09:29,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:09:29,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:09:29,925 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 4 states. [2019-12-07 20:09:29,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:09:29,952 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-12-07 20:09:29,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:09:29,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-07 20:09:29,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:09:29,953 INFO L225 Difference]: With dead ends: 51 [2019-12-07 20:09:29,953 INFO L226 Difference]: Without dead ends: 51 [2019-12-07 20:09:29,953 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:09:29,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-07 20:09:29,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-12-07 20:09:29,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-12-07 20:09:29,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-12-07 20:09:29,956 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 25 [2019-12-07 20:09:29,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:09:29,956 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-12-07 20:09:29,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:09:29,956 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-12-07 20:09:29,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 20:09:29,957 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:09:29,957 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 2, 1, 1, 1, 1, 1] [2019-12-07 20:09:29,957 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:09:29,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:09:29,957 INFO L82 PathProgramCache]: Analyzing trace with hash -365594060, now seen corresponding path program 1 times [2019-12-07 20:09:29,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:09:29,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057789056] [2019-12-07 20:09:29,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:09:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:30,119 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 92 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:09:30,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057789056] [2019-12-07 20:09:30,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285256164] [2019-12-07 20:09:30,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a268d69e-e6cb-452c-b63b-fcb9ee9b9d98/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:09:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:30,152 INFO L264 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 20:09:30,154 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:09:30,297 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 90 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:09:30,297 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:09:30,506 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 90 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:09:30,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1283578684] [2019-12-07 20:09:30,507 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 20:09:30,507 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:09:30,507 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:09:30,507 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:09:30,507 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:09:30,909 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:09:30,918 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:09:30,926 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:09:31,023 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:09:31,554 WARN L192 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 118 [2019-12-07 20:09:31,789 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-12-07 20:09:32,041 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:09:32,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:09:32,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 41 [2019-12-07 20:09:32,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004417220] [2019-12-07 20:09:32,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-12-07 20:09:32,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:09:32,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-12-07 20:09:32,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=1654, Unknown=0, NotChecked=0, Total=2256 [2019-12-07 20:09:32,043 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 43 states. [2019-12-07 20:09:32,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:09:32,651 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2019-12-07 20:09:32,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 20:09:32,651 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 27 [2019-12-07 20:09:32,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:09:32,652 INFO L225 Difference]: With dead ends: 101 [2019-12-07 20:09:32,652 INFO L226 Difference]: Without dead ends: 101 [2019-12-07 20:09:32,653 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1352 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1163, Invalid=2743, Unknown=0, NotChecked=0, Total=3906 [2019-12-07 20:09:32,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-12-07 20:09:32,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 51. [2019-12-07 20:09:32,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-12-07 20:09:32,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-12-07 20:09:32,656 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 27 [2019-12-07 20:09:32,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:09:32,656 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-12-07 20:09:32,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-12-07 20:09:32,656 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-12-07 20:09:32,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 20:09:32,657 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:09:32,657 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 2, 1, 1, 1, 1, 1] [2019-12-07 20:09:32,858 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:09:32,859 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:09:32,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:09:32,860 INFO L82 PathProgramCache]: Analyzing trace with hash -365594061, now seen corresponding path program 1 times [2019-12-07 20:09:32,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:09:32,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29738986] [2019-12-07 20:09:32,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:09:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:32,880 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 20:09:32,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29738986] [2019-12-07 20:09:32,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:09:32,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:09:32,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166401271] [2019-12-07 20:09:32,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:09:32,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:09:32,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:09:32,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:09:32,881 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 3 states. [2019-12-07 20:09:32,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:09:32,897 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-12-07 20:09:32,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:09:32,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 20:09:32,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:09:32,898 INFO L225 Difference]: With dead ends: 50 [2019-12-07 20:09:32,898 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 20:09:32,898 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 20:09:32,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 20:09:32,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-12-07 20:09:32,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 20:09:32,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-12-07 20:09:32,901 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 27 [2019-12-07 20:09:32,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:09:32,901 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-12-07 20:09:32,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:09:32,902 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-12-07 20:09:32,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 20:09:32,902 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:09:32,902 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 1, 1, 1, 1] [2019-12-07 20:09:32,903 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:09:32,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:09:32,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1551486001, now seen corresponding path program 1 times [2019-12-07 20:09:32,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:09:32,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914034936] [2019-12-07 20:09:32,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:09:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:32,960 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 20:09:32,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914034936] [2019-12-07 20:09:32,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107236599] [2019-12-07 20:09:32,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a268d69e-e6cb-452c-b63b-fcb9ee9b9d98/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:09:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:32,994 INFO L264 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 20:09:32,995 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:09:33,469 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 20:09:33,469 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:09:33,499 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 20:09:33,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2014917050] [2019-12-07 20:09:33,500 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 20:09:33,500 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:09:33,500 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:09:33,500 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:09:33,500 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:09:33,941 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:09:33,952 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:09:33,961 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:09:34,085 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:09:34,218 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2019-12-07 20:09:34,567 WARN L192 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 118 [2019-12-07 20:09:34,776 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-12-07 20:09:35,195 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-12-07 20:09:35,267 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:09:35,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:09:35,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-12-07 20:09:35,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862774666] [2019-12-07 20:09:35,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 20:09:35,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:09:35,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 20:09:35,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-12-07 20:09:35,269 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 12 states. [2019-12-07 20:09:35,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:09:35,567 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-12-07 20:09:35,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 20:09:35,568 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-12-07 20:09:35,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:09:35,568 INFO L225 Difference]: With dead ends: 61 [2019-12-07 20:09:35,568 INFO L226 Difference]: Without dead ends: 61 [2019-12-07 20:09:35,568 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 49 SyntacticMatches, 22 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2019-12-07 20:09:35,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-07 20:09:35,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-12-07 20:09:35,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 20:09:35,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2019-12-07 20:09:35,571 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 28 [2019-12-07 20:09:35,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:09:35,571 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2019-12-07 20:09:35,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 20:09:35,571 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2019-12-07 20:09:35,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 20:09:35,572 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:09:35,572 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 5, 5, 5, 1, 1, 1, 1, 1] [2019-12-07 20:09:35,773 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:09:35,774 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:09:35,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:09:35,774 INFO L82 PathProgramCache]: Analyzing trace with hash 100827730, now seen corresponding path program 1 times [2019-12-07 20:09:35,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:09:35,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626452928] [2019-12-07 20:09:35,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:09:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:35,799 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-12-07 20:09:35,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626452928] [2019-12-07 20:09:35,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:09:35,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:09:35,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283656441] [2019-12-07 20:09:35,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:09:35,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:09:35,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:09:35,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:09:35,800 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 4 states. [2019-12-07 20:09:35,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:09:35,820 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2019-12-07 20:09:35,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:09:35,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-07 20:09:35,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:09:35,821 INFO L225 Difference]: With dead ends: 60 [2019-12-07 20:09:35,821 INFO L226 Difference]: Without dead ends: 60 [2019-12-07 20:09:35,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:09:35,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-12-07 20:09:35,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-12-07 20:09:35,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-07 20:09:35,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-12-07 20:09:35,823 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 40 [2019-12-07 20:09:35,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:09:35,824 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-12-07 20:09:35,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:09:35,824 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-12-07 20:09:35,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 20:09:35,825 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:09:35,825 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 5, 5, 5, 1, 1, 1, 1, 1] [2019-12-07 20:09:35,825 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:09:35,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:09:35,825 INFO L82 PathProgramCache]: Analyzing trace with hash 100827731, now seen corresponding path program 1 times [2019-12-07 20:09:35,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:09:35,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282102501] [2019-12-07 20:09:35,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:09:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:35,893 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 31 proven. 4 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 20:09:35,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282102501] [2019-12-07 20:09:35,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096838295] [2019-12-07 20:09:35,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a268d69e-e6cb-452c-b63b-fcb9ee9b9d98/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:09:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:35,934 INFO L264 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 20:09:35,936 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:09:35,975 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 20:09:35,975 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:09:36,025 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 20:09:36,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1068211837] [2019-12-07 20:09:36,026 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2019-12-07 20:09:36,026 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:09:36,026 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:09:36,027 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:09:36,027 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:09:36,430 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:09:36,456 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:09:36,463 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:09:36,595 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:09:36,772 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-12-07 20:09:37,132 WARN L192 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 118 [2019-12-07 20:09:37,332 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-12-07 20:09:38,009 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2019-12-07 20:09:38,126 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:09:38,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:09:38,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2019-12-07 20:09:38,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477994917] [2019-12-07 20:09:38,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 20:09:38,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:09:38,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 20:09:38,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2019-12-07 20:09:38,128 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 19 states. [2019-12-07 20:09:38,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:09:38,526 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2019-12-07 20:09:38,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 20:09:38,527 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2019-12-07 20:09:38,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:09:38,527 INFO L225 Difference]: With dead ends: 82 [2019-12-07 20:09:38,528 INFO L226 Difference]: Without dead ends: 82 [2019-12-07 20:09:38,528 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 94 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=290, Invalid=1042, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 20:09:38,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-12-07 20:09:38,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 75. [2019-12-07 20:09:38,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-12-07 20:09:38,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2019-12-07 20:09:38,531 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 40 [2019-12-07 20:09:38,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:09:38,531 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2019-12-07 20:09:38,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 20:09:38,531 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2019-12-07 20:09:38,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 20:09:38,532 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:09:38,532 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 6, 6, 5, 1, 1, 1] [2019-12-07 20:09:38,732 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:09:38,733 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:09:38,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:09:38,734 INFO L82 PathProgramCache]: Analyzing trace with hash 100730929, now seen corresponding path program 2 times [2019-12-07 20:09:38,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:09:38,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699621640] [2019-12-07 20:09:38,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:09:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:39,242 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 92 proven. 52 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:09:39,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699621640] [2019-12-07 20:09:39,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212820916] [2019-12-07 20:09:39,242 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a268d69e-e6cb-452c-b63b-fcb9ee9b9d98/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:09:39,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-12-07 20:09:39,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:09:39,273 INFO L264 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 20:09:39,275 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:09:39,534 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 40 [2019-12-07 20:09:40,842 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-12-07 20:09:40,842 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:09:45,141 WARN L192 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 29 [2019-12-07 20:10:05,122 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((v_ULTIMATE.start_getNumbers2_~numbers~0.offset_18 Int)) (or (< |c_~#array~0.offset| v_ULTIMATE.start_getNumbers2_~numbers~0.offset_18) (< 8 (div (+ (* v_ULTIMATE.start_getNumbers2_~numbers~0.offset_18 (- 1)) (- 1)) 4)))) (< 8 (div (+ (* |c_~#numbers2~0.offset| (- 1)) (select |c_#length| |c_~#numbers2~0.base|) (- 4)) 4))) (forall ((v_prenex_14 Int)) (let ((.cse0 (div (+ (* v_prenex_14 (- 1)) (- 1)) 4))) (or (< |c_~#array~0.offset| v_prenex_14) (< 8 .cse0) (< (div |c_~#numbers2~0.offset| (- 4)) (+ .cse0 2)))))) is different from false [2019-12-07 20:10:05,143 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 86 trivial. 49 not checked. [2019-12-07 20:10:05,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [359479541] [2019-12-07 20:10:05,144 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 20:10:05,144 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:10:05,144 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:10:05,144 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:10:05,144 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:10:05,555 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:10:05,583 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:10:05,590 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:10:05,682 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:10:05,842 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2019-12-07 20:10:06,286 WARN L192 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 118 [2019-12-07 20:10:06,540 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-12-07 20:10:07,211 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:10:07,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:10:07,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 4, 5] total 28 [2019-12-07 20:10:07,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752371684] [2019-12-07 20:10:07,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 20:10:07,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:07,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 20:10:07,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=968, Unknown=2, NotChecked=64, Total=1190 [2019-12-07 20:10:07,214 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 30 states. [2019-12-07 20:10:10,292 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-12-07 20:10:10,623 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-12-07 20:10:10,975 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-12-07 20:10:11,417 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-12-07 20:10:12,305 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 52 [2019-12-07 20:10:12,622 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-12-07 20:10:13,333 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-12-07 20:10:13,774 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-12-07 20:10:14,052 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-12-07 20:10:15,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:15,621 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2019-12-07 20:10:15,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-07 20:10:15,622 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 40 [2019-12-07 20:10:15,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:15,623 INFO L225 Difference]: With dead ends: 119 [2019-12-07 20:10:15,623 INFO L226 Difference]: Without dead ends: 119 [2019-12-07 20:10:15,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 65 SyntacticMatches, 40 SemanticMatches, 83 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1769 ImplicationChecksByTransitivity, 34.7s TimeCoverageRelationStatistics Valid=1881, Invalid=5093, Unknown=2, NotChecked=164, Total=7140 [2019-12-07 20:10:15,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-12-07 20:10:15,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-12-07 20:10:15,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-12-07 20:10:15,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2019-12-07 20:10:15,629 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 40 [2019-12-07 20:10:15,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:15,629 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2019-12-07 20:10:15,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 20:10:15,629 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2019-12-07 20:10:15,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 20:10:15,630 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:15,630 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2019-12-07 20:10:15,830 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:10:15,831 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:10:15,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:15,832 INFO L82 PathProgramCache]: Analyzing trace with hash 555846072, now seen corresponding path program 1 times [2019-12-07 20:10:15,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:15,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396387095] [2019-12-07 20:10:15,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:15,875 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 20:10:15,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396387095] [2019-12-07 20:10:15,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:10:15,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:10:15,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688483699] [2019-12-07 20:10:15,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:10:15,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:15,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:10:15,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:10:15,877 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand 3 states. [2019-12-07 20:10:15,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:15,891 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2019-12-07 20:10:15,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:10:15,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-07 20:10:15,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:15,892 INFO L225 Difference]: With dead ends: 118 [2019-12-07 20:10:15,892 INFO L226 Difference]: Without dead ends: 118 [2019-12-07 20:10:15,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 20:10:15,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-12-07 20:10:15,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-12-07 20:10:15,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-12-07 20:10:15,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2019-12-07 20:10:15,895 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 56 [2019-12-07 20:10:15,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:15,895 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2019-12-07 20:10:15,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:10:15,896 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2019-12-07 20:10:15,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 20:10:15,896 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:15,896 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2019-12-07 20:10:15,896 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:10:15,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:15,896 INFO L82 PathProgramCache]: Analyzing trace with hash 555846073, now seen corresponding path program 1 times [2019-12-07 20:10:15,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:15,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049289484] [2019-12-07 20:10:15,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:15,943 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 20:10:15,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049289484] [2019-12-07 20:10:15,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:10:15,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:10:15,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90605834] [2019-12-07 20:10:15,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:10:15,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:15,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:10:15,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:10:15,945 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 4 states. [2019-12-07 20:10:15,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:15,977 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2019-12-07 20:10:15,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:10:15,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-07 20:10:15,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:15,978 INFO L225 Difference]: With dead ends: 119 [2019-12-07 20:10:15,978 INFO L226 Difference]: Without dead ends: 119 [2019-12-07 20:10:15,978 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:10:15,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-12-07 20:10:15,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-12-07 20:10:15,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-12-07 20:10:15,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2019-12-07 20:10:15,980 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 56 [2019-12-07 20:10:15,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:15,980 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2019-12-07 20:10:15,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:10:15,980 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2019-12-07 20:10:15,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 20:10:15,981 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:15,981 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 20:10:15,981 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:10:15,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:15,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1592198464, now seen corresponding path program 1 times [2019-12-07 20:10:15,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:15,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111447345] [2019-12-07 20:10:15,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:16,170 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 137 proven. 10 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 20:10:16,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111447345] [2019-12-07 20:10:16,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723449691] [2019-12-07 20:10:16,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a268d69e-e6cb-452c-b63b-fcb9ee9b9d98/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 20:10:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:16,221 INFO L264 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 20:10:16,224 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:10:16,380 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 135 proven. 12 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 20:10:16,380 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:10:16,601 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 135 proven. 12 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 20:10:16,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [137411475] [2019-12-07 20:10:16,602 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 20:10:16,602 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:10:16,602 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:10:16,602 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:10:16,603 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:10:16,991 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:10:17,000 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:10:17,028 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:10:17,173 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:10:17,218 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:10:17,383 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2019-12-07 20:10:17,830 WARN L192 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 118 [2019-12-07 20:10:18,073 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-12-07 20:10:18,389 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-12-07 20:10:19,795 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-12-07 20:10:19,987 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2019-12-07 20:10:19,988 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:10:19,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:10:19,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 43 [2019-12-07 20:10:19,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409278898] [2019-12-07 20:10:19,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-12-07 20:10:19,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:19,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-12-07 20:10:19,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=727, Invalid=2029, Unknown=0, NotChecked=0, Total=2756 [2019-12-07 20:10:19,990 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand 45 states. [2019-12-07 20:10:20,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:20,510 INFO L93 Difference]: Finished difference Result 153 states and 166 transitions. [2019-12-07 20:10:20,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 20:10:20,510 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 58 [2019-12-07 20:10:20,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:20,511 INFO L225 Difference]: With dead ends: 153 [2019-12-07 20:10:20,511 INFO L226 Difference]: Without dead ends: 153 [2019-12-07 20:10:20,512 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 126 SyntacticMatches, 10 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2176 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1318, Invalid=3238, Unknown=0, NotChecked=0, Total=4556 [2019-12-07 20:10:20,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-12-07 20:10:20,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 119. [2019-12-07 20:10:20,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-12-07 20:10:20,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2019-12-07 20:10:20,515 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 58 [2019-12-07 20:10:20,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:20,515 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2019-12-07 20:10:20,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-12-07 20:10:20,515 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2019-12-07 20:10:20,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 20:10:20,515 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:20,515 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1] [2019-12-07 20:10:20,716 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:10:20,717 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:10:20,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:20,717 INFO L82 PathProgramCache]: Analyzing trace with hash 2113512124, now seen corresponding path program 1 times [2019-12-07 20:10:20,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:20,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056564086] [2019-12-07 20:10:20,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:20,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:20,796 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 20:10:20,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056564086] [2019-12-07 20:10:20,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477802895] [2019-12-07 20:10:20,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a268d69e-e6cb-452c-b63b-fcb9ee9b9d98/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:10:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:20,856 INFO L264 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 20:10:20,858 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:10:21,087 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 40 [2019-12-07 20:10:21,773 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 20:10:21,773 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:10:21,807 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 20:10:21,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1162940984] [2019-12-07 20:10:21,808 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 20:10:21,808 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:10:21,809 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:10:21,809 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:10:21,809 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:10:22,200 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:10:22,209 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:10:22,232 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:10:22,357 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:10:22,417 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:10:22,590 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2019-12-07 20:10:22,972 WARN L192 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 118 [2019-12-07 20:10:23,168 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-12-07 20:10:23,782 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-12-07 20:10:23,985 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2019-12-07 20:10:23,985 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:10:23,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:10:23,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-12-07 20:10:23,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440498722] [2019-12-07 20:10:23,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 20:10:23,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:23,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 20:10:23,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2019-12-07 20:10:23,987 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand 11 states. [2019-12-07 20:10:24,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:24,112 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2019-12-07 20:10:24,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 20:10:24,113 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-07 20:10:24,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:24,113 INFO L225 Difference]: With dead ends: 127 [2019-12-07 20:10:24,113 INFO L226 Difference]: Without dead ends: 127 [2019-12-07 20:10:24,114 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 100 SyntacticMatches, 61 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2019-12-07 20:10:24,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-12-07 20:10:24,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-12-07 20:10:24,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-12-07 20:10:24,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2019-12-07 20:10:24,116 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 59 [2019-12-07 20:10:24,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:24,117 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2019-12-07 20:10:24,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 20:10:24,117 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2019-12-07 20:10:24,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 20:10:24,117 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:24,118 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 5, 5, 4, 1, 1, 1, 1] [2019-12-07 20:10:24,318 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:10:24,319 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:10:24,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:24,320 INFO L82 PathProgramCache]: Analyzing trace with hash -236672007, now seen corresponding path program 2 times [2019-12-07 20:10:24,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:24,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305759791] [2019-12-07 20:10:24,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:24,463 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 20:10:24,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305759791] [2019-12-07 20:10:24,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244532832] [2019-12-07 20:10:24,463 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a268d69e-e6cb-452c-b63b-fcb9ee9b9d98/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:10:24,497 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-12-07 20:10:24,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:10:24,498 INFO L264 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 20:10:24,499 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:10:24,727 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 41 [2019-12-07 20:10:25,777 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-12-07 20:10:25,778 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:10:31,999 WARN L192 SmtUtils]: Spent 6.09 s on a formula simplification that was a NOOP. DAG size: 29 [2019-12-07 20:10:40,250 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-12-07 20:10:40,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [928992992] [2019-12-07 20:10:40,251 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 20:10:40,251 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:10:40,251 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:10:40,251 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:10:40,251 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:10:40,663 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:10:40,671 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:10:40,677 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:10:40,818 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:10:40,865 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:10:41,046 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2019-12-07 20:10:41,468 WARN L192 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 118 [2019-12-07 20:10:41,698 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-12-07 20:10:42,004 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-12-07 20:10:42,910 WARN L192 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-12-07 20:10:43,239 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-12-07 20:10:43,482 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2019-12-07 20:10:43,483 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:10:43,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:10:43,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 15 [2019-12-07 20:10:43,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037632174] [2019-12-07 20:10:43,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 20:10:43,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:43,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 20:10:43,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2019-12-07 20:10:43,484 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand 17 states. [2019-12-07 20:10:44,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:44,206 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2019-12-07 20:10:44,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 20:10:44,207 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 68 [2019-12-07 20:10:44,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:44,207 INFO L225 Difference]: With dead ends: 134 [2019-12-07 20:10:44,207 INFO L226 Difference]: Without dead ends: 134 [2019-12-07 20:10:44,208 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 74 SyntacticMatches, 112 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1193 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=218, Invalid=904, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 20:10:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-12-07 20:10:44,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2019-12-07 20:10:44,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-12-07 20:10:44,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 142 transitions. [2019-12-07 20:10:44,210 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 142 transitions. Word has length 68 [2019-12-07 20:10:44,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:44,211 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 142 transitions. [2019-12-07 20:10:44,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 20:10:44,211 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 142 transitions. [2019-12-07 20:10:44,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-07 20:10:44,211 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:44,211 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2019-12-07 20:10:44,412 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:10:44,413 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:10:44,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:44,414 INFO L82 PathProgramCache]: Analyzing trace with hash -2133526226, now seen corresponding path program 1 times [2019-12-07 20:10:44,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:44,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833741808] [2019-12-07 20:10:44,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:44,480 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2019-12-07 20:10:44,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833741808] [2019-12-07 20:10:44,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:10:44,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:10:44,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006862668] [2019-12-07 20:10:44,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:10:44,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:44,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:10:44,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:10:44,481 INFO L87 Difference]: Start difference. First operand 133 states and 142 transitions. Second operand 4 states. [2019-12-07 20:10:44,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:44,505 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2019-12-07 20:10:44,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:10:44,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-12-07 20:10:44,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:44,506 INFO L225 Difference]: With dead ends: 132 [2019-12-07 20:10:44,506 INFO L226 Difference]: Without dead ends: 132 [2019-12-07 20:10:44,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:10:44,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-12-07 20:10:44,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-12-07 20:10:44,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-12-07 20:10:44,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2019-12-07 20:10:44,508 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 77 [2019-12-07 20:10:44,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:44,509 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2019-12-07 20:10:44,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:10:44,509 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2019-12-07 20:10:44,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-07 20:10:44,509 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:44,509 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2019-12-07 20:10:44,509 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:10:44,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:44,509 INFO L82 PathProgramCache]: Analyzing trace with hash -2133526225, now seen corresponding path program 1 times [2019-12-07 20:10:44,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:44,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226489142] [2019-12-07 20:10:44,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:44,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:44,612 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 64 proven. 6 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 20:10:44,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226489142] [2019-12-07 20:10:44,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811049640] [2019-12-07 20:10:44,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a268d69e-e6cb-452c-b63b-fcb9ee9b9d98/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 20:10:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:44,667 INFO L264 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 20:10:44,668 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:10:44,729 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 20:10:44,729 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:10:44,798 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 20:10:44,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [29617214] [2019-12-07 20:10:44,799 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 20:10:44,799 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:10:44,799 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:10:44,799 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:10:44,799 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:10:45,199 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:10:45,207 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:10:45,214 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:10:45,377 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:10:45,426 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:10:45,630 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-12-07 20:10:46,027 WARN L192 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 118 [2019-12-07 20:10:46,250 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-12-07 20:10:47,083 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-12-07 20:10:47,405 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-12-07 20:10:47,801 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2019-12-07 20:10:48,049 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-12-07 20:10:48,158 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:10:48,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:10:48,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 21 [2019-12-07 20:10:48,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95016658] [2019-12-07 20:10:48,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 20:10:48,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:48,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 20:10:48,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=703, Unknown=0, NotChecked=0, Total=870 [2019-12-07 20:10:48,160 INFO L87 Difference]: Start difference. First operand 132 states and 141 transitions. Second operand 21 states. [2019-12-07 20:10:48,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:48,641 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2019-12-07 20:10:48,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 20:10:48,642 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 77 [2019-12-07 20:10:48,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:48,645 INFO L225 Difference]: With dead ends: 146 [2019-12-07 20:10:48,645 INFO L226 Difference]: Without dead ends: 146 [2019-12-07 20:10:48,647 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 193 SyntacticMatches, 17 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=333, Invalid=1389, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 20:10:48,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-12-07 20:10:48,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2019-12-07 20:10:48,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 20:10:48,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2019-12-07 20:10:48,654 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 77 [2019-12-07 20:10:48,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:48,655 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2019-12-07 20:10:48,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 20:10:48,655 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2019-12-07 20:10:48,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 20:10:48,656 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:48,657 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:10:48,857 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:10:48,858 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:10:48,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:48,859 INFO L82 PathProgramCache]: Analyzing trace with hash -233269146, now seen corresponding path program 1 times [2019-12-07 20:10:48,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:48,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57205197] [2019-12-07 20:10:48,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:48,906 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2019-12-07 20:10:48,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57205197] [2019-12-07 20:10:48,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:10:48,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:10:48,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066992147] [2019-12-07 20:10:48,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:10:48,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:48,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:10:48,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:10:48,907 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand 3 states. [2019-12-07 20:10:48,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:48,919 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2019-12-07 20:10:48,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:10:48,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-12-07 20:10:48,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:48,921 INFO L225 Difference]: With dead ends: 142 [2019-12-07 20:10:48,921 INFO L226 Difference]: Without dead ends: 142 [2019-12-07 20:10:48,921 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 20:10:48,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-12-07 20:10:48,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-12-07 20:10:48,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-12-07 20:10:48,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2019-12-07 20:10:48,924 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 87 [2019-12-07 20:10:48,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:48,925 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2019-12-07 20:10:48,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:10:48,925 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2019-12-07 20:10:48,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 20:10:48,926 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:48,926 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:10:48,926 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:10:48,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:48,926 INFO L82 PathProgramCache]: Analyzing trace with hash -233269145, now seen corresponding path program 1 times [2019-12-07 20:10:48,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:48,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526468549] [2019-12-07 20:10:48,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:49,012 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2019-12-07 20:10:49,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526468549] [2019-12-07 20:10:49,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:10:49,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:10:49,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485977862] [2019-12-07 20:10:49,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:10:49,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:49,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:10:49,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:10:49,013 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand 6 states. [2019-12-07 20:10:49,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:49,060 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2019-12-07 20:10:49,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:10:49,061 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-12-07 20:10:49,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:49,061 INFO L225 Difference]: With dead ends: 141 [2019-12-07 20:10:49,062 INFO L226 Difference]: Without dead ends: 141 [2019-12-07 20:10:49,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:10:49,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-12-07 20:10:49,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-12-07 20:10:49,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 20:10:49,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2019-12-07 20:10:49,064 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 87 [2019-12-07 20:10:49,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:49,064 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2019-12-07 20:10:49,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:10:49,064 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2019-12-07 20:10:49,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 20:10:49,065 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:49,065 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:10:49,065 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:10:49,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:49,065 INFO L82 PathProgramCache]: Analyzing trace with hash -833302344, now seen corresponding path program 1 times [2019-12-07 20:10:49,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:49,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3222067] [2019-12-07 20:10:49,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:49,282 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 127 proven. 20 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 20:10:49,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3222067] [2019-12-07 20:10:49,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891655329] [2019-12-07 20:10:49,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a268d69e-e6cb-452c-b63b-fcb9ee9b9d98/bin/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:10:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:49,339 INFO L264 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 20:10:49,340 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:10:49,530 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 135 proven. 12 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 20:10:49,530 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:10:50,031 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 135 proven. 12 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 20:10:50,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1892051667] [2019-12-07 20:10:50,032 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 20:10:50,032 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:10:50,033 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:10:50,033 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:10:50,033 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:10:50,406 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:10:50,433 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:10:50,439 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:10:50,578 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:10:50,812 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:10:51,034 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-12-07 20:10:51,602 WARN L192 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 118 [2019-12-07 20:10:51,898 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-12-07 20:10:52,368 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-12-07 20:10:53,346 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-12-07 20:10:53,523 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-12-07 20:10:53,880 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2019-12-07 20:10:54,177 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-12-07 20:10:54,388 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-12-07 20:10:54,643 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 89 [2019-12-07 20:10:54,644 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:10:54,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:10:54,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 46 [2019-12-07 20:10:54,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866042498] [2019-12-07 20:10:54,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-12-07 20:10:54,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:54,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-12-07 20:10:54,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=835, Invalid=2587, Unknown=0, NotChecked=0, Total=3422 [2019-12-07 20:10:54,645 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand 48 states. [2019-12-07 20:10:55,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:55,950 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2019-12-07 20:10:55,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 20:10:55,950 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 89 [2019-12-07 20:10:55,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:55,951 INFO L225 Difference]: With dead ends: 160 [2019-12-07 20:10:55,951 INFO L226 Difference]: Without dead ends: 160 [2019-12-07 20:10:55,953 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 216 SyntacticMatches, 10 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2425 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1485, Invalid=4065, Unknown=0, NotChecked=0, Total=5550 [2019-12-07 20:10:55,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-07 20:10:55,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 142. [2019-12-07 20:10:55,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-12-07 20:10:55,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2019-12-07 20:10:55,956 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 89 [2019-12-07 20:10:55,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:55,956 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2019-12-07 20:10:55,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-12-07 20:10:55,956 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2019-12-07 20:10:55,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-07 20:10:55,957 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:55,957 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:10:56,157 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:10:56,158 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:10:56,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:56,158 INFO L82 PathProgramCache]: Analyzing trace with hash 28133344, now seen corresponding path program 1 times [2019-12-07 20:10:56,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:56,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343397494] [2019-12-07 20:10:56,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:56,210 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-12-07 20:10:56,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343397494] [2019-12-07 20:10:56,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:10:56,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:10:56,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925709624] [2019-12-07 20:10:56,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:10:56,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:56,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:10:56,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:10:56,211 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand 4 states. [2019-12-07 20:10:56,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:56,235 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2019-12-07 20:10:56,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:10:56,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-12-07 20:10:56,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:56,236 INFO L225 Difference]: With dead ends: 141 [2019-12-07 20:10:56,236 INFO L226 Difference]: Without dead ends: 141 [2019-12-07 20:10:56,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:10:56,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-12-07 20:10:56,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-12-07 20:10:56,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 20:10:56,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2019-12-07 20:10:56,238 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 93 [2019-12-07 20:10:56,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:56,238 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2019-12-07 20:10:56,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:10:56,238 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2019-12-07 20:10:56,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-07 20:10:56,239 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:56,239 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:10:56,239 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:10:56,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:56,239 INFO L82 PathProgramCache]: Analyzing trace with hash 28133345, now seen corresponding path program 1 times [2019-12-07 20:10:56,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:56,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432848396] [2019-12-07 20:10:56,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:56,297 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked. [2019-12-07 20:10:56,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432848396] [2019-12-07 20:10:56,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:10:56,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:10:56,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040165354] [2019-12-07 20:10:56,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:10:56,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:56,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:10:56,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:10:56,298 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand 4 states. [2019-12-07 20:10:56,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:56,330 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2019-12-07 20:10:56,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:10:56,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-12-07 20:10:56,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:56,331 INFO L225 Difference]: With dead ends: 143 [2019-12-07 20:10:56,331 INFO L226 Difference]: Without dead ends: 143 [2019-12-07 20:10:56,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 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 20:10:56,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-12-07 20:10:56,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-12-07 20:10:56,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 20:10:56,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2019-12-07 20:10:56,333 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 93 [2019-12-07 20:10:56,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:56,333 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2019-12-07 20:10:56,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:10:56,333 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2019-12-07 20:10:56,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 20:10:56,334 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:56,334 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:10:56,334 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:10:56,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:56,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1266366972, now seen corresponding path program 1 times [2019-12-07 20:10:56,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:56,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827749161] [2019-12-07 20:10:56,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:56,418 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked. [2019-12-07 20:10:56,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827749161] [2019-12-07 20:10:56,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:10:56,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:10:56,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513401241] [2019-12-07 20:10:56,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:10:56,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:56,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:10:56,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:10:56,419 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand 6 states. [2019-12-07 20:10:56,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:56,467 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2019-12-07 20:10:56,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:10:56,468 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-07 20:10:56,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:56,468 INFO L225 Difference]: With dead ends: 142 [2019-12-07 20:10:56,468 INFO L226 Difference]: Without dead ends: 142 [2019-12-07 20:10:56,469 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:10:56,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-12-07 20:10:56,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2019-12-07 20:10:56,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 20:10:56,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2019-12-07 20:10:56,471 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 95 [2019-12-07 20:10:56,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:56,471 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2019-12-07 20:10:56,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:10:56,471 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2019-12-07 20:10:56,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 20:10:56,471 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:56,471 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:10:56,472 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:10:56,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:56,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1266368004, now seen corresponding path program 1 times [2019-12-07 20:10:56,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:56,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124099590] [2019-12-07 20:10:56,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:56,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:56,502 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2019-12-07 20:10:56,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124099590] [2019-12-07 20:10:56,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:10:56,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:10:56,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779717483] [2019-12-07 20:10:56,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:10:56,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:56,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:10:56,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:10:56,503 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand 3 states. [2019-12-07 20:10:56,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:56,512 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2019-12-07 20:10:56,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:10:56,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-12-07 20:10:56,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:56,512 INFO L225 Difference]: With dead ends: 140 [2019-12-07 20:10:56,512 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 20:10:56,512 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 20:10:56,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 20:10:56,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 20:10:56,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 20:10:56,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 20:10:56,513 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2019-12-07 20:10:56,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:56,513 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 20:10:56,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:10:56,513 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 20:10:56,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 20:10:56,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:10:56 BoogieIcfgContainer [2019-12-07 20:10:56,517 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:10:56,517 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:10:56,517 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:10:56,517 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:10:56,518 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:09:20" (3/4) ... [2019-12-07 20:10:56,520 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 20:10:56,528 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2019-12-07 20:10:56,528 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-12-07 20:10:56,528 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 20:10:56,528 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 20:10:56,558 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a268d69e-e6cb-452c-b63b-fcb9ee9b9d98/bin/utaipan/witness.graphml [2019-12-07 20:10:56,558 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:10:56,559 INFO L168 Benchmark]: Toolchain (without parser) took 96967.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 943.5 MB in the beginning and 844.3 MB in the end (delta: 99.3 MB). Peak memory consumption was 252.3 MB. Max. memory is 11.5 GB. [2019-12-07 20:10:56,559 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:10:56,560 INFO L168 Benchmark]: CACSL2BoogieTranslator took 196.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -154.0 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-12-07 20:10:56,560 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.01 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:10:56,560 INFO L168 Benchmark]: Boogie Preprocessor took 18.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:10:56,560 INFO L168 Benchmark]: RCFGBuilder took 329.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.0 MB). Peak memory consumption was 38.0 MB. Max. memory is 11.5 GB. [2019-12-07 20:10:56,560 INFO L168 Benchmark]: TraceAbstraction took 96349.95 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 49.3 MB). Free memory was 1.1 GB in the beginning and 853.7 MB in the end (delta: 200.5 MB). Peak memory consumption was 249.8 MB. Max. memory is 11.5 GB. [2019-12-07 20:10:56,561 INFO L168 Benchmark]: Witness Printer took 41.36 ms. Allocated memory is still 1.2 GB. Free memory was 853.7 MB in the beginning and 844.3 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:10:56,562 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 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 196.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -154.0 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.01 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 329.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.0 MB). Peak memory consumption was 38.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 96349.95 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 49.3 MB). Free memory was 1.1 GB in the beginning and 853.7 MB in the end (delta: 200.5 MB). Peak memory consumption was 249.8 MB. Max. memory is 11.5 GB. * Witness Printer took 41.36 ms. Allocated memory is still 1.2 GB. Free memory was 853.7 MB in the beginning and 844.3 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 43]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 47]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 17 error locations. Result: SAFE, OverallTime: 96.3s, OverallIterations: 29, TraceHistogramMax: 10, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 431 SDtfs, 5084 SDslu, 673 SDs, 0 SdLazy, 2774 SolverSat, 495 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1906 GetRequests, 1069 SyntacticMatches, 306 SemanticMatches, 531 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10687 ImplicationChecksByTransitivity, 77.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=22, 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, 29 MinimizatonAttempts, 199 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 48.3s InterpolantComputationTime, 1943 NumberOfCodeBlocks, 1828 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 2437 ConstructedInterpolants, 294 QuantifiedInterpolants, 1857289 SizeOfPredicates, 60 NumberOfNonLiveVariables, 2662 ConjunctsInSsa, 199 ConjunctsInUnsatCore, 59 InterpolantComputations, 17 PerfectInterpolantSequences, 8987/9697 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 450, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 6, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 12, TOOLS_POST_TIME[ms]: 254, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME[ms]: 0, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME[ms]: 0, TOOLS_QUANTIFIERELIM_APPLICATIONS: 12, TOOLS_QUANTIFIERELIM_TIME[ms]: 250, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 139, FLUID_QUERY_TIME[ms]: 1, FLUID_QUERIES: 26, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 2, DOMAIN_JOIN_TIME[ms]: 59, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 2, DOMAIN_WIDEN_TIME[ms]: 114, DOMAIN_ISSUBSETEQ_APPLICATIONS: 3, DOMAIN_ISSUBSETEQ_TIME[ms]: 9, DOMAIN_ISBOTTOM_APPLICATIONS: 6, DOMAIN_ISBOTTOM_TIME[ms]: 9, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 226, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 226, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 3, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME[ms]: 0, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 0, PATH_EXPR_TIME[ms]: 0, REGEX_TO_DAG_TIME[ms]: 0, DAG_COMPRESSION_TIME[ms]: 2, DAG_COMPRESSION_PROCESSED_NODES: 53, DAG_COMPRESSION_RETAINED_NODES: 20, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...