./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursive/McCarthy91_true-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_12825ee9-5bfa-4118-aa68-bfe88994fcbd/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_12825ee9-5bfa-4118-aa68-bfe88994fcbd/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_12825ee9-5bfa-4118-aa68-bfe88994fcbd/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_12825ee9-5bfa-4118-aa68-bfe88994fcbd/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/McCarthy91_true-unreach-call_true-no-overflow_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_12825ee9-5bfa-4118-aa68-bfe88994fcbd/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_12825ee9-5bfa-4118-aa68-bfe88994fcbd/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 32bit --witnessprinter.graph.data.programhash edcc597a46f9ad79563531282ca675b8b1d7c4bf ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 05:07:47,675 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 05:07:47,676 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 05:07:47,681 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 05:07:47,682 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 05:07:47,682 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 05:07:47,683 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 05:07:47,683 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 05:07:47,684 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 05:07:47,685 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 05:07:47,685 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 05:07:47,685 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 05:07:47,686 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 05:07:47,686 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 05:07:47,687 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 05:07:47,687 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 05:07:47,687 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 05:07:47,688 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 05:07:47,689 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 05:07:47,690 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 05:07:47,690 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 05:07:47,691 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 05:07:47,692 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 05:07:47,692 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 05:07:47,692 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 05:07:47,693 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 05:07:47,693 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 05:07:47,694 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 05:07:47,694 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 05:07:47,695 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 05:07:47,695 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 05:07:47,695 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 05:07:47,695 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 05:07:47,695 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 05:07:47,696 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 05:07:47,696 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 05:07:47,696 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_12825ee9-5bfa-4118-aa68-bfe88994fcbd/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf [2018-12-03 05:07:47,703 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 05:07:47,704 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 05:07:47,704 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 05:07:47,704 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 05:07:47,704 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 05:07:47,704 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 05:07:47,704 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 05:07:47,705 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 05:07:47,705 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 05:07:47,705 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 05:07:47,705 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 05:07:47,705 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 05:07:47,705 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 05:07:47,705 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 05:07:47,705 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 05:07:47,705 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-03 05:07:47,706 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 05:07:47,706 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 05:07:47,706 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 05:07:47,706 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 05:07:47,706 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 05:07:47,706 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 05:07:47,706 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-12-03 05:07:47,706 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 05:07:47,706 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 05:07:47,706 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 05:07:47,706 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 05:07:47,707 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 05:07:47,707 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 05:07:47,707 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 05:07:47,707 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 05:07:47,707 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 05:07:47,707 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 05:07:47,707 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 05:07:47,707 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 05:07:47,707 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 05:07:47,707 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 05:07:47,707 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 05:07:47,707 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_12825ee9-5bfa-4118-aa68-bfe88994fcbd/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> edcc597a46f9ad79563531282ca675b8b1d7c4bf [2018-12-03 05:07:47,725 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 05:07:47,734 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 05:07:47,736 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 05:07:47,738 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 05:07:47,738 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 05:07:47,739 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_12825ee9-5bfa-4118-aa68-bfe88994fcbd/bin-2019/utaipan/../../sv-benchmarks/c/recursive/McCarthy91_true-unreach-call_true-no-overflow_true-termination.c [2018-12-03 05:07:47,785 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_12825ee9-5bfa-4118-aa68-bfe88994fcbd/bin-2019/utaipan/data/4edeb7f25/ff692be5816d4083b5882333845085aa/FLAG246c4a34a [2018-12-03 05:07:48,180 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 05:07:48,180 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_12825ee9-5bfa-4118-aa68-bfe88994fcbd/sv-benchmarks/c/recursive/McCarthy91_true-unreach-call_true-no-overflow_true-termination.c [2018-12-03 05:07:48,184 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_12825ee9-5bfa-4118-aa68-bfe88994fcbd/bin-2019/utaipan/data/4edeb7f25/ff692be5816d4083b5882333845085aa/FLAG246c4a34a [2018-12-03 05:07:48,192 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_12825ee9-5bfa-4118-aa68-bfe88994fcbd/bin-2019/utaipan/data/4edeb7f25/ff692be5816d4083b5882333845085aa [2018-12-03 05:07:48,194 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 05:07:48,194 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 05:07:48,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 05:07:48,195 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 05:07:48,197 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 05:07:48,197 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 05:07:48" (1/1) ... [2018-12-03 05:07:48,199 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba821c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:07:48, skipping insertion in model container [2018-12-03 05:07:48,200 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 05:07:48" (1/1) ... [2018-12-03 05:07:48,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 05:07:48,217 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 05:07:48,299 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 05:07:48,301 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 05:07:48,310 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 05:07:48,317 INFO L195 MainTranslator]: Completed translation [2018-12-03 05:07:48,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:07:48 WrapperNode [2018-12-03 05:07:48,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 05:07:48,318 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 05:07:48,318 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 05:07:48,318 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 05:07:48,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:07:48" (1/1) ... [2018-12-03 05:07:48,328 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:07:48" (1/1) ... [2018-12-03 05:07:48,334 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 05:07:48,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 05:07:48,334 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 05:07:48,334 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 05:07:48,342 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:07:48" (1/1) ... [2018-12-03 05:07:48,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:07:48" (1/1) ... [2018-12-03 05:07:48,342 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:07:48" (1/1) ... [2018-12-03 05:07:48,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:07:48" (1/1) ... [2018-12-03 05:07:48,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:07:48" (1/1) ... [2018-12-03 05:07:48,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:07:48" (1/1) ... [2018-12-03 05:07:48,347 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:07:48" (1/1) ... [2018-12-03 05:07:48,348 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 05:07:48,348 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 05:07:48,348 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 05:07:48,348 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 05:07:48,349 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:07:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_12825ee9-5bfa-4118-aa68-bfe88994fcbd/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-12-03 05:07:48,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 05:07:48,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 05:07:48,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 05:07:48,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 05:07:48,410 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 05:07:48,410 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 05:07:48,410 INFO L130 BoogieDeclarations]: Found specification of procedure f91 [2018-12-03 05:07:48,411 INFO L138 BoogieDeclarations]: Found implementation of procedure f91 [2018-12-03 05:07:48,537 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 05:07:48,537 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 05:07:48,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:07:48 BoogieIcfgContainer [2018-12-03 05:07:48,538 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 05:07:48,538 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 05:07:48,538 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 05:07:48,540 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 05:07:48,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 05:07:48" (1/3) ... [2018-12-03 05:07:48,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a251bea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:07:48, skipping insertion in model container [2018-12-03 05:07:48,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:07:48" (2/3) ... [2018-12-03 05:07:48,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a251bea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:07:48, skipping insertion in model container [2018-12-03 05:07:48,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:07:48" (3/3) ... [2018-12-03 05:07:48,542 INFO L112 eAbstractionObserver]: Analyzing ICFG McCarthy91_true-unreach-call_true-no-overflow_true-termination.c [2018-12-03 05:07:48,548 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 05:07:48,552 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-12-03 05:07:48,562 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-12-03 05:07:48,580 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 05:07:48,581 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 05:07:48,581 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 05:07:48,581 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 05:07:48,581 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 05:07:48,581 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 05:07:48,581 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 05:07:48,581 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 05:07:48,592 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-12-03 05:07:48,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 05:07:48,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:07:48,595 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:07:48,597 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 05:07:48,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:07:48,600 INFO L82 PathProgramCache]: Analyzing trace with hash 28465406, now seen corresponding path program 1 times [2018-12-03 05:07:48,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:07:48,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:07:48,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:07:48,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:07:48,630 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:07:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:07:48,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:07:48,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:07:48,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 05:07:48,694 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:07:48,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 05:07:48,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 05:07:48,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:07:48,705 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 5 states. [2018-12-03 05:07:48,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:07:48,799 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-12-03 05:07:48,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 05:07:48,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-03 05:07:48,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:07:48,807 INFO L225 Difference]: With dead ends: 58 [2018-12-03 05:07:48,807 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 05:07:48,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 05:07:48,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 05:07:48,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2018-12-03 05:07:48,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 05:07:48,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2018-12-03 05:07:48,834 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 9 [2018-12-03 05:07:48,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:07:48,834 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-12-03 05:07:48,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 05:07:48,834 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2018-12-03 05:07:48,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 05:07:48,835 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:07:48,835 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:07:48,835 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 05:07:48,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:07:48,835 INFO L82 PathProgramCache]: Analyzing trace with hash 28465566, now seen corresponding path program 1 times [2018-12-03 05:07:48,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:07:48,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:07:48,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:07:48,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:07:48,836 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:07:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:07:48,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:07:48,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:07:48,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 05:07:48,851 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:07:48,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:07:48,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:07:48,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:07:48,853 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand 3 states. [2018-12-03 05:07:48,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:07:48,870 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2018-12-03 05:07:48,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:07:48,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-03 05:07:48,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:07:48,871 INFO L225 Difference]: With dead ends: 44 [2018-12-03 05:07:48,871 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 05:07:48,872 INFO L631 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-12-03 05:07:48,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 05:07:48,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-12-03 05:07:48,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 05:07:48,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2018-12-03 05:07:48,878 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 9 [2018-12-03 05:07:48,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:07:48,878 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-12-03 05:07:48,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:07:48,878 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2018-12-03 05:07:48,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 05:07:48,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:07:48,879 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:07:48,879 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 05:07:48,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:07:48,879 INFO L82 PathProgramCache]: Analyzing trace with hash 882427654, now seen corresponding path program 1 times [2018-12-03 05:07:48,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:07:48,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:07:48,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:07:48,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:07:48,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:07:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:07:48,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:07:48,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:07:48,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 05:07:48,890 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:07:48,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:07:48,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:07:48,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:07:48,891 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 3 states. [2018-12-03 05:07:48,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:07:48,902 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2018-12-03 05:07:48,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:07:48,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-03 05:07:48,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:07:48,903 INFO L225 Difference]: With dead ends: 43 [2018-12-03 05:07:48,903 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 05:07:48,904 INFO L631 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-12-03 05:07:48,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 05:07:48,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2018-12-03 05:07:48,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 05:07:48,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-12-03 05:07:48,910 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 10 [2018-12-03 05:07:48,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:07:48,910 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-12-03 05:07:48,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:07:48,910 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-12-03 05:07:48,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 05:07:48,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:07:48,910 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:07:48,911 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 05:07:48,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:07:48,911 INFO L82 PathProgramCache]: Analyzing trace with hash 882432619, now seen corresponding path program 1 times [2018-12-03 05:07:48,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:07:48,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:07:48,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:07:48,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:07:48,912 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:07:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:07:48,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:07:48,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:07:48,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 05:07:48,935 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:07:48,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 05:07:48,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 05:07:48,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:07:48,936 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 5 states. [2018-12-03 05:07:48,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:07:48,980 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2018-12-03 05:07:48,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 05:07:48,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-12-03 05:07:48,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:07:48,981 INFO L225 Difference]: With dead ends: 54 [2018-12-03 05:07:48,981 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 05:07:48,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 05:07:48,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 05:07:48,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-12-03 05:07:48,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 05:07:48,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-12-03 05:07:48,987 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 10 [2018-12-03 05:07:48,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:07:48,987 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-12-03 05:07:48,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 05:07:48,987 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-12-03 05:07:48,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 05:07:48,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:07:48,987 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:07:48,987 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 05:07:48,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:07:48,988 INFO L82 PathProgramCache]: Analyzing trace with hash 782712181, now seen corresponding path program 1 times [2018-12-03 05:07:48,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:07:48,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:07:48,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:07:48,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:07:48,988 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:07:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:07:49,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:07:49,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:07:49,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 05:07:49,003 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:07:49,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 05:07:49,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 05:07:49,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:07:49,004 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 5 states. [2018-12-03 05:07:49,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:07:49,048 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2018-12-03 05:07:49,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 05:07:49,048 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-03 05:07:49,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:07:49,049 INFO L225 Difference]: With dead ends: 72 [2018-12-03 05:07:49,049 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 05:07:49,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-12-03 05:07:49,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 05:07:49,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 62. [2018-12-03 05:07:49,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 05:07:49,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2018-12-03 05:07:49,055 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 14 [2018-12-03 05:07:49,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:07:49,055 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2018-12-03 05:07:49,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 05:07:49,055 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2018-12-03 05:07:49,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 05:07:49,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:07:49,056 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:07:49,056 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 05:07:49,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:07:49,056 INFO L82 PathProgramCache]: Analyzing trace with hash 421274749, now seen corresponding path program 1 times [2018-12-03 05:07:49,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:07:49,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:07:49,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:07:49,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:07:49,057 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:07:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:07:49,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:07:49,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:07:49,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:07:49,079 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:07:49,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 05:07:49,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 05:07:49,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:07:49,080 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand 4 states. [2018-12-03 05:07:49,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:07:49,086 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2018-12-03 05:07:49,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 05:07:49,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-12-03 05:07:49,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:07:49,087 INFO L225 Difference]: With dead ends: 62 [2018-12-03 05:07:49,087 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 05:07:49,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-12-03 05:07:49,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 05:07:49,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 05:07:49,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 05:07:49,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2018-12-03 05:07:49,091 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 17 [2018-12-03 05:07:49,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:07:49,091 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2018-12-03 05:07:49,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 05:07:49,091 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-12-03 05:07:49,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 05:07:49,092 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:07:49,092 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:07:49,092 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 05:07:49,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:07:49,093 INFO L82 PathProgramCache]: Analyzing trace with hash -161410308, now seen corresponding path program 1 times [2018-12-03 05:07:49,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:07:49,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:07:49,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:07:49,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:07:49,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:07:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:07:49,116 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 05:07:49,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:07:49,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 05:07:49,116 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:07:49,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 05:07:49,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 05:07:49,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:07:49,117 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 5 states. [2018-12-03 05:07:49,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:07:49,153 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2018-12-03 05:07:49,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 05:07:49,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-03 05:07:49,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:07:49,154 INFO L225 Difference]: With dead ends: 56 [2018-12-03 05:07:49,154 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 05:07:49,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-03 05:07:49,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 05:07:49,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2018-12-03 05:07:49,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 05:07:49,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2018-12-03 05:07:49,159 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 22 [2018-12-03 05:07:49,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:07:49,159 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2018-12-03 05:07:49,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 05:07:49,159 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2018-12-03 05:07:49,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 05:07:49,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:07:49,160 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:07:49,160 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 05:07:49,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:07:49,160 INFO L82 PathProgramCache]: Analyzing trace with hash -708747219, now seen corresponding path program 1 times [2018-12-03 05:07:49,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:07:49,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:07:49,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:07:49,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:07:49,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:07:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:07:49,178 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 05:07:49,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:07:49,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 05:07:49,178 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:07:49,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 05:07:49,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 05:07:49,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:07:49,179 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand 5 states. [2018-12-03 05:07:49,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:07:49,211 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2018-12-03 05:07:49,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 05:07:49,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-03 05:07:49,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:07:49,212 INFO L225 Difference]: With dead ends: 52 [2018-12-03 05:07:49,212 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 05:07:49,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 05:07:49,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 05:07:49,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 05:07:49,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 05:07:49,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 05:07:49,213 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-12-03 05:07:49,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:07:49,213 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 05:07:49,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 05:07:49,213 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 05:07:49,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 05:07:49,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 05:07:49,314 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-03 05:07:49,314 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-03 05:07:49,314 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-03 05:07:49,314 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-03 05:07:49,314 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-03 05:07:49,314 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-03 05:07:49,314 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2018-12-03 05:07:49,315 INFO L448 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-12-03 05:07:49,315 INFO L448 ceAbstractionStarter]: For program point L27-2(line 27) no Hoare annotation was computed. [2018-12-03 05:07:49,315 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 24 32) no Hoare annotation was computed. [2018-12-03 05:07:49,315 INFO L448 ceAbstractionStarter]: For program point L27-3(line 27) no Hoare annotation was computed. [2018-12-03 05:07:49,315 INFO L448 ceAbstractionStarter]: For program point L27-4(line 27) no Hoare annotation was computed. [2018-12-03 05:07:49,315 INFO L448 ceAbstractionStarter]: For program point L27-6(line 27) no Hoare annotation was computed. [2018-12-03 05:07:49,315 INFO L448 ceAbstractionStarter]: For program point L27-7(lines 27 31) no Hoare annotation was computed. [2018-12-03 05:07:49,315 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 24 32) no Hoare annotation was computed. [2018-12-03 05:07:49,315 INFO L448 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-12-03 05:07:49,315 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 24 32) the Hoare annotation is: true [2018-12-03 05:07:49,315 INFO L444 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (and (<= main_~x~0 2147483647) (<= 0 (+ main_~x~0 2147483648))) [2018-12-03 05:07:49,315 INFO L448 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-12-03 05:07:49,315 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2018-12-03 05:07:49,315 INFO L448 ceAbstractionStarter]: For program point f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 17) no Hoare annotation was computed. [2018-12-03 05:07:49,316 INFO L448 ceAbstractionStarter]: For program point f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2018-12-03 05:07:49,316 INFO L448 ceAbstractionStarter]: For program point f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 17) no Hoare annotation was computed. [2018-12-03 05:07:49,316 INFO L448 ceAbstractionStarter]: For program point f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2018-12-03 05:07:49,316 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-12-03 05:07:49,316 INFO L448 ceAbstractionStarter]: For program point f91EXIT(lines 15 21) no Hoare annotation was computed. [2018-12-03 05:07:49,316 INFO L448 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. [2018-12-03 05:07:49,316 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-12-03 05:07:49,316 INFO L444 ceAbstractionStarter]: At program point L19-2(line 19) the Hoare annotation is: (or (< (+ |f91_#in~x| 2147483648) 0) (and (<= f91_~x 100) (<= 0 (+ f91_~x 2147483648))) (< 2147483647 |f91_#in~x|)) [2018-12-03 05:07:49,316 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2018-12-03 05:07:49,316 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. [2018-12-03 05:07:49,316 INFO L448 ceAbstractionStarter]: For program point L19-3(line 19) no Hoare annotation was computed. [2018-12-03 05:07:49,316 INFO L444 ceAbstractionStarter]: At program point L19-4(line 19) the Hoare annotation is: (or (< (+ |f91_#in~x| 2147483648) 0) (< 2147483647 |f91_#in~x|) (and (<= |f91_#t~ret0| 2147483647) (<= 0 (+ |f91_#t~ret0| 2147483648)) (<= f91_~x 100) (<= 0 (+ f91_~x 2147483648)))) [2018-12-03 05:07:49,316 INFO L448 ceAbstractionStarter]: For program point L19-5(line 19) no Hoare annotation was computed. [2018-12-03 05:07:49,317 INFO L451 ceAbstractionStarter]: At program point f91ENTRY(lines 15 21) the Hoare annotation is: true [2018-12-03 05:07:49,317 INFO L448 ceAbstractionStarter]: For program point f91FINAL(lines 15 21) no Hoare annotation was computed. [2018-12-03 05:07:49,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 05:07:49 BoogieIcfgContainer [2018-12-03 05:07:49,318 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 05:07:49,319 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 05:07:49,319 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 05:07:49,319 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 05:07:49,319 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:07:48" (3/4) ... [2018-12-03 05:07:49,321 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-03 05:07:49,325 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-03 05:07:49,325 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-03 05:07:49,326 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f91 [2018-12-03 05:07:49,328 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-03 05:07:49,328 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-03 05:07:49,328 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-03 05:07:49,355 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_12825ee9-5bfa-4118-aa68-bfe88994fcbd/bin-2019/utaipan/witness.graphml [2018-12-03 05:07:49,355 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 05:07:49,356 INFO L168 Benchmark]: Toolchain (without parser) took 1161.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 956.7 MB in the beginning and 955.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 107.1 MB. Max. memory is 11.5 GB. [2018-12-03 05:07:49,357 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 05:07:49,357 INFO L168 Benchmark]: CACSL2BoogieTranslator took 122.64 ms. Allocated memory is still 1.0 GB. Free memory was 956.7 MB in the beginning and 945.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-03 05:07:49,357 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.73 ms. Allocated memory is still 1.0 GB. Free memory is still 945.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 05:07:49,357 INFO L168 Benchmark]: Boogie Preprocessor took 14.10 ms. Allocated memory is still 1.0 GB. Free memory is still 945.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 05:07:49,357 INFO L168 Benchmark]: RCFGBuilder took 189.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -138.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-12-03 05:07:49,358 INFO L168 Benchmark]: TraceAbstraction took 780.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 955.0 MB in the end (delta: 129.7 MB). Peak memory consumption was 129.7 MB. Max. memory is 11.5 GB. [2018-12-03 05:07:49,358 INFO L168 Benchmark]: Witness Printer took 36.74 ms. Allocated memory is still 1.1 GB. Free memory is still 955.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 05:07:49,359 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 122.64 ms. Allocated memory is still 1.0 GB. Free memory was 956.7 MB in the beginning and 945.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.73 ms. Allocated memory is still 1.0 GB. Free memory is still 945.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.10 ms. Allocated memory is still 1.0 GB. Free memory is still 945.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 189.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -138.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 780.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 955.0 MB in the end (delta: 129.7 MB). Peak memory consumption was 129.7 MB. Max. memory is 11.5 GB. * Witness Printer took 36.74 ms. Allocated memory is still 1.1 GB. Free memory is still 955.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 36 locations, 6 error locations. SAFE Result, 0.7s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 207 SDtfs, 140 SDslu, 305 SDs, 0 SdLazy, 235 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=5, 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, 8 MinimizatonAttempts, 30 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 32 PreInvPairs, 32 NumberOfFragments, 62 HoareAnnotationTreeSize, 32 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 94 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 114 NumberOfCodeBlocks, 114 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 106 ConstructedInterpolants, 0 QuantifiedInterpolants, 2844 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 17/17 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...