./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_526ad03d-4c7e-449f-8913-9e4bf8b798ad/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_526ad03d-4c7e-449f-8913-9e4bf8b798ad/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_526ad03d-4c7e-449f-8913-9e4bf8b798ad/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_526ad03d-4c7e-449f-8913-9e4bf8b798ad/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_526ad03d-4c7e-449f-8913-9e4bf8b798ad/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_526ad03d-4c7e-449f-8913-9e4bf8b798ad/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 1b5ce1e17bce3e34a2c882b1080bdbc1a62cb801 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 19:35:49,003 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:35:49,004 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:35:49,010 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:35:49,011 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:35:49,011 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:35:49,012 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:35:49,013 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:35:49,013 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:35:49,014 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:35:49,014 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:35:49,014 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:35:49,015 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:35:49,015 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:35:49,016 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:35:49,016 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:35:49,017 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:35:49,018 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:35:49,018 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:35:49,019 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:35:49,020 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:35:49,020 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:35:49,021 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:35:49,021 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:35:49,021 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:35:49,022 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:35:49,022 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:35:49,023 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:35:49,023 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:35:49,024 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:35:49,024 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:35:49,024 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:35:49,024 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:35:49,024 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:35:49,025 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:35:49,025 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:35:49,025 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_526ad03d-4c7e-449f-8913-9e4bf8b798ad/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-12-09 19:35:49,032 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:35:49,032 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:35:49,033 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:35:49,033 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:35:49,033 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:35:49,033 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:35:49,033 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:35:49,033 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 19:35:49,033 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:35:49,033 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:35:49,033 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 19:35:49,033 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 19:35:49,033 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:35:49,034 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:35:49,034 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 19:35:49,034 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:35:49,034 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:35:49,034 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 19:35:49,034 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:35:49,034 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 19:35:49,034 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-12-09 19:35:49,034 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 19:35:49,035 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 19:35:49,035 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:35:49,035 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:35:49,035 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:35:49,035 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:35:49,035 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:35:49,035 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:35:49,035 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:35:49,035 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 19:35:49,035 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 19:35:49,035 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:35:49,036 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 19:35:49,036 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 19:35:49,036 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_526ad03d-4c7e-449f-8913-9e4bf8b798ad/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 -> 1b5ce1e17bce3e34a2c882b1080bdbc1a62cb801 [2018-12-09 19:35:49,053 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:35:49,061 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:35:49,063 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:35:49,064 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:35:49,064 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:35:49,064 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_526ad03d-4c7e-449f-8913-9e4bf8b798ad/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted/NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c [2018-12-09 19:35:49,102 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_526ad03d-4c7e-449f-8913-9e4bf8b798ad/bin-2019/utaipan/data/ce0636b71/e0b4277c8a6e45a19adbdd02224d25f2/FLAG874cc032f [2018-12-09 19:35:49,513 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:35:49,514 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_526ad03d-4c7e-449f-8913-9e4bf8b798ad/sv-benchmarks/c/termination-crafted/NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c [2018-12-09 19:35:49,517 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_526ad03d-4c7e-449f-8913-9e4bf8b798ad/bin-2019/utaipan/data/ce0636b71/e0b4277c8a6e45a19adbdd02224d25f2/FLAG874cc032f [2018-12-09 19:35:49,525 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_526ad03d-4c7e-449f-8913-9e4bf8b798ad/bin-2019/utaipan/data/ce0636b71/e0b4277c8a6e45a19adbdd02224d25f2 [2018-12-09 19:35:49,527 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:35:49,528 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:35:49,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:35:49,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:35:49,531 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:35:49,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:35:49" (1/1) ... [2018-12-09 19:35:49,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@216e4883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:49, skipping insertion in model container [2018-12-09 19:35:49,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:35:49" (1/1) ... [2018-12-09 19:35:49,537 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:35:49,546 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:35:49,627 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:35:49,629 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:35:49,637 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:35:49,645 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:35:49,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:49 WrapperNode [2018-12-09 19:35:49,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:35:49,646 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:35:49,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:35:49,646 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:35:49,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:49" (1/1) ... [2018-12-09 19:35:49,654 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:49" (1/1) ... [2018-12-09 19:35:49,657 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:35:49,657 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:35:49,657 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:35:49,657 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:35:49,663 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:49" (1/1) ... [2018-12-09 19:35:49,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:49" (1/1) ... [2018-12-09 19:35:49,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:49" (1/1) ... [2018-12-09 19:35:49,663 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:49" (1/1) ... [2018-12-09 19:35:49,665 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:49" (1/1) ... [2018-12-09 19:35:49,666 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:49" (1/1) ... [2018-12-09 19:35:49,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:49" (1/1) ... [2018-12-09 19:35:49,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:35:49,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:35:49,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:35:49,668 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:35:49,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_526ad03d-4c7e-449f-8913-9e4bf8b798ad/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-09 19:35:49,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 19:35:49,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 19:35:49,730 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2018-12-09 19:35:49,730 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2018-12-09 19:35:49,730 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2018-12-09 19:35:49,730 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2018-12-09 19:35:49,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:35:49,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:35:49,730 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 19:35:49,730 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 19:35:49,835 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:35:49,835 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 19:35:49,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:35:49 BoogieIcfgContainer [2018-12-09 19:35:49,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:35:49,836 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:35:49,836 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:35:49,838 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:35:49,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:35:49" (1/3) ... [2018-12-09 19:35:49,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b0ffaa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:35:49, skipping insertion in model container [2018-12-09 19:35:49,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:49" (2/3) ... [2018-12-09 19:35:49,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b0ffaa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:35:49, skipping insertion in model container [2018-12-09 19:35:49,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:35:49" (3/3) ... [2018-12-09 19:35:49,840 INFO L112 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c [2018-12-09 19:35:49,846 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:35:49,850 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-12-09 19:35:49,858 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2018-12-09 19:35:49,876 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:35:49,876 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 19:35:49,876 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:35:49,876 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:35:49,876 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:35:49,876 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:35:49,876 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:35:49,876 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:35:49,887 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-12-09 19:35:49,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 19:35:49,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:49,891 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:49,892 INFO L423 AbstractCegarLoop]: === Iteration 1 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 19:35:49,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:49,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1147028286, now seen corresponding path program 1 times [2018-12-09 19:35:49,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:49,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:49,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:49,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:49,926 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:50,000 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-09 19:35:50,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:50,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:35:50,001 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:50,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:35:50,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:35:50,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:35:50,012 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 5 states. [2018-12-09 19:35:50,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:50,060 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-12-09 19:35:50,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:35:50,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-09 19:35:50,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:50,066 INFO L225 Difference]: With dead ends: 49 [2018-12-09 19:35:50,066 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 19:35:50,068 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-09 19:35:50,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 19:35:50,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-09 19:35:50,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 19:35:50,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-12-09 19:35:50,092 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 9 [2018-12-09 19:35:50,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:50,092 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-12-09 19:35:50,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:35:50,092 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-12-09 19:35:50,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 19:35:50,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:50,093 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:50,093 INFO L423 AbstractCegarLoop]: === Iteration 2 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 19:35:50,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:50,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1198138435, now seen corresponding path program 1 times [2018-12-09 19:35:50,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:50,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:50,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:50,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:50,094 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:50,106 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-09 19:35:50,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:50,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 19:35:50,107 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:50,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:35:50,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:35:50,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:35:50,108 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 3 states. [2018-12-09 19:35:50,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:50,117 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-12-09 19:35:50,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:35:50,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 19:35:50,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:50,119 INFO L225 Difference]: With dead ends: 45 [2018-12-09 19:35:50,121 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 19:35:50,122 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-09 19:35:50,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 19:35:50,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-12-09 19:35:50,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 19:35:50,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-12-09 19:35:50,126 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 10 [2018-12-09 19:35:50,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:50,126 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-12-09 19:35:50,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:35:50,126 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-12-09 19:35:50,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 19:35:50,127 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:50,127 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:50,127 INFO L423 AbstractCegarLoop]: === Iteration 3 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 19:35:50,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:50,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1097781535, now seen corresponding path program 1 times [2018-12-09 19:35:50,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:50,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:50,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:50,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:50,128 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:50,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 19:35:50,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:50,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:35:50,154 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:50,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:35:50,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:35:50,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:35:50,155 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 5 states. [2018-12-09 19:35:50,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:50,216 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-12-09 19:35:50,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:35:50,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-09 19:35:50,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:50,217 INFO L225 Difference]: With dead ends: 66 [2018-12-09 19:35:50,218 INFO L226 Difference]: Without dead ends: 65 [2018-12-09 19:35:50,218 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-09 19:35:50,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-09 19:35:50,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2018-12-09 19:35:50,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-09 19:35:50,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2018-12-09 19:35:50,225 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 20 [2018-12-09 19:35:50,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:50,225 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2018-12-09 19:35:50,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:35:50,225 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2018-12-09 19:35:50,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 19:35:50,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:50,226 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:50,226 INFO L423 AbstractCegarLoop]: === Iteration 4 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 19:35:50,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:50,226 INFO L82 PathProgramCache]: Analyzing trace with hash -328510744, now seen corresponding path program 1 times [2018-12-09 19:35:50,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:50,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:50,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:50,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:50,227 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:50,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 19:35:50,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:50,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 19:35:50,243 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:50,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:35:50,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:35:50,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:35:50,244 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand 3 states. [2018-12-09 19:35:50,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:50,251 INFO L93 Difference]: Finished difference Result 62 states and 80 transitions. [2018-12-09 19:35:50,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:35:50,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-09 19:35:50,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:50,252 INFO L225 Difference]: With dead ends: 62 [2018-12-09 19:35:50,252 INFO L226 Difference]: Without dead ends: 61 [2018-12-09 19:35:50,252 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-09 19:35:50,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-09 19:35:50,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2018-12-09 19:35:50,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-09 19:35:50,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2018-12-09 19:35:50,257 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 21 [2018-12-09 19:35:50,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:50,258 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2018-12-09 19:35:50,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:35:50,258 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-12-09 19:35:50,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 19:35:50,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:50,258 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:50,258 INFO L423 AbstractCegarLoop]: === Iteration 5 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 19:35:50,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:50,259 INFO L82 PathProgramCache]: Analyzing trace with hash -271335032, now seen corresponding path program 1 times [2018-12-09 19:35:50,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:50,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:50,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:50,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:50,259 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:50,279 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 19:35:50,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:50,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 19:35:50,280 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:50,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:35:50,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:35:50,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:35:50,280 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 3 states. [2018-12-09 19:35:50,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:50,288 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-12-09 19:35:50,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:35:50,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-09 19:35:50,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:50,289 INFO L225 Difference]: With dead ends: 57 [2018-12-09 19:35:50,289 INFO L226 Difference]: Without dead ends: 56 [2018-12-09 19:35:50,289 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-09 19:35:50,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-09 19:35:50,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-09 19:35:50,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-09 19:35:50,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2018-12-09 19:35:50,293 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 28 [2018-12-09 19:35:50,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:50,293 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2018-12-09 19:35:50,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:35:50,293 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2018-12-09 19:35:50,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 19:35:50,293 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:50,294 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:50,294 INFO L423 AbstractCegarLoop]: === Iteration 6 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 19:35:50,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:50,294 INFO L82 PathProgramCache]: Analyzing trace with hash 178548671, now seen corresponding path program 1 times [2018-12-09 19:35:50,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:50,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:50,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:50,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:50,295 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:50,312 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 19:35:50,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:50,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:35:50,313 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:50,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:35:50,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:35:50,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:35:50,313 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand 4 states. [2018-12-09 19:35:50,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:50,328 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2018-12-09 19:35:50,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:35:50,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-12-09 19:35:50,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:50,329 INFO L225 Difference]: With dead ends: 64 [2018-12-09 19:35:50,329 INFO L226 Difference]: Without dead ends: 63 [2018-12-09 19:35:50,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:35:50,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-09 19:35:50,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-12-09 19:35:50,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-09 19:35:50,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 74 transitions. [2018-12-09 19:35:50,335 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 74 transitions. Word has length 29 [2018-12-09 19:35:50,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:50,335 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 74 transitions. [2018-12-09 19:35:50,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:35:50,335 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2018-12-09 19:35:50,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 19:35:50,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:50,336 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:50,336 INFO L423 AbstractCegarLoop]: === Iteration 7 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 19:35:50,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:50,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1484175368, now seen corresponding path program 1 times [2018-12-09 19:35:50,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:50,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:50,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:50,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:50,338 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:50,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 19:35:50,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:50,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 19:35:50,349 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:50,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:35:50,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:35:50,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:35:50,350 INFO L87 Difference]: Start difference. First operand 61 states and 74 transitions. Second operand 3 states. [2018-12-09 19:35:50,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:50,358 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2018-12-09 19:35:50,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:35:50,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-09 19:35:50,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:50,358 INFO L225 Difference]: With dead ends: 61 [2018-12-09 19:35:50,359 INFO L226 Difference]: Without dead ends: 60 [2018-12-09 19:35:50,359 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-09 19:35:50,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-09 19:35:50,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-09 19:35:50,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-09 19:35:50,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2018-12-09 19:35:50,363 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 28 [2018-12-09 19:35:50,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:50,363 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2018-12-09 19:35:50,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:35:50,363 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-12-09 19:35:50,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 19:35:50,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:50,364 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:50,364 INFO L423 AbstractCegarLoop]: === Iteration 8 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 19:35:50,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:50,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1235203803, now seen corresponding path program 1 times [2018-12-09 19:35:50,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:50,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:50,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:50,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:50,365 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:50,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:50,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 19:35:50,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:50,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:35:50,386 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:50,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:35:50,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:35:50,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:35:50,386 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 4 states. [2018-12-09 19:35:50,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:50,397 INFO L93 Difference]: Finished difference Result 83 states and 110 transitions. [2018-12-09 19:35:50,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:35:50,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-12-09 19:35:50,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:50,398 INFO L225 Difference]: With dead ends: 83 [2018-12-09 19:35:50,398 INFO L226 Difference]: Without dead ends: 82 [2018-12-09 19:35:50,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:35:50,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-09 19:35:50,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 68. [2018-12-09 19:35:50,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-09 19:35:50,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2018-12-09 19:35:50,405 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 29 [2018-12-09 19:35:50,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:50,406 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2018-12-09 19:35:50,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:35:50,406 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2018-12-09 19:35:50,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 19:35:50,407 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:50,407 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:50,407 INFO L423 AbstractCegarLoop]: === Iteration 9 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 19:35:50,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:50,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1924993580, now seen corresponding path program 1 times [2018-12-09 19:35:50,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:50,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:50,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:50,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:50,408 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:50,434 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 19:35:50,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:50,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:35:50,434 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:50,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:35:50,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:35:50,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:35:50,435 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand 5 states. [2018-12-09 19:35:50,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:50,484 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2018-12-09 19:35:50,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:35:50,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-12-09 19:35:50,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:50,485 INFO L225 Difference]: With dead ends: 93 [2018-12-09 19:35:50,485 INFO L226 Difference]: Without dead ends: 92 [2018-12-09 19:35:50,485 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-09 19:35:50,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-09 19:35:50,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2018-12-09 19:35:50,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-09 19:35:50,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 113 transitions. [2018-12-09 19:35:50,491 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 113 transitions. Word has length 33 [2018-12-09 19:35:50,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:50,491 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 113 transitions. [2018-12-09 19:35:50,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:35:50,491 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions. [2018-12-09 19:35:50,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 19:35:50,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:50,492 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:50,492 INFO L423 AbstractCegarLoop]: === Iteration 10 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 19:35:50,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:50,492 INFO L82 PathProgramCache]: Analyzing trace with hash 604021493, now seen corresponding path program 1 times [2018-12-09 19:35:50,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:50,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:50,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:50,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:50,493 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:50,514 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 19:35:50,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:50,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:35:50,515 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:50,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:35:50,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:35:50,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:35:50,515 INFO L87 Difference]: Start difference. First operand 89 states and 113 transitions. Second operand 5 states. [2018-12-09 19:35:50,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:50,564 INFO L93 Difference]: Finished difference Result 92 states and 113 transitions. [2018-12-09 19:35:50,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:35:50,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-12-09 19:35:50,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:50,565 INFO L225 Difference]: With dead ends: 92 [2018-12-09 19:35:50,566 INFO L226 Difference]: Without dead ends: 91 [2018-12-09 19:35:50,566 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-09 19:35:50,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-09 19:35:50,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2018-12-09 19:35:50,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-09 19:35:50,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 112 transitions. [2018-12-09 19:35:50,572 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 112 transitions. Word has length 44 [2018-12-09 19:35:50,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:50,573 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 112 transitions. [2018-12-09 19:35:50,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:35:50,573 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions. [2018-12-09 19:35:50,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 19:35:50,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:50,574 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:50,574 INFO L423 AbstractCegarLoop]: === Iteration 11 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 19:35:50,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:50,574 INFO L82 PathProgramCache]: Analyzing trace with hash -495515594, now seen corresponding path program 1 times [2018-12-09 19:35:50,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:50,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:50,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:50,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:50,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:50,596 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 19:35:50,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:50,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:35:50,597 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:50,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:35:50,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:35:50,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:35:50,598 INFO L87 Difference]: Start difference. First operand 88 states and 112 transitions. Second operand 4 states. [2018-12-09 19:35:50,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:50,610 INFO L93 Difference]: Finished difference Result 98 states and 127 transitions. [2018-12-09 19:35:50,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:35:50,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-12-09 19:35:50,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:50,612 INFO L225 Difference]: With dead ends: 98 [2018-12-09 19:35:50,612 INFO L226 Difference]: Without dead ends: 97 [2018-12-09 19:35:50,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:35:50,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-09 19:35:50,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2018-12-09 19:35:50,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-09 19:35:50,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 118 transitions. [2018-12-09 19:35:50,621 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 118 transitions. Word has length 42 [2018-12-09 19:35:50,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:50,622 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 118 transitions. [2018-12-09 19:35:50,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:35:50,622 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 118 transitions. [2018-12-09 19:35:50,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 19:35:50,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:50,623 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:50,624 INFO L423 AbstractCegarLoop]: === Iteration 12 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 19:35:50,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:50,624 INFO L82 PathProgramCache]: Analyzing trace with hash 465451333, now seen corresponding path program 1 times [2018-12-09 19:35:50,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:50,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:50,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:50,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:50,626 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:50,651 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-09 19:35:50,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:50,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 19:35:50,651 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:50,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:35:50,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:35:50,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:35:50,652 INFO L87 Difference]: Start difference. First operand 94 states and 118 transitions. Second operand 3 states. [2018-12-09 19:35:50,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:50,658 INFO L93 Difference]: Finished difference Result 94 states and 118 transitions. [2018-12-09 19:35:50,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:35:50,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-09 19:35:50,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:50,659 INFO L225 Difference]: With dead ends: 94 [2018-12-09 19:35:50,660 INFO L226 Difference]: Without dead ends: 93 [2018-12-09 19:35:50,660 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-09 19:35:50,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-09 19:35:50,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-09 19:35:50,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-09 19:35:50,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 115 transitions. [2018-12-09 19:35:50,665 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 115 transitions. Word has length 48 [2018-12-09 19:35:50,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:50,665 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 115 transitions. [2018-12-09 19:35:50,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:35:50,665 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2018-12-09 19:35:50,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 19:35:50,666 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:50,667 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:50,667 INFO L423 AbstractCegarLoop]: === Iteration 13 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 19:35:50,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:50,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1523265789, now seen corresponding path program 1 times [2018-12-09 19:35:50,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:50,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:50,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:50,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:50,668 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:50,688 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 19:35:50,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:50,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:35:50,689 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:50,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:35:50,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:35:50,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:35:50,689 INFO L87 Difference]: Start difference. First operand 93 states and 115 transitions. Second operand 5 states. [2018-12-09 19:35:50,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:50,706 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2018-12-09 19:35:50,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:35:50,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-09 19:35:50,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:50,707 INFO L225 Difference]: With dead ends: 93 [2018-12-09 19:35:50,707 INFO L226 Difference]: Without dead ends: 92 [2018-12-09 19:35:50,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:35:50,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-09 19:35:50,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2018-12-09 19:35:50,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-09 19:35:50,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 111 transitions. [2018-12-09 19:35:50,712 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 111 transitions. Word has length 48 [2018-12-09 19:35:50,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:50,712 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 111 transitions. [2018-12-09 19:35:50,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:35:50,713 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 111 transitions. [2018-12-09 19:35:50,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 19:35:50,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:50,714 INFO L402 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:50,714 INFO L423 AbstractCegarLoop]: === Iteration 14 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 19:35:50,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:50,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1633453199, now seen corresponding path program 1 times [2018-12-09 19:35:50,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:50,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:50,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:50,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:50,715 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:50,742 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-12-09 19:35:50,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:50,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:35:50,742 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:50,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:35:50,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:35:50,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:35:50,743 INFO L87 Difference]: Start difference. First operand 89 states and 111 transitions. Second operand 5 states. [2018-12-09 19:35:50,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:50,762 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2018-12-09 19:35:50,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:35:50,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-12-09 19:35:50,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:50,763 INFO L225 Difference]: With dead ends: 89 [2018-12-09 19:35:50,764 INFO L226 Difference]: Without dead ends: 88 [2018-12-09 19:35:50,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09 19:35:50,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-09 19:35:50,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 75. [2018-12-09 19:35:50,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-09 19:35:50,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2018-12-09 19:35:50,768 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 58 [2018-12-09 19:35:50,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:50,769 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2018-12-09 19:35:50,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:35:50,769 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2018-12-09 19:35:50,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 19:35:50,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:50,770 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:50,770 INFO L423 AbstractCegarLoop]: === Iteration 15 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 19:35:50,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:50,771 INFO L82 PathProgramCache]: Analyzing trace with hash -2129870288, now seen corresponding path program 1 times [2018-12-09 19:35:50,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:50,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:50,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:50,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:50,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:50,800 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-12-09 19:35:50,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:35:50,801 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:35:50,802 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 67 with the following transitions: [2018-12-09 19:35:50,803 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [5], [7], [9], [11], [13], [15], [17], [19], [20], [21], [23], [24], [25], [28], [29], [31], [33], [35], [42], [46], [50], [51], [52], [53], [54], [55], [56], [57], [58], [60], [61], [62], [64] [2018-12-09 19:35:50,825 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:35:50,825 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:35:50,911 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 19:35:50,912 INFO L272 AbstractInterpreter]: Visited 20 different actions 55 times. Never merged. Never widened. Performed 103 root evaluator evaluations with a maximum evaluation depth of 3. Performed 103 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2018-12-09 19:35:50,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:50,917 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 19:35:50,951 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 50% of their original sizes. [2018-12-09 19:35:50,951 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 19:35:50,978 INFO L418 sIntCurrentIteration]: We unified 65 AI predicates to 65 [2018-12-09 19:35:50,978 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 19:35:50,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 19:35:50,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-12-09 19:35:50,979 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:50,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:35:50,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:35:50,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:35:50,980 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 7 states. [2018-12-09 19:35:51,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:51,059 INFO L93 Difference]: Finished difference Result 150 states and 183 transitions. [2018-12-09 19:35:51,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:35:51,059 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2018-12-09 19:35:51,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:51,060 INFO L225 Difference]: With dead ends: 150 [2018-12-09 19:35:51,060 INFO L226 Difference]: Without dead ends: 86 [2018-12-09 19:35:51,060 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 67 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:35:51,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-09 19:35:51,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2018-12-09 19:35:51,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-09 19:35:51,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2018-12-09 19:35:51,067 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 66 [2018-12-09 19:35:51,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:51,068 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2018-12-09 19:35:51,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:35:51,068 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2018-12-09 19:35:51,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 19:35:51,069 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:51,070 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:51,070 INFO L423 AbstractCegarLoop]: === Iteration 16 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 19:35:51,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:51,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1339632851, now seen corresponding path program 1 times [2018-12-09 19:35:51,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:51,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:51,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:51,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:51,072 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:51,119 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 27 proven. 13 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-12-09 19:35:51,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:35:51,119 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:35:51,119 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 83 with the following transitions: [2018-12-09 19:35:51,119 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [5], [7], [9], [11], [13], [15], [17], [19], [20], [21], [23], [24], [25], [28], [29], [31], [33], [35], [37], [39], [41], [42], [46], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59], [60], [61], [62], [64] [2018-12-09 19:35:51,121 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:35:51,121 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:35:51,172 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 19:35:51,172 INFO L272 AbstractInterpreter]: Visited 24 different actions 92 times. Merged at 7 different actions 16 times. Never widened. Performed 243 root evaluator evaluations with a maximum evaluation depth of 3. Performed 243 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 2 different actions. Largest state had 6 variables. [2018-12-09 19:35:51,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:51,174 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 19:35:51,205 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 55.56% of their original sizes. [2018-12-09 19:35:51,205 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 19:35:51,239 INFO L418 sIntCurrentIteration]: We unified 81 AI predicates to 81 [2018-12-09 19:35:51,239 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 19:35:51,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 19:35:51,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-12-09 19:35:51,239 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:51,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 19:35:51,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 19:35:51,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:35:51,240 INFO L87 Difference]: Start difference. First operand 83 states and 99 transitions. Second operand 9 states. [2018-12-09 19:35:51,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:51,359 INFO L93 Difference]: Finished difference Result 94 states and 112 transitions. [2018-12-09 19:35:51,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 19:35:51,359 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2018-12-09 19:35:51,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:51,360 INFO L225 Difference]: With dead ends: 94 [2018-12-09 19:35:51,360 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 19:35:51,361 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 86 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-12-09 19:35:51,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 19:35:51,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 19:35:51,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 19:35:51,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 19:35:51,362 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 82 [2018-12-09 19:35:51,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:51,362 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 19:35:51,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 19:35:51,362 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 19:35:51,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 19:35:51,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 19:35:51,500 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-09 19:35:51,500 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 19:35:51,500 INFO L448 ceAbstractionStarter]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2018-12-09 19:35:51,500 INFO L448 ceAbstractionStarter]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2018-12-09 19:35:51,500 INFO L448 ceAbstractionStarter]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-12-09 19:35:51,500 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-12-09 19:35:51,500 INFO L451 ceAbstractionStarter]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2018-12-09 19:35:51,500 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2018-12-09 19:35:51,500 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2018-12-09 19:35:51,500 INFO L444 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: (and (not (= (+ |rec1_#in~i| 1) 0)) (not (= |rec1_#in~i| 0))) [2018-12-09 19:35:51,500 INFO L448 ceAbstractionStarter]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-12-09 19:35:51,501 INFO L448 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2018-12-09 19:35:51,501 INFO L448 ceAbstractionStarter]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-12-09 19:35:51,501 INFO L448 ceAbstractionStarter]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-12-09 19:35:51,501 INFO L448 ceAbstractionStarter]: For program point L14-4(line 14) no Hoare annotation was computed. [2018-12-09 19:35:51,501 INFO L448 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2018-12-09 19:35:51,501 INFO L448 ceAbstractionStarter]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-12-09 19:35:51,501 INFO L444 ceAbstractionStarter]: At program point L14-6(line 14) the Hoare annotation is: (and (not (= (+ |rec1_#in~i| 1) 0)) (not (= |rec1_#in~i| 0))) [2018-12-09 19:35:51,501 INFO L448 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2018-12-09 19:35:51,502 INFO L444 ceAbstractionStarter]: At program point L14-8(line 14) the Hoare annotation is: (and (not (= (+ |rec1_#in~i| 1) 0)) (not (= |rec1_#in~i| 0))) [2018-12-09 19:35:51,502 INFO L448 ceAbstractionStarter]: For program point L14-9(line 14) no Hoare annotation was computed. [2018-12-09 19:35:51,502 INFO L448 ceAbstractionStarter]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-12-09 19:35:51,502 INFO L448 ceAbstractionStarter]: For program point L14-10(line 14) no Hoare annotation was computed. [2018-12-09 19:35:51,502 INFO L448 ceAbstractionStarter]: For program point L14-11(line 14) no Hoare annotation was computed. [2018-12-09 19:35:51,502 INFO L448 ceAbstractionStarter]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-09 19:35:51,502 INFO L448 ceAbstractionStarter]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-09 19:35:51,502 INFO L448 ceAbstractionStarter]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2018-12-09 19:35:51,502 INFO L448 ceAbstractionStarter]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2018-12-09 19:35:51,502 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-12-09 19:35:51,503 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-12-09 19:35:51,503 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2018-12-09 19:35:51,503 INFO L444 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (or (and (<= rec2_~j 2147483647) (<= 1 rec2_~j)) (< 2147483647 |rec2_#in~j|)) [2018-12-09 19:35:51,503 INFO L448 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-12-09 19:35:51,503 INFO L448 ceAbstractionStarter]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-09 19:35:51,503 INFO L444 ceAbstractionStarter]: At program point L20-4(line 20) the Hoare annotation is: (or (and (<= rec2_~j 2147483647) (<= 1 rec2_~j) (or (= |rec2_#t~ret3| 0) (= (+ |rec2_#t~ret3| 1) 0))) (< 2147483647 |rec2_#in~j|)) [2018-12-09 19:35:51,503 INFO L448 ceAbstractionStarter]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-09 19:35:51,503 INFO L448 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2018-12-09 19:35:51,504 INFO L448 ceAbstractionStarter]: For program point L20-6(line 20) no Hoare annotation was computed. [2018-12-09 19:35:51,504 INFO L448 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2018-12-09 19:35:51,504 INFO L451 ceAbstractionStarter]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2018-12-09 19:35:51,504 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 19:35:51,504 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 19:35:51,504 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 19:35:51,504 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 19:35:51,504 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 23 26) the Hoare annotation is: true [2018-12-09 19:35:51,504 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 23 26) no Hoare annotation was computed. [2018-12-09 19:35:51,504 INFO L444 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (<= main_~x~0 2147483647) [2018-12-09 19:35:51,505 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 23 26) no Hoare annotation was computed. [2018-12-09 19:35:51,505 INFO L448 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2018-12-09 19:35:51,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:35:51 BoogieIcfgContainer [2018-12-09 19:35:51,507 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 19:35:51,508 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 19:35:51,508 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 19:35:51,508 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 19:35:51,508 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:35:49" (3/4) ... [2018-12-09 19:35:51,511 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 19:35:51,516 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 19:35:51,516 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2018-12-09 19:35:51,517 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2018-12-09 19:35:51,517 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 19:35:51,521 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-09 19:35:51,521 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-09 19:35:51,521 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 19:35:51,550 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_526ad03d-4c7e-449f-8913-9e4bf8b798ad/bin-2019/utaipan/witness.graphml [2018-12-09 19:35:51,550 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 19:35:51,551 INFO L168 Benchmark]: Toolchain (without parser) took 2023.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 68.2 MB). Free memory was 953.5 MB in the beginning and 734.9 MB in the end (delta: 218.6 MB). Peak memory consumption was 286.8 MB. Max. memory is 11.5 GB. [2018-12-09 19:35:51,551 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:35:51,552 INFO L168 Benchmark]: CACSL2BoogieTranslator took 117.24 ms. Allocated memory is still 1.0 GB. Free memory was 953.5 MB in the beginning and 942.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 19:35:51,552 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.05 ms. Allocated memory is still 1.0 GB. Free memory is still 942.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:35:51,552 INFO L168 Benchmark]: Boogie Preprocessor took 10.16 ms. Allocated memory is still 1.0 GB. Free memory is still 942.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:35:51,552 INFO L168 Benchmark]: RCFGBuilder took 168.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 68.2 MB). Free memory was 942.7 MB in the beginning and 1.0 GB in the end (delta: -103.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2018-12-09 19:35:51,552 INFO L168 Benchmark]: TraceAbstraction took 1671.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 734.9 MB in the end (delta: 311.5 MB). Peak memory consumption was 311.5 MB. Max. memory is 11.5 GB. [2018-12-09 19:35:51,553 INFO L168 Benchmark]: Witness Printer took 42.40 ms. Allocated memory is still 1.1 GB. Free memory is still 734.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:35:51,554 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 117.24 ms. Allocated memory is still 1.0 GB. Free memory was 953.5 MB in the beginning and 942.7 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 11.05 ms. Allocated memory is still 1.0 GB. Free memory is still 942.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.16 ms. Allocated memory is still 1.0 GB. Free memory is still 942.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 168.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 68.2 MB). Free memory was 942.7 MB in the beginning and 1.0 GB in the end (delta: -103.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1671.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 734.9 MB in the end (delta: 311.5 MB). Peak memory consumption was 311.5 MB. Max. memory is 11.5 GB. * Witness Printer took 42.40 ms. Allocated memory is still 1.1 GB. Free memory is still 734.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: 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: 20]: 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: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 49 locations, 10 error locations. SAFE Result, 1.6s OverallTime, 16 OverallIterations, 8 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 657 SDtfs, 208 SDslu, 1300 SDs, 0 SdLazy, 228 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 206 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.9246575342465754 AbsIntWeakeningRatio, 0.541095890410959 AbsIntAvgWeakeningVarsNumRemoved, 0.02054794520547945 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 57 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 99 PreInvPairs, 104 NumberOfFragments, 75 HoareAnnotationTreeSize, 99 FomulaSimplifications, 89 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 121 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 595 NumberOfCodeBlocks, 595 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 579 ConstructedInterpolants, 0 QuantifiedInterpolants, 36141 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 14 PerfectInterpolantSequences, 374/408 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...