./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ec570728-a223-4019-84de-90cdd3fa60c8/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ec570728-a223-4019-84de-90cdd3fa60c8/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ec570728-a223-4019-84de-90cdd3fa60c8/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ec570728-a223-4019-84de-90cdd3fa60c8/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ec570728-a223-4019-84de-90cdd3fa60c8/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ec570728-a223-4019-84de-90cdd3fa60c8/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4c761fb15c9d367876fc9f1553874e9680fa1668 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 11:36:07,782 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:36:07,783 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:36:07,792 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:36:07,792 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:36:07,793 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:36:07,794 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:36:07,795 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:36:07,796 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:36:07,797 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:36:07,798 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:36:07,798 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:36:07,799 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:36:07,799 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:36:07,800 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:36:07,801 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:36:07,802 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:36:07,803 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:36:07,805 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:36:07,806 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:36:07,807 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:36:07,808 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:36:07,810 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:36:07,810 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:36:07,811 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:36:07,811 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:36:07,812 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:36:07,813 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:36:07,814 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:36:07,815 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:36:07,815 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:36:07,815 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:36:07,816 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:36:07,816 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:36:07,816 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:36:07,817 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:36:07,817 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ec570728-a223-4019-84de-90cdd3fa60c8/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-11-10 11:36:07,829 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:36:07,829 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:36:07,830 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 11:36:07,830 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 11:36:07,830 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 11:36:07,830 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 11:36:07,831 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 11:36:07,831 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 11:36:07,831 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 11:36:07,831 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 11:36:07,831 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 11:36:07,832 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:36:07,832 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 11:36:07,832 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:36:07,832 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:36:07,833 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 11:36:07,833 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 11:36:07,833 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 11:36:07,833 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-10 11:36:07,833 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:36:07,833 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 11:36:07,833 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:36:07,834 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:36:07,834 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 11:36:07,834 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 11:36:07,834 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 11:36:07,834 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:36:07,834 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 11:36:07,835 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 11:36:07,835 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 11:36:07,835 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 11:36:07,835 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 11:36:07,835 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 11:36:07,835 INFO L133 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/working_dir_ec570728-a223-4019-84de-90cdd3fa60c8/bin-2019/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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4c761fb15c9d367876fc9f1553874e9680fa1668 [2018-11-10 11:36:07,864 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:36:07,875 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:36:07,879 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:36:07,880 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:36:07,880 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:36:07,881 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ec570728-a223-4019-84de-90cdd3fa60c8/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c [2018-11-10 11:36:07,936 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ec570728-a223-4019-84de-90cdd3fa60c8/bin-2019/utaipan/data/60ef8aba2/a3c57ce2bfae450caa6176fe28a8d83c/FLAG74d70a765 [2018-11-10 11:36:08,282 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:36:08,282 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ec570728-a223-4019-84de-90cdd3fa60c8/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c [2018-11-10 11:36:08,287 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ec570728-a223-4019-84de-90cdd3fa60c8/bin-2019/utaipan/data/60ef8aba2/a3c57ce2bfae450caa6176fe28a8d83c/FLAG74d70a765 [2018-11-10 11:36:08,298 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ec570728-a223-4019-84de-90cdd3fa60c8/bin-2019/utaipan/data/60ef8aba2/a3c57ce2bfae450caa6176fe28a8d83c [2018-11-10 11:36:08,301 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:36:08,302 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:36:08,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:36:08,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:36:08,305 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:36:08,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:36:08" (1/1) ... [2018-11-10 11:36:08,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bb581ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:36:08, skipping insertion in model container [2018-11-10 11:36:08,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:36:08" (1/1) ... [2018-11-10 11:36:08,316 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:36:08,330 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:36:08,451 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:36:08,454 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:36:08,465 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:36:08,477 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:36:08,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:36:08 WrapperNode [2018-11-10 11:36:08,478 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:36:08,478 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:36:08,479 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:36:08,479 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:36:08,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:36:08" (1/1) ... [2018-11-10 11:36:08,489 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:36:08" (1/1) ... [2018-11-10 11:36:08,495 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:36:08,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:36:08,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:36:08,495 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:36:08,504 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:36:08" (1/1) ... [2018-11-10 11:36:08,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:36:08" (1/1) ... [2018-11-10 11:36:08,505 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:36:08" (1/1) ... [2018-11-10 11:36:08,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:36:08" (1/1) ... [2018-11-10 11:36:08,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:36:08" (1/1) ... [2018-11-10 11:36:08,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:36:08" (1/1) ... [2018-11-10 11:36:08,514 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:36:08" (1/1) ... [2018-11-10 11:36:08,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:36:08,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:36:08,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:36:08,516 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:36:08,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:36:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec570728-a223-4019-84de-90cdd3fa60c8/bin-2019/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 [2018-11-10 11:36:08,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 11:36:08,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 11:36:08,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:36:08,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:36:08,604 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 11:36:08,604 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 11:36:08,743 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:36:08,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:36:08 BoogieIcfgContainer [2018-11-10 11:36:08,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:36:08,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 11:36:08,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 11:36:08,748 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 11:36:08,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:36:08" (1/3) ... [2018-11-10 11:36:08,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37cf5084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:36:08, skipping insertion in model container [2018-11-10 11:36:08,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:36:08" (2/3) ... [2018-11-10 11:36:08,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37cf5084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:36:08, skipping insertion in model container [2018-11-10 11:36:08,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:36:08" (3/3) ... [2018-11-10 11:36:08,751 INFO L112 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c [2018-11-10 11:36:08,761 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 11:36:08,767 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-11-10 11:36:08,778 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-11-10 11:36:08,809 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 11:36:08,809 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 11:36:08,810 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 11:36:08,810 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:36:08,810 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:36:08,810 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 11:36:08,810 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:36:08,810 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 11:36:08,828 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-10 11:36:08,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-10 11:36:08,833 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:36:08,834 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:36:08,836 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:36:08,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:36:08,840 INFO L82 PathProgramCache]: Analyzing trace with hash -558530159, now seen corresponding path program 1 times [2018-11-10 11:36:08,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:36:08,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:08,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:36:08,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:08,882 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:36:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:36:08,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:36:08,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:36:08,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:36:08,959 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:36:08,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:36:08,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:36:08,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:36:08,977 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 4 states. [2018-11-10 11:36:09,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:36:09,117 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-11-10 11:36:09,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 11:36:09,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-11-10 11:36:09,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:36:09,127 INFO L225 Difference]: With dead ends: 60 [2018-11-10 11:36:09,127 INFO L226 Difference]: Without dead ends: 42 [2018-11-10 11:36:09,129 INFO L605 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 [2018-11-10 11:36:09,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-10 11:36:09,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 27. [2018-11-10 11:36:09,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-10 11:36:09,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-10 11:36:09,157 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 8 [2018-11-10 11:36:09,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:36:09,157 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-10 11:36:09,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:36:09,157 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-10 11:36:09,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 11:36:09,158 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:36:09,158 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:36:09,159 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:36:09,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:36:09,159 INFO L82 PathProgramCache]: Analyzing trace with hash -134565699, now seen corresponding path program 1 times [2018-11-10 11:36:09,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:36:09,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:09,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:36:09,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:09,161 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:36:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:36:09,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:36:09,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:36:09,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:36:09,205 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:36:09,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:36:09,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:36:09,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:36:09,206 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 4 states. [2018-11-10 11:36:09,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:36:09,322 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-10 11:36:09,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 11:36:09,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-11-10 11:36:09,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:36:09,323 INFO L225 Difference]: With dead ends: 56 [2018-11-10 11:36:09,323 INFO L226 Difference]: Without dead ends: 54 [2018-11-10 11:36:09,324 INFO L605 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 [2018-11-10 11:36:09,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-10 11:36:09,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2018-11-10 11:36:09,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-10 11:36:09,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-11-10 11:36:09,329 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 9 [2018-11-10 11:36:09,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:36:09,329 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-11-10 11:36:09,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:36:09,330 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-10 11:36:09,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 11:36:09,330 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:36:09,330 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:36:09,331 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:36:09,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:36:09,331 INFO L82 PathProgramCache]: Analyzing trace with hash 631324011, now seen corresponding path program 1 times [2018-11-10 11:36:09,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:36:09,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:09,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:36:09,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:09,333 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:36:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:36:09,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:36:09,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:36:09,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:36:09,375 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:36:09,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:36:09,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:36:09,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:36:09,376 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 4 states. [2018-11-10 11:36:09,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:36:09,418 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2018-11-10 11:36:09,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:36:09,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-10 11:36:09,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:36:09,419 INFO L225 Difference]: With dead ends: 70 [2018-11-10 11:36:09,419 INFO L226 Difference]: Without dead ends: 40 [2018-11-10 11:36:09,420 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:36:09,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-10 11:36:09,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2018-11-10 11:36:09,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-10 11:36:09,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-10 11:36:09,425 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 13 [2018-11-10 11:36:09,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:36:09,425 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-10 11:36:09,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:36:09,425 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-10 11:36:09,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 11:36:09,426 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:36:09,426 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:36:09,426 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:36:09,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:36:09,427 INFO L82 PathProgramCache]: Analyzing trace with hash 631324203, now seen corresponding path program 1 times [2018-11-10 11:36:09,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:36:09,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:09,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:36:09,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:09,428 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:36:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:36:09,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:36:09,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:36:09,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:36:09,468 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:36:09,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 11:36:09,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 11:36:09,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:36:09,469 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 5 states. [2018-11-10 11:36:09,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:36:09,549 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-11-10 11:36:09,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:36:09,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-10 11:36:09,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:36:09,550 INFO L225 Difference]: With dead ends: 58 [2018-11-10 11:36:09,551 INFO L226 Difference]: Without dead ends: 57 [2018-11-10 11:36:09,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-10 11:36:09,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-10 11:36:09,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2018-11-10 11:36:09,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-10 11:36:09,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2018-11-10 11:36:09,558 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 13 [2018-11-10 11:36:09,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:36:09,559 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2018-11-10 11:36:09,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 11:36:09,559 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2018-11-10 11:36:09,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 11:36:09,559 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:36:09,560 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:36:09,560 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:36:09,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:36:09,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1903786113, now seen corresponding path program 1 times [2018-11-10 11:36:09,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:36:09,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:09,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:36:09,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:09,562 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:36:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:36:09,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:36:09,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:36:09,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 11:36:09,576 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:36:09,577 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:36:09,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:36:09,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:36:09,577 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand 3 states. [2018-11-10 11:36:09,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:36:09,614 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2018-11-10 11:36:09,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:36:09,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-10 11:36:09,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:36:09,615 INFO L225 Difference]: With dead ends: 50 [2018-11-10 11:36:09,615 INFO L226 Difference]: Without dead ends: 49 [2018-11-10 11:36:09,615 INFO L605 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 [2018-11-10 11:36:09,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-10 11:36:09,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-10 11:36:09,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-10 11:36:09,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2018-11-10 11:36:09,621 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 14 [2018-11-10 11:36:09,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:36:09,621 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2018-11-10 11:36:09,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:36:09,621 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-11-10 11:36:09,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 11:36:09,622 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:36:09,622 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:36:09,622 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:36:09,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:36:09,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1161585095, now seen corresponding path program 1 times [2018-11-10 11:36:09,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:36:09,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:09,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:36:09,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:09,624 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:36:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:36:09,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:36:09,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:36:09,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:36:09,653 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:36:09,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 11:36:09,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 11:36:09,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:36:09,654 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand 5 states. [2018-11-10 11:36:09,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:36:09,775 INFO L93 Difference]: Finished difference Result 102 states and 123 transitions. [2018-11-10 11:36:09,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:36:09,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-10 11:36:09,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:36:09,776 INFO L225 Difference]: With dead ends: 102 [2018-11-10 11:36:09,777 INFO L226 Difference]: Without dead ends: 101 [2018-11-10 11:36:09,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-10 11:36:09,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-10 11:36:09,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 88. [2018-11-10 11:36:09,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-10 11:36:09,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 112 transitions. [2018-11-10 11:36:09,786 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 112 transitions. Word has length 15 [2018-11-10 11:36:09,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:36:09,786 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 112 transitions. [2018-11-10 11:36:09,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 11:36:09,786 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions. [2018-11-10 11:36:09,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 11:36:09,787 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:36:09,787 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:36:09,787 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:36:09,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:36:09,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1161585287, now seen corresponding path program 1 times [2018-11-10 11:36:09,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:36:09,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:09,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:36:09,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:09,789 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:36:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:36:09,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:36:09,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:36:09,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:36:09,814 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:36:09,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:36:09,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:36:09,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:36:09,815 INFO L87 Difference]: Start difference. First operand 88 states and 112 transitions. Second operand 4 states. [2018-11-10 11:36:09,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:36:09,847 INFO L93 Difference]: Finished difference Result 125 states and 156 transitions. [2018-11-10 11:36:09,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:36:09,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-10 11:36:09,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:36:09,849 INFO L225 Difference]: With dead ends: 125 [2018-11-10 11:36:09,849 INFO L226 Difference]: Without dead ends: 61 [2018-11-10 11:36:09,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:36:09,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-10 11:36:09,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2018-11-10 11:36:09,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-10 11:36:09,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-11-10 11:36:09,855 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 15 [2018-11-10 11:36:09,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:36:09,855 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-11-10 11:36:09,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:36:09,855 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-11-10 11:36:09,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 11:36:09,856 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:36:09,856 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:36:09,856 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:36:09,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:36:09,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1649399645, now seen corresponding path program 1 times [2018-11-10 11:36:09,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:36:09,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:09,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:36:09,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:09,858 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:36:09,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:36:09,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:36:09,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:36:09,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 11:36:09,894 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:36:09,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:36:09,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:36:09,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:36:09,895 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 3 states. [2018-11-10 11:36:09,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:36:09,923 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2018-11-10 11:36:09,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:36:09,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-10 11:36:09,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:36:09,924 INFO L225 Difference]: With dead ends: 53 [2018-11-10 11:36:09,924 INFO L226 Difference]: Without dead ends: 52 [2018-11-10 11:36:09,925 INFO L605 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 [2018-11-10 11:36:09,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-10 11:36:09,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-10 11:36:09,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-10 11:36:09,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-11-10 11:36:09,930 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 16 [2018-11-10 11:36:09,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:36:09,930 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-11-10 11:36:09,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:36:09,930 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-11-10 11:36:09,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 11:36:09,931 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:36:09,931 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:36:09,931 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:36:09,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:36:09,932 INFO L82 PathProgramCache]: Analyzing trace with hash -648907892, now seen corresponding path program 1 times [2018-11-10 11:36:09,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:36:09,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:09,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:36:09,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:09,933 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:36:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:36:09,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:36:09,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:36:09,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:36:09,968 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:36:09,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 11:36:09,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 11:36:09,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:36:09,969 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 5 states. [2018-11-10 11:36:10,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:36:10,023 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2018-11-10 11:36:10,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 11:36:10,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-10 11:36:10,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:36:10,024 INFO L225 Difference]: With dead ends: 66 [2018-11-10 11:36:10,024 INFO L226 Difference]: Without dead ends: 30 [2018-11-10 11:36:10,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:36:10,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-10 11:36:10,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-10 11:36:10,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-10 11:36:10,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-10 11:36:10,028 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 17 [2018-11-10 11:36:10,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:36:10,029 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-10 11:36:10,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 11:36:10,029 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-10 11:36:10,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 11:36:10,030 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:36:10,030 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:36:10,030 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:36:10,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:36:10,030 INFO L82 PathProgramCache]: Analyzing trace with hash 230127936, now seen corresponding path program 1 times [2018-11-10 11:36:10,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:36:10,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:10,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:36:10,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:10,032 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:36:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:36:10,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:36:10,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:36:10,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:36:10,062 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:36:10,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 11:36:10,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 11:36:10,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:36:10,063 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 5 states. [2018-11-10 11:36:10,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:36:10,106 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-11-10 11:36:10,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 11:36:10,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-10 11:36:10,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:36:10,107 INFO L225 Difference]: With dead ends: 35 [2018-11-10 11:36:10,107 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 11:36:10,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:36:10,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 11:36:10,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 11:36:10,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 11:36:10,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 11:36:10,108 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-11-10 11:36:10,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:36:10,109 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:36:10,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 11:36:10,109 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 11:36:10,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 11:36:10,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 11:36:10,157 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 11:36:10,157 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 11:36:10,157 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 11:36:10,158 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 11:36:10,158 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 11:36:10,158 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 11:36:10,158 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2018-11-10 11:36:10,158 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 13 27) no Hoare annotation was computed. [2018-11-10 11:36:10,158 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2018-11-10 11:36:10,158 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 23) no Hoare annotation was computed. [2018-11-10 11:36:10,158 INFO L425 ceAbstractionStarter]: For program point L17(lines 17 25) no Hoare annotation was computed. [2018-11-10 11:36:10,158 INFO L425 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2018-11-10 11:36:10,158 INFO L421 ceAbstractionStarter]: At program point L19-2(lines 18 24) the Hoare annotation is: (and (<= main_~x~0 2147483647) (<= main_~y~0 2147483647) (<= 0 main_~y~0) (<= 0 main_~x~0)) [2018-11-10 11:36:10,159 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 17 25) no Hoare annotation was computed. [2018-11-10 11:36:10,159 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 13 27) no Hoare annotation was computed. [2018-11-10 11:36:10,159 INFO L425 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 11:36:10,159 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2018-11-10 11:36:10,159 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 13 27) the Hoare annotation is: true [2018-11-10 11:36:10,159 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2018-11-10 11:36:10,159 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-10 11:36:10,159 INFO L425 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2018-11-10 11:36:10,159 INFO L425 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-11-10 11:36:10,159 INFO L425 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-11-10 11:36:10,160 INFO L425 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2018-11-10 11:36:10,160 INFO L425 ceAbstractionStarter]: For program point L18-1(lines 18 24) no Hoare annotation was computed. [2018-11-10 11:36:10,160 INFO L425 ceAbstractionStarter]: For program point L18-2(line 18) no Hoare annotation was computed. [2018-11-10 11:36:10,160 INFO L425 ceAbstractionStarter]: For program point L18-3(line 18) no Hoare annotation was computed. [2018-11-10 11:36:10,160 INFO L425 ceAbstractionStarter]: For program point L18-5(line 18) no Hoare annotation was computed. [2018-11-10 11:36:10,160 INFO L425 ceAbstractionStarter]: For program point L18-6(line 18) no Hoare annotation was computed. [2018-11-10 11:36:10,160 INFO L425 ceAbstractionStarter]: For program point L18-7(lines 18 24) no Hoare annotation was computed. [2018-11-10 11:36:10,160 INFO L425 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 11:36:10,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 11:36:10 BoogieIcfgContainer [2018-11-10 11:36:10,169 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 11:36:10,170 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:36:10,170 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:36:10,170 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:36:10,170 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:36:08" (3/4) ... [2018-11-10 11:36:10,173 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 11:36:10,178 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 11:36:10,178 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 11:36:10,182 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-10 11:36:10,183 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 11:36:10,183 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 11:36:10,217 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ec570728-a223-4019-84de-90cdd3fa60c8/bin-2019/utaipan/witness.graphml [2018-11-10 11:36:10,217 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:36:10,218 INFO L168 Benchmark]: Toolchain (without parser) took 1916.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 960.3 MB in the beginning and 974.9 MB in the end (delta: -14.6 MB). Peak memory consumption was 128.0 MB. Max. memory is 11.5 GB. [2018-11-10 11:36:10,219 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:36:10,219 INFO L168 Benchmark]: CACSL2BoogieTranslator took 175.98 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.5 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-10 11:36:10,220 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.22 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:36:10,220 INFO L168 Benchmark]: Boogie Preprocessor took 20.27 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:36:10,220 INFO L168 Benchmark]: RCFGBuilder took 228.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -183.5 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2018-11-10 11:36:10,221 INFO L168 Benchmark]: TraceAbstraction took 1424.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 977.6 MB in the end (delta: 152.7 MB). Peak memory consumption was 152.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:36:10,221 INFO L168 Benchmark]: Witness Printer took 47.46 ms. Allocated memory is still 1.2 GB. Free memory was 977.6 MB in the beginning and 974.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:36:10,224 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 175.98 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.5 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.22 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.27 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 228.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -183.5 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1424.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 977.6 MB in the end (delta: 152.7 MB). Peak memory consumption was 152.7 MB. Max. memory is 11.5 GB. * Witness Printer took 47.46 ms. Allocated memory is still 1.2 GB. Free memory was 977.6 MB in the beginning and 974.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((x <= 2147483647 && y <= 2147483647) && 0 <= y) && 0 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 31 locations, 8 error locations. SAFE Result, 1.3s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 142 SDtfs, 250 SDslu, 133 SDs, 0 SdLazy, 352 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 65 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 8 NumberOfFragments, 17 HoareAnnotationTreeSize, 5 FomulaSimplifications, 30 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 51 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 4325 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 5/5 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...