./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops-crafted-1/sumt7.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_53f78d19-9aeb-4095-b920-d30e04087f91/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_53f78d19-9aeb-4095-b920-d30e04087f91/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_53f78d19-9aeb-4095-b920-d30e04087f91/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_53f78d19-9aeb-4095-b920-d30e04087f91/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loops-crafted-1/sumt7.c -s /tmp/vcloud-vcloud-master/worker/run_dir_53f78d19-9aeb-4095-b920-d30e04087f91/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_53f78d19-9aeb-4095-b920-d30e04087f91/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 38325d458ef53aa3f44f6d408761e6717afacc9b .................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:29:18,339 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:29:18,341 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:29:18,351 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:29:18,352 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:29:18,353 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:29:18,354 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:29:18,356 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:29:18,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:29:18,359 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:29:18,360 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:29:18,361 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:29:18,361 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:29:18,365 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:29:18,366 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:29:18,367 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:29:18,368 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:29:18,369 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:29:18,370 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:29:18,372 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:29:18,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:29:18,375 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:29:18,376 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:29:18,377 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:29:18,387 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:29:18,389 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:29:18,389 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:29:18,391 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:29:18,392 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:29:18,393 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:29:18,394 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:29:18,394 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:29:18,395 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:29:18,396 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:29:18,399 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:29:18,399 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:29:18,399 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:29:18,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:29:18,400 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:29:18,403 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:29:18,405 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:29:18,406 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_53f78d19-9aeb-4095-b920-d30e04087f91/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:29:18,424 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:29:18,424 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:29:18,425 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:29:18,426 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:29:18,426 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:29:18,426 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:29:18,426 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:29:18,426 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:29:18,426 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:29:18,427 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:29:18,428 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:29:18,428 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:29:18,428 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:29:18,428 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:29:18,429 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:29:18,429 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:29:18,429 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:29:18,430 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:29:18,430 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:29:18,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:29:18,430 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:29:18,430 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:29:18,430 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:29:18,431 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:29:18,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:29:18,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:29:18,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:29:18,431 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:29:18,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:29:18,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:29:18,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:29:18,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:29:18,433 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:29:18,433 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:29:18,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:29:18,433 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:29:18,433 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:29:18,434 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_53f78d19-9aeb-4095-b920-d30e04087f91/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 ! call(__VERIFIER_error())) ) 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 -> 38325d458ef53aa3f44f6d408761e6717afacc9b [2019-11-26 02:29:18,644 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:29:18,655 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:29:18,658 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:29:18,659 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:29:18,660 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:29:18,660 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_53f78d19-9aeb-4095-b920-d30e04087f91/bin/utaipan/../../sv-benchmarks/c/loops-crafted-1/sumt7.c [2019-11-26 02:29:18,716 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_53f78d19-9aeb-4095-b920-d30e04087f91/bin/utaipan/data/05f28f3b9/94ef682942ae47baa30dfa013ea6b6e2/FLAG90d079be9 [2019-11-26 02:29:19,080 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:29:19,080 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_53f78d19-9aeb-4095-b920-d30e04087f91/sv-benchmarks/c/loops-crafted-1/sumt7.c [2019-11-26 02:29:19,085 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_53f78d19-9aeb-4095-b920-d30e04087f91/bin/utaipan/data/05f28f3b9/94ef682942ae47baa30dfa013ea6b6e2/FLAG90d079be9 [2019-11-26 02:29:19,460 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_53f78d19-9aeb-4095-b920-d30e04087f91/bin/utaipan/data/05f28f3b9/94ef682942ae47baa30dfa013ea6b6e2 [2019-11-26 02:29:19,462 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:29:19,463 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:29:19,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:29:19,465 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:29:19,468 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:29:19,469 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:29:19" (1/1) ... [2019-11-26 02:29:19,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bb358af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:19, skipping insertion in model container [2019-11-26 02:29:19,472 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:29:19" (1/1) ... [2019-11-26 02:29:19,479 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:29:19,495 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:29:19,690 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:29:19,697 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:29:19,794 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:29:19,810 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:29:19,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:19 WrapperNode [2019-11-26 02:29:19,810 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:29:19,811 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:29:19,811 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:29:19,812 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:29:19,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:19" (1/1) ... [2019-11-26 02:29:19,832 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:19" (1/1) ... [2019-11-26 02:29:19,852 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:29:19,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:29:19,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:29:19,853 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:29:19,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:19" (1/1) ... [2019-11-26 02:29:19,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:19" (1/1) ... [2019-11-26 02:29:19,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:19" (1/1) ... [2019-11-26 02:29:19,865 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:19" (1/1) ... [2019-11-26 02:29:19,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:19" (1/1) ... [2019-11-26 02:29:19,872 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:19" (1/1) ... [2019-11-26 02:29:19,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:19" (1/1) ... [2019-11-26 02:29:19,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:29:19,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:29:19,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:29:19,876 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:29:19,882 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53f78d19-9aeb-4095-b920-d30e04087f91/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-11-26 02:29:19,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:29:19,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:29:24,191 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:29:24,192 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:29:24,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:29:24 BoogieIcfgContainer [2019-11-26 02:29:24,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:29:24,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:29:24,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:29:24,197 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:29:24,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:29:19" (1/3) ... [2019-11-26 02:29:24,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea4376 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:29:24, skipping insertion in model container [2019-11-26 02:29:24,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:19" (2/3) ... [2019-11-26 02:29:24,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea4376 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:29:24, skipping insertion in model container [2019-11-26 02:29:24,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:29:24" (3/3) ... [2019-11-26 02:29:24,200 INFO L109 eAbstractionObserver]: Analyzing ICFG sumt7.c [2019-11-26 02:29:24,213 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:29:24,218 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:29:24,229 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:29:24,249 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:29:24,250 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:29:24,250 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:29:24,250 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:29:24,250 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:29:24,250 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:29:24,250 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:29:24,250 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:29:24,262 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-11-26 02:29:24,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-26 02:29:24,267 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:29:24,268 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-26 02:29:24,268 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:29:24,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:29:24,273 INFO L82 PathProgramCache]: Analyzing trace with hash 89870510, now seen corresponding path program 1 times [2019-11-26 02:29:24,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:29:24,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20090849] [2019-11-26 02:29:24,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:29:24,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:24,843 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2019-11-26 02:29:24,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:29:24,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20090849] [2019-11-26 02:29:24,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:29:24,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:29:24,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927716746] [2019-11-26 02:29:24,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:29:24,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:29:24,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:29:24,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:29:24,885 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 4 states. [2019-11-26 02:29:24,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:29:24,980 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2019-11-26 02:29:24,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:29:24,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-11-26 02:29:24,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:29:24,994 INFO L225 Difference]: With dead ends: 18 [2019-11-26 02:29:24,994 INFO L226 Difference]: Without dead ends: 8 [2019-11-26 02:29:24,999 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:29:25,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-11-26 02:29:25,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-11-26 02:29:25,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-26 02:29:25,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-11-26 02:29:25,036 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-11-26 02:29:25,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:29:25,037 INFO L462 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-11-26 02:29:25,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:29:25,037 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-11-26 02:29:25,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-26 02:29:25,038 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:29:25,038 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-11-26 02:29:25,039 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:29:25,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:29:25,039 INFO L82 PathProgramCache]: Analyzing trace with hash 466392648, now seen corresponding path program 1 times [2019-11-26 02:29:25,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:29:25,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752947212] [2019-11-26 02:29:25,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:29:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:25,748 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 24 [2019-11-26 02:29:28,172 WARN L192 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 114 DAG size of output: 45 [2019-11-26 02:29:30,232 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse21 (div c_ULTIMATE.start_main_~l~0 4294967296))) (let ((.cse4 (* 4294967296 .cse21))) (let ((.cse0 (<= (+ .cse4 c_ULTIMATE.start_main_~n~0 4274967296) (+ c_ULTIMATE.start_main_~l~0 (* 4294967296 (div c_ULTIMATE.start_main_~n~0 4294967296)))))) (or .cse0 (let ((.cse3 (+ c_ULTIMATE.start_main_~l~0 1))) (and (let ((.cse59 (* .cse21 (- 4294967296)))) (let ((.cse61 (+ .cse59 c_ULTIMATE.start_main_~l~0))) (let ((.cse2 (div .cse61 6))) (let ((.cse52 (* 6 .cse2))) (let ((.cse46 (= (+ .cse4 .cse52) c_ULTIMATE.start_main_~l~0)) (.cse25 (<= .cse4 c_ULTIMATE.start_main_~l~0)) (.cse90 (* .cse2 (- 6)))) (let ((.cse11 (div (+ .cse59 c_ULTIMATE.start_main_~l~0 .cse90) 4294967296)) (.cse12 (or .cse46 .cse25)) (.cse8 (< c_ULTIMATE.start_main_~l~0 .cse4)) (.cse5 (div (+ .cse59 c_ULTIMATE.start_main_~l~0 .cse90 (- 6)) 4294967296)) (.cse9 (not .cse46)) (.cse66 (div .cse61 3))) (let ((.cse7 (* 2 .cse66)) (.cse1 (and .cse8 (<= (+ .cse5 1) 0) .cse9)) (.cse10 (and (<= (+ .cse11 1) 0) .cse12)) (.cse6 (* 2 .cse2))) (or .cse1 (<= (+ .cse2 1) 0) (and (<= .cse3 (+ .cse4 (* 1431655764 .cse5) .cse6 .cse7)) .cse8 .cse9) .cse10 (and (<= .cse3 (+ .cse4 .cse6 .cse7 (* 1431655764 .cse11))) .cse12) (let ((.cse48 (and .cse8 .cse9)) (.cse26 (<= 1 c_ULTIMATE.start_main_~l~0))) (and (or (let ((.cse15 (div (+ c_ULTIMATE.start_main_~v1~0 c_ULTIMATE.start_main_~v2~0 c_ULTIMATE.start_main_~i~0 c_ULTIMATE.start_main_~v3~0 c_ULTIMATE.start_main_~k~0 c_ULTIMATE.start_main_~v4~0 c_ULTIMATE.start_main_~j~0) 4294967296))) (let ((.cse67 (+ c_ULTIMATE.start_main_~v1~0 c_ULTIMATE.start_main_~i~0 c_ULTIMATE.start_main_~v2~0 c_ULTIMATE.start_main_~v3~0 c_ULTIMATE.start_main_~v4~0 c_ULTIMATE.start_main_~k~0 c_ULTIMATE.start_main_~j~0)) (.cse22 (* 4294967296 .cse15)) (.cse20 (+ .cse15 1))) (let ((.cse13 (div c_ULTIMATE.start_main_~l~0 4)) (.cse14 (or (<= c_ULTIMATE.start_main_~l~0 (+ .cse22 4294967295)) (< .cse21 .cse20))) (.cse18 (<= .cse67 c_ULTIMATE.start_main_~l~0))) (and (or (<= .cse13 0) (<= c_ULTIMATE.start_main_~l~0 1)) (let ((.cse16 (+ c_ULTIMATE.start_main_~l~0 .cse22)) (.cse17 (+ .cse4 c_ULTIMATE.start_main_~v1~0 c_ULTIMATE.start_main_~v2~0 c_ULTIMATE.start_main_~i~0 c_ULTIMATE.start_main_~v3~0 c_ULTIMATE.start_main_~k~0 c_ULTIMATE.start_main_~v4~0 c_ULTIMATE.start_main_~j~0)) (.cse19 (<= .cse20 .cse21))) (or (and .cse14 (or (and (or (and (<= .cse15 0) (<= (+ .cse4 c_ULTIMATE.start_main_~v1~0 c_ULTIMATE.start_main_~v2~0 c_ULTIMATE.start_main_~i~0 c_ULTIMATE.start_main_~v3~0 c_ULTIMATE.start_main_~k~0 c_ULTIMATE.start_main_~v4~0 c_ULTIMATE.start_main_~j~0 1) .cse16) (or (< 0 .cse15) (<= c_ULTIMATE.start_main_~l~0 (+ .cse4 c_ULTIMATE.start_main_~v1~0 c_ULTIMATE.start_main_~i~0 c_ULTIMATE.start_main_~v2~0 c_ULTIMATE.start_main_~v3~0 c_ULTIMATE.start_main_~v4~0 c_ULTIMATE.start_main_~k~0 c_ULTIMATE.start_main_~j~0)))) (< .cse16 .cse17)) (or .cse18 (<= .cse17 .cse16))) .cse19)) (and .cse18 (<= .cse16 .cse17)) .cse19)) (or (let ((.cse23 (* .cse13 (- 4))) (.cse24 (= (* 4 .cse13) c_ULTIMATE.start_main_~l~0))) (and (or (< 0 (div (+ c_ULTIMATE.start_main_~l~0 .cse23) 4294967296)) (and (not .cse24) .cse8)) (or (< 0 (div (+ c_ULTIMATE.start_main_~l~0 .cse23 (- 4)) 4294967296)) .cse25 .cse24))) .cse26 (< 0 .cse13)) .cse14 (let ((.cse51 (div .cse61 5))) (let ((.cse60 (* .cse51 (- 5))) (.cse55 (= (+ .cse4 (* 5 .cse51)) c_ULTIMATE.start_main_~l~0))) (let ((.cse30 (or .cse55 .cse25)) (.cse28 (not .cse55)) (.cse27 (div (+ .cse59 .cse60 c_ULTIMATE.start_main_~l~0 (- 5)) 4294967296)) (.cse29 (div (+ .cse59 .cse60 c_ULTIMATE.start_main_~l~0) 4294967296))) (or (and (<= (+ .cse27 1) 0) .cse28 .cse8) (and (<= (+ .cse29 1) 0) .cse30) .cse0 (let ((.cse57 (* 286331153 .cse21)) (.cse58 (* 2 .cse51))) (let ((.cse56 (+ .cse57 .cse58 (* 1717986918 .cse29))) (.cse54 (+ .cse57 .cse58 (* 1717986918 .cse27))) (.cse53 (+ .cse6 1))) (and (let ((.cse37 (* 11068046445943717888 .cse27)) (.cse31 (+ (* 4008636143 c_ULTIMATE.start_main_~l~0) 286331153)) (.cse32 (* 17216961135748579328 .cse21)) (.cse33 (* 12884901888 .cse51)) (.cse34 (* 11068046445943717888 .cse29)) (.cse36 (* 8589934592 .cse2))) (or (and (let ((.cse35 (* 6148914689804861440 .cse5))) (or (and (<= .cse31 (+ .cse32 .cse33 .cse34 .cse35 .cse36)) .cse30) (and (<= .cse31 (+ .cse32 .cse33 .cse37 .cse35 .cse36)) .cse28 .cse8))) .cse8 .cse9) (and .cse12 (let ((.cse38 (* 6148914689804861440 .cse11))) (or (and .cse28 .cse8 (<= .cse31 (+ .cse32 .cse33 .cse37 .cse36 .cse38))) (and (<= .cse31 (+ .cse32 .cse33 .cse34 .cse36 .cse38)) .cse30)))) .cse1 (let ((.cse49 (+ .cse4 .cse52 2)) (.cse47 (+ .cse4 .cse52 8))) (and (let ((.cse41 (* 38654705670 .cse27)) (.cse39 (* 60129542144 .cse21)) (.cse40 (* 45 .cse51)) (.cse45 (* 38654705670 .cse29)) (.cse42 (* 30 .cse2)) (.cse44 (* 14 c_ULTIMATE.start_main_~l~0))) (or (and .cse12 (let ((.cse43 (* 21474836475 .cse11))) (or (and (<= (+ .cse39 .cse40 .cse41 .cse42 .cse43 14) .cse44) .cse28 .cse8) (and (<= (+ .cse39 .cse40 .cse45 .cse42 .cse43 14) .cse44) .cse30)))) (and (or .cse46 .cse25 (< .cse47 c_ULTIMATE.start_main_~l~0)) (or .cse48 (< .cse49 c_ULTIMATE.start_main_~l~0))) (and (let ((.cse50 (* 21474836475 .cse5))) (or (and (<= (+ .cse39 .cse40 .cse41 .cse50 .cse42 14) .cse44) .cse28 .cse8) (and (<= (+ .cse39 .cse40 .cse45 .cse50 .cse42 14) .cse44) .cse30))) .cse8 .cse9))) (or (and .cse12 (<= c_ULTIMATE.start_main_~l~0 .cse49)) .cse26 (and (<= c_ULTIMATE.start_main_~l~0 .cse47) .cse8 .cse9)))) .cse10 (and (or (< .cse53 .cse54) .cse55 .cse25) (or (and .cse28 .cse8) (< .cse53 .cse56))))) (or (and (<= .cse56 .cse53) .cse30) (<= c_ULTIMATE.start_main_~l~0 (+ .cse21 1)) (and .cse28 .cse8 (<= .cse54 .cse53)))))))))) .cse18 (let ((.cse62 (* 1537228671377473536 .cse21)) (.cse63 (* 2147483648 .cse2)) (.cse64 (* 2147483648 .cse66)) (.cse65 (* 357913941 c_ULTIMATE.start_main_~l~0))) (or (and .cse8 (<= (+ .cse62 (* 1537228671377473536 .cse5) .cse63 .cse64 357913941) .cse65) .cse9) (and .cse12 (<= (+ .cse62 .cse63 .cse64 (* 1537228671377473536 .cse11) 357913941) .cse65)))) (<= c_ULTIMATE.start_main_~l~0 .cse67) (let ((.cse71 (* 3 .cse2)) (.cse70 (* 3 .cse66))) (or (let ((.cse69 (* .cse66 (- 3))) (.cse68 (= (+ .cse4 .cse70) c_ULTIMATE.start_main_~l~0))) (and (or (and (not .cse68) .cse8) (< 0 (div (+ .cse59 c_ULTIMATE.start_main_~l~0 .cse69) 4294967296))) (or (< 0 (div (+ .cse59 c_ULTIMATE.start_main_~l~0 .cse69 (- 3)) 4294967296)) .cse68 .cse25))) (and .cse8 .cse9 (<= (+ .cse4 (* 2147483646 .cse5) .cse71 .cse70 1) c_ULTIMATE.start_main_~l~0)) (and (<= (+ .cse4 .cse71 .cse70 (* 2147483646 .cse11) 1) c_ULTIMATE.start_main_~l~0) .cse12))))))) (<= (+ .cse66 1) 0)) (let ((.cse88 (div .cse61 7))) (let ((.cse72 (= c_ULTIMATE.start_main_~l~0 (+ .cse4 (* 7 .cse88))))) (let ((.cse89 (* .cse88 (- 7))) (.cse79 (not .cse72))) (let ((.cse75 (and .cse8 .cse79)) (.cse73 (div (+ .cse59 c_ULTIMATE.start_main_~l~0 .cse89 (- 7)) 4294967296)) (.cse74 (div (+ .cse59 c_ULTIMATE.start_main_~l~0 .cse89) 4294967296))) (or (and (or .cse72 .cse25 (< 0 .cse73)) (or (< 0 .cse74) .cse75)) (let ((.cse85 (* 715827883 .cse5)) (.cse83 (* 2454267026 .cse74)) (.cse82 (* 3170094909 .cse21)) (.cse86 (* 2454267026 .cse73)) (.cse84 (* 4 .cse88)) (.cse87 (* 715827883 .cse11))) (let ((.cse78 (+ .cse82 .cse86 .cse84 .cse2 .cse87 7)) (.cse77 (+ .cse82 .cse83 .cse84 .cse2 .cse87)) (.cse81 (+ .cse82 .cse86 .cse84 .cse85 .cse2 7)) (.cse80 (+ .cse82 .cse83 .cse84 .cse85 .cse2))) (and (let ((.cse76 (or .cse72 .cse25))) (or (and (or (and .cse76 (<= c_ULTIMATE.start_main_~l~0 .cse77)) (and (<= c_ULTIMATE.start_main_~l~0 .cse78) .cse8 .cse79)) .cse12) (and (or (and (<= c_ULTIMATE.start_main_~l~0 .cse80) .cse76) (and (<= c_ULTIMATE.start_main_~l~0 .cse81) .cse8 .cse79)) .cse8 .cse9) (<= (* 3 c_ULTIMATE.start_main_~l~0) (+ (* 5010795179 .cse21) 3)))) (or (and (or .cse48 (and (or .cse72 .cse25 (< .cse78 c_ULTIMATE.start_main_~l~0)) (or (< .cse77 c_ULTIMATE.start_main_~l~0) .cse75))) (or .cse46 (and (or .cse72 .cse25 (< .cse81 c_ULTIMATE.start_main_~l~0)) (or (< .cse80 c_ULTIMATE.start_main_~l~0) .cse75)) .cse25)) .cse26))))))))))))))))))) (< .cse4 .cse3))))))) is different from false [2019-11-26 02:29:30,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2019-11-26 02:29:30,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752947212] [2019-11-26 02:29:30,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340309927] [2019-11-26 02:29:30,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53f78d19-9aeb-4095-b920-d30e04087f91/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-11-26 02:29:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:30,347 WARN L253 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-26 02:29:30,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:29:30,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:29:30,553 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:29:30,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:30,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:30,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:30,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:30,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:30,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:30,839 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 15 [2019-11-26 02:29:30,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:30,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:30,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:30,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:30,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:30,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:30,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:32,969 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse28 (mod c_ULTIMATE.start_main_~l~0 4294967296))) (let ((.cse36 (mod .cse28 7))) (let ((.cse4 (= 0 .cse36)) (.cse32 (mod (+ c_ULTIMATE.start_main_~l~0 1) 4294967296)) (.cse30 (mod (+ c_ULTIMATE.start_main_~l~0 2) 4294967296))) (let ((.cse6 (= (mod (+ c_ULTIMATE.start_main_~v1~0 c_ULTIMATE.start_main_~v2~0 c_ULTIMATE.start_main_~i~0 c_ULTIMATE.start_main_~v3~0 c_ULTIMATE.start_main_~v4~0 c_ULTIMATE.start_main_~k~0 c_ULTIMATE.start_main_~j~0 2) 4294967296) .cse30)) (.cse7 (not (= (mod (+ c_ULTIMATE.start_main_~v1~0 c_ULTIMATE.start_main_~v2~0 c_ULTIMATE.start_main_~i~0 c_ULTIMATE.start_main_~v3~0 c_ULTIMATE.start_main_~v4~0 c_ULTIMATE.start_main_~k~0 c_ULTIMATE.start_main_~j~0 1) 4294967296) .cse32))) (.cse5 (= 0 (mod (+ .cse36 4294967289) 4294967296))) (.cse1 (not .cse4)) (.cse2 (< .cse28 0)) (.cse0 (= 0 (mod .cse36 4294967296))) (.cse3 (<= 0 .cse28))) (and (or (and (or (not .cse0) (and .cse1 .cse2)) (or .cse3 .cse4 (not .cse5))) .cse6 .cse7) (or (let ((.cse35 (mod .cse28 6))) (let ((.cse33 (= .cse35 0))) (let ((.cse8 (= (mod (+ .cse35 4294967290) 4294967296) 0)) (.cse34 (= 0 (mod .cse35 4294967296))) (.cse9 (not .cse33))) (and (or (and .cse8 .cse9 .cse2) (let ((.cse31 (mod .cse28 5))) (let ((.cse13 (= 0 .cse31))) (let ((.cse17 (not (= .cse32 (mod (+ c_ULTIMATE.start_main_~v1~0 c_ULTIMATE.start_main_~i~0 c_ULTIMATE.start_main_~v2~0 c_ULTIMATE.start_main_~v3~0 c_ULTIMATE.start_main_~v4~0 c_ULTIMATE.start_main_~k~0 c_ULTIMATE.start_main_~j~0 1) 4294967296)))) (.cse10 (= 0 (mod (+ .cse31 4294967291) 4294967296))) (.cse11 (not .cse13)) (.cse12 (= 0 (mod .cse31 4294967296))) (.cse18 (= (mod (+ c_ULTIMATE.start_main_~v1~0 c_ULTIMATE.start_main_~i~0 c_ULTIMATE.start_main_~v2~0 c_ULTIMATE.start_main_~v3~0 c_ULTIMATE.start_main_~v4~0 c_ULTIMATE.start_main_~k~0 c_ULTIMATE.start_main_~j~0 2) 4294967296) .cse30))) (and (or (and .cse10 .cse11 .cse2) (and .cse12 (or .cse3 .cse13)) (let ((.cse29 (mod c_ULTIMATE.start_main_~l~0 4))) (let ((.cse15 (= .cse29 0))) (let ((.cse14 (not .cse15)) (.cse16 (= (mod (+ .cse29 4294967292) 4294967296) 0))) (and (or (and (or (and .cse14 .cse2) .cse14) (or .cse3 .cse15 (not .cse16))) .cse17 .cse18) (or (let ((.cse27 (mod .cse28 3))) (let ((.cse19 (= .cse27 0))) (let ((.cse20 (= (mod .cse27 4294967296) 0)) (.cse22 (not .cse19)) (.cse21 (= (mod (+ .cse27 4294967293) 4294967296) 0))) (and (or (and (or .cse3 .cse19) .cse20) (and .cse21 .cse22 .cse2) (let ((.cse26 (mod c_ULTIMATE.start_main_~l~0 2))) (let ((.cse23 (= .cse26 0))) (let ((.cse24 (not .cse23)) (.cse25 (= 0 (mod (+ .cse26 4294967294) 4294967296)))) (and (or (and (or .cse3 .cse23) .cse23) .cse17 (and .cse2 .cse24 .cse25) .cse18) (or .cse17 (and (or (and .cse2 .cse24) .cse24) (or .cse3 (not .cse25) .cse23)) .cse18)))))) (or .cse17 (and (or (not .cse20) (and .cse22 .cse2)) (or .cse3 (not .cse21) .cse19)) .cse18))))) (and (or .cse3 .cse15) .cse15) (and .cse14 .cse16 .cse2))))))) (or .cse17 (and (or .cse3 (not .cse10) .cse13) (or (and .cse11 .cse2) (not .cse12))) .cse18))))) (and (or .cse3 .cse33) .cse34)) (or (and (or .cse3 .cse33 (not .cse8)) (or (not .cse34) (and .cse9 .cse2))) .cse6 .cse7))))) (and .cse5 .cse1 .cse2) (and .cse0 (or .cse3 .cse4)))))))) is different from true [2019-11-26 02:29:32,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2019-11-26 02:29:32,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1264872711] [2019-11-26 02:29:33,002 INFO L159 IcfgInterpreter]: Started Sifa with 6 locations of interest [2019-11-26 02:29:33,003 INFO L166 IcfgInterpreter]: Building call graph [2019-11-26 02:29:33,021 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-26 02:29:33,040 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-26 02:29:33,040 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-26 02:29:33,221 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 186 [2019-11-26 02:29:40,234 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-26 02:29:40,606 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-11-26 02:29:40,712 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 02:29:40,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-26 02:29:40,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2019-11-26 02:29:40,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252958683] [2019-11-26 02:29:40,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-26 02:29:40,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:29:40,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-26 02:29:40,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=164, Unknown=2, NotChecked=54, Total=272 [2019-11-26 02:29:40,715 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 13 states. [2019-11-26 02:29:41,397 WARN L192 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 29 [2019-11-26 02:29:45,511 WARN L192 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 207 DAG size of output: 46 [2019-11-26 02:29:48,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:29:48,074 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-11-26 02:29:48,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:29:48,074 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-11-26 02:29:48,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:29:48,075 INFO L225 Difference]: With dead ends: 9 [2019-11-26 02:29:48,075 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:29:48,076 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=74, Invalid=238, Unknown=2, NotChecked=66, Total=380 [2019-11-26 02:29:48,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:29:48,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:29:48,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:29:48,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:29:48,077 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2019-11-26 02:29:48,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:29:48,077 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:29:48,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-26 02:29:48,078 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:29:48,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:29:48,280 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:29:48,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:29:48,429 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-11-26 02:29:48,449 INFO L444 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2019-11-26 02:29:48,450 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:29:48,450 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-26 02:29:48,450 INFO L444 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-11-26 02:29:48,450 INFO L440 ceAbstractionStarter]: At program point L4-2(lines 3 34) the Hoare annotation is: (or (and (= (mod (+ ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~j~0 1) 4294967296) (mod (+ ULTIMATE.start_main_~l~0 1) 4294967296)) (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~l~0 0) (<= ~SIZE~0 (+ ULTIMATE.start_main_~l~0 20000001)) (< 0 (+ (div ~SIZE~0 4294967296) 1)) (= ULTIMATE.start_main_~v1~0 0) (= ULTIMATE.start_main_~k~0 0) (<= (+ ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~j~0) 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v3~0 0) (<= (+ (* 4294967296 (div (+ (* ULTIMATE.start_main_~v1~0 (- 1)) ULTIMATE.start_main_~l~0 (* ULTIMATE.start_main_~v2~0 (- 1)) (* ULTIMATE.start_main_~i~0 (- 1)) (* ULTIMATE.start_main_~v3~0 (- 1)) (* ULTIMATE.start_main_~k~0 (- 1)) (* ULTIMATE.start_main_~v4~0 (- 1)) (* ULTIMATE.start_main_~j~0 (- 1)) 4294967295) 4294967296)) ULTIMATE.start_main_~n~0) (+ ULTIMATE.start_main_~l~0 (* 4294967296 (div ULTIMATE.start_main_~n~0 4294967296)) 20000001)) (= ULTIMATE.start_main_~j~0 0))) [2019-11-26 02:29:48,450 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:29:48,451 INFO L444 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-11-26 02:29:48,451 INFO L440 ceAbstractionStarter]: At program point L35(lines 11 36) the Hoare annotation is: (or (let ((.cse0 (+ ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~j~0)) (.cse1 (div ULTIMATE.start_main_~l~0 4294967296))) (and (<= .cse0 ULTIMATE.start_main_~l~0) (<= ULTIMATE.start_main_~l~0 (let ((.cse2 (* .cse1 (- 4294967296)))) (let ((.cse3 (div (+ .cse2 ULTIMATE.start_main_~l~0) 7))) (+ (* 4294967296 .cse1) (* 4294967296 (div (+ .cse2 ULTIMATE.start_main_~l~0 (* .cse3 (- 7))) 4294967296)) (* 7 .cse3))))) (<= ULTIMATE.start_main_~l~0 .cse0) (< 0 (+ .cse1 1)))) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) [2019-11-26 02:29:48,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:29:48 BoogieIcfgContainer [2019-11-26 02:29:48,470 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:29:48,472 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:29:48,477 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:29:48,477 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:29:48,478 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:29:24" (3/4) ... [2019-11-26 02:29:48,480 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:29:48,492 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-11-26 02:29:48,493 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-26 02:29:48,547 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_53f78d19-9aeb-4095-b920-d30e04087f91/bin/utaipan/witness.graphml [2019-11-26 02:29:48,547 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:29:48,549 INFO L168 Benchmark]: Toolchain (without parser) took 29085.32 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 294.1 MB). Free memory was 950.1 MB in the beginning and 870.2 MB in the end (delta: 79.9 MB). Peak memory consumption was 374.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:29:48,549 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:29:48,550 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -156.8 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:29:48,559 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.50 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-11-26 02:29:48,559 INFO L168 Benchmark]: Boogie Preprocessor took 22.18 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-11-26 02:29:48,560 INFO L168 Benchmark]: RCFGBuilder took 4317.66 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: 40.0 MB). Peak memory consumption was 40.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:29:48,561 INFO L168 Benchmark]: TraceAbstraction took 24276.75 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 181.9 MB). Free memory was 1.1 GB in the beginning and 872.2 MB in the end (delta: 194.8 MB). Peak memory consumption was 376.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:29:48,561 INFO L168 Benchmark]: Witness Printer took 76.01 ms. Allocated memory is still 1.3 GB. Free memory was 872.2 MB in the beginning and 870.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:29:48,565 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 346.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -156.8 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.50 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 22.18 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. * RCFGBuilder took 4317.66 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: 40.0 MB). Peak memory consumption was 40.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24276.75 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 181.9 MB). Free memory was 1.1 GB in the beginning and 872.2 MB in the end (delta: 194.8 MB). Peak memory consumption was 376.7 MB. Max. memory is 11.5 GB. * Witness Printer took 76.01 ms. Allocated memory is still 1.3 GB. Free memory was 872.2 MB in the beginning and 870.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((v1 + v2 + i + v3 + k + v4 + j + 1) % 4294967296 == (l + 1) % 4294967296 && 1 == cond) || ((((((((((v4 == 0 && l == 0) && SIZE <= l + 20000001) && 0 < SIZE / 4294967296 + 1) && v1 == 0) && k == 0) && v1 + v2 + i + v3 + k + v4 + j <= 0) && i == 0) && v3 == 0) && 4294967296 * ((v1 * -1 + l + v2 * -1 + i * -1 + v3 * -1 + k * -1 + v4 * -1 + j * -1 + 4294967295) / 4294967296) + n <= l + 4294967296 * (n / 4294967296) + 20000001) && j == 0) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: (((v1 + v2 + i + v3 + k + v4 + j <= l && l <= 4294967296 * (l / 4294967296) + 4294967296 * ((l / 4294967296 * -4294967296 + l + (l / 4294967296 * -4294967296 + l) / 7 * -7) / 4294967296) + 7 * ((l / 4294967296 * -4294967296 + l) / 7)) && l <= v1 + v2 + i + v3 + k + v4 + j) && 0 < l / 4294967296 + 1) || !(0 == cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. Result: SAFE, OverallTime: 24.2s, OverallIterations: 2, TraceHistogramMax: 2, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 10 SDtfs, 11 SDslu, 9 SDs, 0 SdLazy, 33 SolverSat, 7 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 12.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=0, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 7 NumberOfFragments, 179 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 104 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 58952 SizeOfPredicates, 12 NumberOfNonLiveVariables, 43 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...