./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1d_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_f07add46-de11-4cb9-9b67-1b323e877316/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f07add46-de11-4cb9-9b67-1b323e877316/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f07add46-de11-4cb9-9b67-1b323e877316/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f07add46-de11-4cb9-9b67-1b323e877316/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f07add46-de11-4cb9-9b67-1b323e877316/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f07add46-de11-4cb9-9b67-1b323e877316/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 0837a1e1d82be1b28ccf3514392f1b01c88a9160 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 03:41:28,544 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 03:41:28,545 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 03:41:28,551 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 03:41:28,551 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 03:41:28,552 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 03:41:28,552 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 03:41:28,553 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 03:41:28,554 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 03:41:28,555 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 03:41:28,556 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 03:41:28,556 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 03:41:28,556 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 03:41:28,557 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 03:41:28,557 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 03:41:28,558 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 03:41:28,558 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 03:41:28,559 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 03:41:28,560 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 03:41:28,561 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 03:41:28,562 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 03:41:28,562 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 03:41:28,563 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 03:41:28,564 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 03:41:28,564 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 03:41:28,564 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 03:41:28,565 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 03:41:28,565 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 03:41:28,566 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 03:41:28,566 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 03:41:28,567 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 03:41:28,567 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 03:41:28,567 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 03:41:28,567 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 03:41:28,568 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 03:41:28,568 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 03:41:28,569 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f07add46-de11-4cb9-9b67-1b323e877316/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-12-03 03:41:28,576 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 03:41:28,576 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 03:41:28,577 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 03:41:28,577 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 03:41:28,577 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 03:41:28,577 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 03:41:28,577 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 03:41:28,577 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 03:41:28,577 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 03:41:28,577 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 03:41:28,578 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 03:41:28,578 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 03:41:28,578 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 03:41:28,578 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 03:41:28,578 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-03 03:41:28,578 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 03:41:28,579 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 03:41:28,579 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 03:41:28,579 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 03:41:28,579 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 03:41:28,579 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-12-03 03:41:28,579 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 03:41:28,579 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 03:41:28,579 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 03:41:28,580 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 03:41:28,580 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 03:41:28,580 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 03:41:28,580 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 03:41:28,580 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 03:41:28,580 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 03:41:28,580 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 03:41:28,580 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 03:41:28,581 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 03:41:28,581 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 03:41:28,581 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 03:41:28,581 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_f07add46-de11-4cb9-9b67-1b323e877316/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 -> 0837a1e1d82be1b28ccf3514392f1b01c88a9160 [2018-12-03 03:41:28,598 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 03:41:28,605 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 03:41:28,607 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 03:41:28,608 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 03:41:28,608 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 03:41:28,609 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f07add46-de11-4cb9-9b67-1b323e877316/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted/NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c [2018-12-03 03:41:28,647 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f07add46-de11-4cb9-9b67-1b323e877316/bin-2019/utaipan/data/494a3e746/9f333484073246e095ce51fc83f61cd8/FLAGf47f520ad [2018-12-03 03:41:29,070 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 03:41:29,070 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f07add46-de11-4cb9-9b67-1b323e877316/sv-benchmarks/c/termination-crafted/NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c [2018-12-03 03:41:29,074 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f07add46-de11-4cb9-9b67-1b323e877316/bin-2019/utaipan/data/494a3e746/9f333484073246e095ce51fc83f61cd8/FLAGf47f520ad [2018-12-03 03:41:29,082 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f07add46-de11-4cb9-9b67-1b323e877316/bin-2019/utaipan/data/494a3e746/9f333484073246e095ce51fc83f61cd8 [2018-12-03 03:41:29,083 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 03:41:29,084 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 03:41:29,085 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 03:41:29,085 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 03:41:29,087 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 03:41:29,088 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 03:41:29" (1/1) ... [2018-12-03 03:41:29,089 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b1a052f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:41:29, skipping insertion in model container [2018-12-03 03:41:29,090 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 03:41:29" (1/1) ... [2018-12-03 03:41:29,094 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 03:41:29,102 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 03:41:29,183 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 03:41:29,185 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 03:41:29,193 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 03:41:29,201 INFO L195 MainTranslator]: Completed translation [2018-12-03 03:41:29,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:41:29 WrapperNode [2018-12-03 03:41:29,201 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 03:41:29,202 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 03:41:29,202 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 03:41:29,202 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 03:41:29,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:41:29" (1/1) ... [2018-12-03 03:41:29,210 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:41:29" (1/1) ... [2018-12-03 03:41:29,213 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 03:41:29,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 03:41:29,214 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 03:41:29,214 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 03:41:29,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:41:29" (1/1) ... [2018-12-03 03:41:29,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:41:29" (1/1) ... [2018-12-03 03:41:29,220 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:41:29" (1/1) ... [2018-12-03 03:41:29,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:41:29" (1/1) ... [2018-12-03 03:41:29,222 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:41:29" (1/1) ... [2018-12-03 03:41:29,223 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:41:29" (1/1) ... [2018-12-03 03:41:29,223 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:41:29" (1/1) ... [2018-12-03 03:41:29,224 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 03:41:29,224 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 03:41:29,225 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 03:41:29,225 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 03:41:29,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:41:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f07add46-de11-4cb9-9b67-1b323e877316/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 03:41:29,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 03:41:29,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 03:41:29,285 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2018-12-03 03:41:29,285 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2018-12-03 03:41:29,286 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2018-12-03 03:41:29,286 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2018-12-03 03:41:29,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 03:41:29,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 03:41:29,286 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 03:41:29,286 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 03:41:29,396 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 03:41:29,397 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 03:41:29,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:41:29 BoogieIcfgContainer [2018-12-03 03:41:29,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 03:41:29,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 03:41:29,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 03:41:29,399 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 03:41:29,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 03:41:29" (1/3) ... [2018-12-03 03:41:29,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@547d207c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:41:29, skipping insertion in model container [2018-12-03 03:41:29,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:41:29" (2/3) ... [2018-12-03 03:41:29,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@547d207c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:41:29, skipping insertion in model container [2018-12-03 03:41:29,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:41:29" (3/3) ... [2018-12-03 03:41:29,402 INFO L112 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c [2018-12-03 03:41:29,408 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 03:41:29,412 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-12-03 03:41:29,422 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2018-12-03 03:41:29,441 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 03:41:29,441 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 03:41:29,441 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 03:41:29,441 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 03:41:29,441 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 03:41:29,441 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 03:41:29,442 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 03:41:29,442 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 03:41:29,453 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-12-03 03:41:29,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 03:41:29,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:41:29,456 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:41:29,458 INFO L423 AbstractCegarLoop]: === Iteration 1 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 03:41:29,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:41:29,461 INFO L82 PathProgramCache]: Analyzing trace with hash -359085562, now seen corresponding path program 1 times [2018-12-03 03:41:29,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:41:29,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:41:29,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:41:29,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:41:29,493 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:41:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:41:29,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:41:29,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:41:29,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 03:41:29,585 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:41:29,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 03:41:29,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 03:41:29,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 03:41:29,596 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 7 states. [2018-12-03 03:41:29,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:41:29,709 INFO L93 Difference]: Finished difference Result 91 states and 107 transitions. [2018-12-03 03:41:29,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 03:41:29,710 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-12-03 03:41:29,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:41:29,716 INFO L225 Difference]: With dead ends: 91 [2018-12-03 03:41:29,717 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 03:41:29,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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-03 03:41:29,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 03:41:29,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 70. [2018-12-03 03:41:29,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 03:41:29,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2018-12-03 03:41:29,750 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 12 [2018-12-03 03:41:29,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:41:29,750 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2018-12-03 03:41:29,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 03:41:29,751 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2018-12-03 03:41:29,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 03:41:29,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:41:29,752 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:41:29,752 INFO L423 AbstractCegarLoop]: === Iteration 2 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 03:41:29,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:41:29,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1753249505, now seen corresponding path program 1 times [2018-12-03 03:41:29,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:41:29,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:41:29,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:41:29,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:41:29,754 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:41:29,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:41:29,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:41:29,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:41:29,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 03:41:29,768 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:41:29,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:41:29,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:41:29,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:41:29,769 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand 3 states. [2018-12-03 03:41:29,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:41:29,778 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2018-12-03 03:41:29,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:41:29,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-03 03:41:29,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:41:29,779 INFO L225 Difference]: With dead ends: 74 [2018-12-03 03:41:29,779 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 03:41:29,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:41:29,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 03:41:29,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-12-03 03:41:29,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 03:41:29,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 86 transitions. [2018-12-03 03:41:29,787 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 86 transitions. Word has length 13 [2018-12-03 03:41:29,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:41:29,787 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 86 transitions. [2018-12-03 03:41:29,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:41:29,787 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 86 transitions. [2018-12-03 03:41:29,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 03:41:29,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:41:29,788 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:41:29,788 INFO L423 AbstractCegarLoop]: === Iteration 3 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 03:41:29,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:41:29,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1245225281, now seen corresponding path program 1 times [2018-12-03 03:41:29,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:41:29,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:41:29,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:41:29,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:41:29,789 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:41:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:41:29,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:41:29,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:41:29,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 03:41:29,802 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:41:29,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:41:29,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:41:29,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:41:29,803 INFO L87 Difference]: Start difference. First operand 69 states and 86 transitions. Second operand 3 states. [2018-12-03 03:41:29,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:41:29,812 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2018-12-03 03:41:29,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:41:29,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 03:41:29,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:41:29,813 INFO L225 Difference]: With dead ends: 69 [2018-12-03 03:41:29,813 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 03:41:29,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:41:29,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 03:41:29,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 03:41:29,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 03:41:29,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2018-12-03 03:41:29,818 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 15 [2018-12-03 03:41:29,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:41:29,819 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2018-12-03 03:41:29,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:41:29,819 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2018-12-03 03:41:29,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 03:41:29,819 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:41:29,819 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:41:29,819 INFO L423 AbstractCegarLoop]: === Iteration 4 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 03:41:29,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:41:29,820 INFO L82 PathProgramCache]: Analyzing trace with hash -52721888, now seen corresponding path program 1 times [2018-12-03 03:41:29,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:41:29,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:41:29,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:41:29,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:41:29,820 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:41:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:41:29,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:41:29,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:41:29,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:41:29,838 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:41:29,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 03:41:29,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 03:41:29,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 03:41:29,839 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand 4 states. [2018-12-03 03:41:29,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:41:29,854 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2018-12-03 03:41:29,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 03:41:29,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-03 03:41:29,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:41:29,855 INFO L225 Difference]: With dead ends: 89 [2018-12-03 03:41:29,855 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 03:41:29,855 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-03 03:41:29,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 03:41:29,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2018-12-03 03:41:29,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 03:41:29,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2018-12-03 03:41:29,861 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 16 [2018-12-03 03:41:29,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:41:29,862 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2018-12-03 03:41:29,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 03:41:29,862 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2018-12-03 03:41:29,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 03:41:29,862 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:41:29,862 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-03 03:41:29,862 INFO L423 AbstractCegarLoop]: === Iteration 5 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 03:41:29,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:41:29,863 INFO L82 PathProgramCache]: Analyzing trace with hash -571942417, now seen corresponding path program 1 times [2018-12-03 03:41:29,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:41:29,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:41:29,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:41:29,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:41:29,863 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:41:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:41:29,873 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-03 03:41:29,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:41:29,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 03:41:29,873 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:41:29,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:41:29,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:41:29,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:41:29,874 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand 3 states. [2018-12-03 03:41:29,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:41:29,880 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2018-12-03 03:41:29,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:41:29,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-03 03:41:29,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:41:29,881 INFO L225 Difference]: With dead ends: 78 [2018-12-03 03:41:29,881 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 03:41:29,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:41:29,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 03:41:29,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-03 03:41:29,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 03:41:29,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2018-12-03 03:41:29,887 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 20 [2018-12-03 03:41:29,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:41:29,887 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2018-12-03 03:41:29,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:41:29,887 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2018-12-03 03:41:29,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 03:41:29,888 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:41:29,888 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-03 03:41:29,888 INFO L423 AbstractCegarLoop]: === Iteration 6 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 03:41:29,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:41:29,888 INFO L82 PathProgramCache]: Analyzing trace with hash -550345698, now seen corresponding path program 1 times [2018-12-03 03:41:29,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:41:29,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:41:29,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:41:29,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:41:29,889 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:41:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:41:29,908 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-03 03:41:29,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:41:29,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:41:29,908 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:41:29,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 03:41:29,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 03:41:29,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 03:41:29,909 INFO L87 Difference]: Start difference. First operand 77 states and 98 transitions. Second operand 4 states. [2018-12-03 03:41:29,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:41:29,920 INFO L93 Difference]: Finished difference Result 98 states and 130 transitions. [2018-12-03 03:41:29,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 03:41:29,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-12-03 03:41:29,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:41:29,922 INFO L225 Difference]: With dead ends: 98 [2018-12-03 03:41:29,922 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 03:41:29,922 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-03 03:41:29,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 03:41:29,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 83. [2018-12-03 03:41:29,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-03 03:41:29,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 104 transitions. [2018-12-03 03:41:29,928 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 104 transitions. Word has length 21 [2018-12-03 03:41:29,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:41:29,928 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 104 transitions. [2018-12-03 03:41:29,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 03:41:29,928 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 104 transitions. [2018-12-03 03:41:29,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 03:41:29,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:41:29,928 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:41:29,929 INFO L423 AbstractCegarLoop]: === Iteration 7 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 03:41:29,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:41:29,929 INFO L82 PathProgramCache]: Analyzing trace with hash 838473927, now seen corresponding path program 1 times [2018-12-03 03:41:29,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:41:29,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:41:29,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:41:29,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:41:29,930 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:41:29,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:41:29,959 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:41:29,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:41:29,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 03:41:29,959 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:41:29,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 03:41:29,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 03:41:29,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:41:29,960 INFO L87 Difference]: Start difference. First operand 83 states and 104 transitions. Second operand 5 states. [2018-12-03 03:41:29,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:41:29,997 INFO L93 Difference]: Finished difference Result 129 states and 163 transitions. [2018-12-03 03:41:29,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 03:41:29,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-03 03:41:29,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:41:29,998 INFO L225 Difference]: With dead ends: 129 [2018-12-03 03:41:29,998 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 03:41:29,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:41:29,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 03:41:30,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-12-03 03:41:30,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 03:41:30,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 96 transitions. [2018-12-03 03:41:30,005 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 96 transitions. Word has length 23 [2018-12-03 03:41:30,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:41:30,005 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 96 transitions. [2018-12-03 03:41:30,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 03:41:30,005 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2018-12-03 03:41:30,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 03:41:30,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:41:30,006 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:41:30,006 INFO L423 AbstractCegarLoop]: === Iteration 8 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 03:41:30,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:41:30,006 INFO L82 PathProgramCache]: Analyzing trace with hash 2032985165, now seen corresponding path program 1 times [2018-12-03 03:41:30,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:41:30,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:41:30,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:41:30,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:41:30,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:41:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:41:30,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 03:41:30,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:41:30,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 03:41:30,039 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:41:30,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 03:41:30,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 03:41:30,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:41:30,040 INFO L87 Difference]: Start difference. First operand 77 states and 96 transitions. Second operand 5 states. [2018-12-03 03:41:30,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:41:30,085 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2018-12-03 03:41:30,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 03:41:30,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-12-03 03:41:30,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:41:30,086 INFO L225 Difference]: With dead ends: 102 [2018-12-03 03:41:30,086 INFO L226 Difference]: Without dead ends: 101 [2018-12-03 03:41:30,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 03:41:30,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-03 03:41:30,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2018-12-03 03:41:30,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 03:41:30,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 125 transitions. [2018-12-03 03:41:30,094 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 125 transitions. Word has length 25 [2018-12-03 03:41:30,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:41:30,095 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 125 transitions. [2018-12-03 03:41:30,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 03:41:30,095 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 125 transitions. [2018-12-03 03:41:30,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 03:41:30,095 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:41:30,095 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:41:30,096 INFO L423 AbstractCegarLoop]: === Iteration 9 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 03:41:30,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:41:30,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1980125912, now seen corresponding path program 1 times [2018-12-03 03:41:30,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:41:30,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:41:30,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:41:30,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:41:30,097 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:41:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:41:30,119 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 03:41:30,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:41:30,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 03:41:30,119 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:41:30,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 03:41:30,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 03:41:30,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:41:30,120 INFO L87 Difference]: Start difference. First operand 98 states and 125 transitions. Second operand 5 states. [2018-12-03 03:41:30,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:41:30,158 INFO L93 Difference]: Finished difference Result 123 states and 155 transitions. [2018-12-03 03:41:30,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 03:41:30,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-12-03 03:41:30,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:41:30,159 INFO L225 Difference]: With dead ends: 123 [2018-12-03 03:41:30,159 INFO L226 Difference]: Without dead ends: 122 [2018-12-03 03:41:30,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 03:41:30,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-03 03:41:30,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2018-12-03 03:41:30,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-03 03:41:30,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 154 transitions. [2018-12-03 03:41:30,166 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 154 transitions. Word has length 31 [2018-12-03 03:41:30,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:41:30,166 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 154 transitions. [2018-12-03 03:41:30,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 03:41:30,166 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 154 transitions. [2018-12-03 03:41:30,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 03:41:30,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:41:30,167 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 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-03 03:41:30,167 INFO L423 AbstractCegarLoop]: === Iteration 10 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 03:41:30,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:41:30,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1444432349, now seen corresponding path program 1 times [2018-12-03 03:41:30,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:41:30,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:41:30,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:41:30,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:41:30,168 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:41:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:41:30,183 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-03 03:41:30,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:41:30,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:41:30,183 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:41:30,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 03:41:30,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 03:41:30,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 03:41:30,184 INFO L87 Difference]: Start difference. First operand 119 states and 154 transitions. Second operand 4 states. [2018-12-03 03:41:30,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:41:30,201 INFO L93 Difference]: Finished difference Result 132 states and 174 transitions. [2018-12-03 03:41:30,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 03:41:30,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-03 03:41:30,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:41:30,203 INFO L225 Difference]: With dead ends: 132 [2018-12-03 03:41:30,203 INFO L226 Difference]: Without dead ends: 131 [2018-12-03 03:41:30,203 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-03 03:41:30,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-03 03:41:30,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2018-12-03 03:41:30,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-03 03:41:30,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 162 transitions. [2018-12-03 03:41:30,213 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 162 transitions. Word has length 34 [2018-12-03 03:41:30,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:41:30,213 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 162 transitions. [2018-12-03 03:41:30,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 03:41:30,213 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 162 transitions. [2018-12-03 03:41:30,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 03:41:30,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:41:30,214 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 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-03 03:41:30,215 INFO L423 AbstractCegarLoop]: === Iteration 11 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 03:41:30,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:41:30,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1827729912, now seen corresponding path program 1 times [2018-12-03 03:41:30,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:41:30,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:41:30,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:41:30,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:41:30,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:41:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:41:30,235 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 03:41:30,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:41:30,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 03:41:30,235 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:41:30,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:41:30,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:41:30,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:41:30,236 INFO L87 Difference]: Start difference. First operand 127 states and 162 transitions. Second operand 3 states. [2018-12-03 03:41:30,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:41:30,243 INFO L93 Difference]: Finished difference Result 127 states and 162 transitions. [2018-12-03 03:41:30,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:41:30,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-03 03:41:30,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:41:30,245 INFO L225 Difference]: With dead ends: 127 [2018-12-03 03:41:30,245 INFO L226 Difference]: Without dead ends: 126 [2018-12-03 03:41:30,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:41:30,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-03 03:41:30,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-12-03 03:41:30,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-03 03:41:30,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 158 transitions. [2018-12-03 03:41:30,254 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 158 transitions. Word has length 35 [2018-12-03 03:41:30,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:41:30,254 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 158 transitions. [2018-12-03 03:41:30,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:41:30,254 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 158 transitions. [2018-12-03 03:41:30,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 03:41:30,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:41:30,256 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 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-03 03:41:30,256 INFO L423 AbstractCegarLoop]: === Iteration 12 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 03:41:30,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:41:30,256 INFO L82 PathProgramCache]: Analyzing trace with hash 324073318, now seen corresponding path program 1 times [2018-12-03 03:41:30,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:41:30,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:41:30,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:41:30,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:41:30,258 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:41:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:41:30,295 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 03:41:30,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:41:30,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 03:41:30,296 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:41:30,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 03:41:30,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 03:41:30,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:41:30,297 INFO L87 Difference]: Start difference. First operand 126 states and 158 transitions. Second operand 5 states. [2018-12-03 03:41:30,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:41:30,329 INFO L93 Difference]: Finished difference Result 126 states and 158 transitions. [2018-12-03 03:41:30,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 03:41:30,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-12-03 03:41:30,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:41:30,330 INFO L225 Difference]: With dead ends: 126 [2018-12-03 03:41:30,330 INFO L226 Difference]: Without dead ends: 125 [2018-12-03 03:41:30,331 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-03 03:41:30,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-03 03:41:30,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-12-03 03:41:30,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-12-03 03:41:30,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 156 transitions. [2018-12-03 03:41:30,337 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 156 transitions. Word has length 40 [2018-12-03 03:41:30,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:41:30,337 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 156 transitions. [2018-12-03 03:41:30,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 03:41:30,337 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 156 transitions. [2018-12-03 03:41:30,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 03:41:30,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:41:30,338 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 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, 1] [2018-12-03 03:41:30,339 INFO L423 AbstractCegarLoop]: === Iteration 13 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 03:41:30,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:41:30,339 INFO L82 PathProgramCache]: Analyzing trace with hash 364458084, now seen corresponding path program 1 times [2018-12-03 03:41:30,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:41:30,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:41:30,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:41:30,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:41:30,340 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:41:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:41:30,365 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-03 03:41:30,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:41:30,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 03:41:30,366 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:41:30,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 03:41:30,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 03:41:30,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:41:30,366 INFO L87 Difference]: Start difference. First operand 125 states and 156 transitions. Second operand 5 states. [2018-12-03 03:41:30,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:41:30,390 INFO L93 Difference]: Finished difference Result 125 states and 156 transitions. [2018-12-03 03:41:30,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 03:41:30,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-03 03:41:30,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:41:30,391 INFO L225 Difference]: With dead ends: 125 [2018-12-03 03:41:30,391 INFO L226 Difference]: Without dead ends: 124 [2018-12-03 03:41:30,392 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-03 03:41:30,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-03 03:41:30,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 110. [2018-12-03 03:41:30,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 03:41:30,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 134 transitions. [2018-12-03 03:41:30,399 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 134 transitions. Word has length 45 [2018-12-03 03:41:30,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:41:30,399 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 134 transitions. [2018-12-03 03:41:30,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 03:41:30,399 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2018-12-03 03:41:30,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 03:41:30,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:41:30,400 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 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, 1, 1] [2018-12-03 03:41:30,401 INFO L423 AbstractCegarLoop]: === Iteration 14 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 03:41:30,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:41:30,401 INFO L82 PathProgramCache]: Analyzing trace with hash -921113151, now seen corresponding path program 1 times [2018-12-03 03:41:30,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:41:30,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:41:30,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:41:30,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:41:30,403 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:41:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:41:30,442 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-03 03:41:30,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:41:30,442 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:41:30,443 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 48 with the following transitions: [2018-12-03 03:41:30,444 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [5], [6], [7], [9], [11], [13], [15], [17], [19], [21], [23], [24], [25], [29], [31], [33], [35], [46], [50], [51], [52], [53], [54], [55], [56], [57], [58], [60], [61], [62], [64] [2018-12-03 03:41:30,466 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:41:30,466 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:41:30,628 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 03:41:30,629 INFO L272 AbstractInterpreter]: Visited 34 different actions 158 times. Merged at 15 different actions 28 times. Never widened. Performed 418 root evaluator evaluations with a maximum evaluation depth of 3. Performed 418 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-03 03:41:30,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:41:30,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 03:41:30,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:41:30,638 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f07add46-de11-4cb9-9b67-1b323e877316/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 03:41:30,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:41:30,647 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 03:41:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:41:30,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 03:41:30,684 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-03 03:41:30,685 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 03:41:30,759 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-03 03:41:30,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 03:41:30,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2018-12-03 03:41:30,773 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 03:41:30,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 03:41:30,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 03:41:30,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 03:41:30,774 INFO L87 Difference]: Start difference. First operand 110 states and 134 transitions. Second operand 8 states. [2018-12-03 03:41:30,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:41:30,825 INFO L93 Difference]: Finished difference Result 223 states and 286 transitions. [2018-12-03 03:41:30,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 03:41:30,825 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-12-03 03:41:30,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:41:30,826 INFO L225 Difference]: With dead ends: 223 [2018-12-03 03:41:30,826 INFO L226 Difference]: Without dead ends: 146 [2018-12-03 03:41:30,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 91 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-03 03:41:30,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-03 03:41:30,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 128. [2018-12-03 03:41:30,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-03 03:41:30,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 155 transitions. [2018-12-03 03:41:30,837 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 155 transitions. Word has length 47 [2018-12-03 03:41:30,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:41:30,837 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 155 transitions. [2018-12-03 03:41:30,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 03:41:30,837 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 155 transitions. [2018-12-03 03:41:30,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 03:41:30,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:41:30,838 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] [2018-12-03 03:41:30,839 INFO L423 AbstractCegarLoop]: === Iteration 15 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 03:41:30,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:41:30,839 INFO L82 PathProgramCache]: Analyzing trace with hash -922396984, now seen corresponding path program 1 times [2018-12-03 03:41:30,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:41:30,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:41:30,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:41:30,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:41:30,840 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:41:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:41:30,855 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-03 03:41:30,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:41:30,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 03:41:30,856 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:41:30,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:41:30,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:41:30,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:41:30,857 INFO L87 Difference]: Start difference. First operand 128 states and 155 transitions. Second operand 3 states. [2018-12-03 03:41:30,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:41:30,865 INFO L93 Difference]: Finished difference Result 128 states and 155 transitions. [2018-12-03 03:41:30,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:41:30,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-12-03 03:41:30,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:41:30,867 INFO L225 Difference]: With dead ends: 128 [2018-12-03 03:41:30,867 INFO L226 Difference]: Without dead ends: 127 [2018-12-03 03:41:30,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:41:30,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-03 03:41:30,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-12-03 03:41:30,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-03 03:41:30,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 153 transitions. [2018-12-03 03:41:30,876 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 153 transitions. Word has length 47 [2018-12-03 03:41:30,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:41:30,876 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 153 transitions. [2018-12-03 03:41:30,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:41:30,876 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 153 transitions. [2018-12-03 03:41:30,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 03:41:30,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:41:30,877 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-03 03:41:30,878 INFO L423 AbstractCegarLoop]: === Iteration 16 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 03:41:30,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:41:30,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1470464639, now seen corresponding path program 1 times [2018-12-03 03:41:30,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:41:30,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:41:30,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:41:30,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:41:30,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:41:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:41:30,902 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-03 03:41:30,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:41:30,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:41:30,903 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:41:30,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 03:41:30,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 03:41:30,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 03:41:30,903 INFO L87 Difference]: Start difference. First operand 127 states and 153 transitions. Second operand 4 states. [2018-12-03 03:41:30,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:41:30,920 INFO L93 Difference]: Finished difference Result 136 states and 163 transitions. [2018-12-03 03:41:30,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 03:41:30,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-12-03 03:41:30,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:41:30,922 INFO L225 Difference]: With dead ends: 136 [2018-12-03 03:41:30,922 INFO L226 Difference]: Without dead ends: 128 [2018-12-03 03:41:30,922 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-03 03:41:30,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-03 03:41:30,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-12-03 03:41:30,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-03 03:41:30,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 150 transitions. [2018-12-03 03:41:30,927 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 150 transitions. Word has length 48 [2018-12-03 03:41:30,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:41:30,928 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 150 transitions. [2018-12-03 03:41:30,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 03:41:30,928 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 150 transitions. [2018-12-03 03:41:30,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 03:41:30,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:41:30,929 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 5, 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] [2018-12-03 03:41:30,929 INFO L423 AbstractCegarLoop]: === Iteration 17 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 03:41:30,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:41:30,929 INFO L82 PathProgramCache]: Analyzing trace with hash -524468521, now seen corresponding path program 1 times [2018-12-03 03:41:30,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:41:30,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:41:30,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:41:30,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:41:30,930 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:41:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:41:30,959 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-12-03 03:41:30,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:41:30,960 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:41:30,960 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-12-03 03:41:30,960 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [5], [7], [9], [11], [13], [15], [17], [19], [20], [21], [23], [24], [25], [29], [46], [50], [51], [52], [53], [54], [55], [56], [60], [61], [62], [64] [2018-12-03 03:41:30,961 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:41:30,961 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:41:31,013 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 03:41:31,013 INFO L272 AbstractInterpreter]: Visited 29 different actions 145 times. Merged at 11 different actions 24 times. Never widened. Performed 375 root evaluator evaluations with a maximum evaluation depth of 3. Performed 375 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-03 03:41:31,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:41:31,022 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 03:41:31,062 INFO L227 lantSequenceWeakener]: Weakened 20 states. On average, predicates are now at 62.17% of their original sizes. [2018-12-03 03:41:31,062 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 03:41:31,151 INFO L418 sIntCurrentIteration]: We unified 57 AI predicates to 57 [2018-12-03 03:41:31,151 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 03:41:31,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 03:41:31,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 18 [2018-12-03 03:41:31,152 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:41:31,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 03:41:31,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 03:41:31,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-12-03 03:41:31,152 INFO L87 Difference]: Start difference. First operand 126 states and 150 transitions. Second operand 14 states. [2018-12-03 03:41:31,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:41:31,592 INFO L93 Difference]: Finished difference Result 165 states and 200 transitions. [2018-12-03 03:41:31,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 03:41:31,592 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2018-12-03 03:41:31,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:41:31,592 INFO L225 Difference]: With dead ends: 165 [2018-12-03 03:41:31,592 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 03:41:31,593 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 72 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2018-12-03 03:41:31,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 03:41:31,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 03:41:31,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 03:41:31,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 03:41:31,594 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-12-03 03:41:31,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:41:31,594 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 03:41:31,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 03:41:31,594 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 03:41:31,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 03:41:31,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 03:41:31,791 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-03 03:41:31,791 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-03 03:41:31,791 INFO L448 ceAbstractionStarter]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-12-03 03:41:31,792 INFO L448 ceAbstractionStarter]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-12-03 03:41:31,792 INFO L448 ceAbstractionStarter]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2018-12-03 03:41:31,792 INFO L448 ceAbstractionStarter]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2018-12-03 03:41:31,792 INFO L448 ceAbstractionStarter]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-12-03 03:41:31,792 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-12-03 03:41:31,792 INFO L448 ceAbstractionStarter]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-12-03 03:41:31,792 INFO L451 ceAbstractionStarter]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2018-12-03 03:41:31,792 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2018-12-03 03:41:31,792 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2018-12-03 03:41:31,792 INFO L444 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: (or (< 2147483647 |rec1_#in~i|) (and (= rec1_~i |rec1_#in~i|) (<= 1 rec1_~i))) [2018-12-03 03:41:31,793 INFO L448 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2018-12-03 03:41:31,793 INFO L448 ceAbstractionStarter]: For program point L14-4(line 14) no Hoare annotation was computed. [2018-12-03 03:41:31,793 INFO L448 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2018-12-03 03:41:31,793 INFO L444 ceAbstractionStarter]: At program point L14-6(line 14) the Hoare annotation is: (or (< 2147483647 |rec1_#in~i|) (and (or (= |rec1_#t~ret0| 0) (= |rec1_#t~ret0| 1)) (= rec1_~i |rec1_#in~i|) (<= 1 rec1_~i))) [2018-12-03 03:41:31,793 INFO L448 ceAbstractionStarter]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-12-03 03:41:31,793 INFO L448 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2018-12-03 03:41:31,793 INFO L444 ceAbstractionStarter]: At program point L14-8(line 14) the Hoare annotation is: (or (< 2147483647 |rec1_#in~i|) (and (or (= |rec1_#t~ret0| 0) (= |rec1_#t~ret0| 1)) (= |rec1_#t~ret1| 0) (= rec1_~i |rec1_#in~i|) (<= 1 rec1_~i))) [2018-12-03 03:41:31,793 INFO L448 ceAbstractionStarter]: For program point L14-9(line 14) no Hoare annotation was computed. [2018-12-03 03:41:31,794 INFO L448 ceAbstractionStarter]: For program point L14-10(line 14) no Hoare annotation was computed. [2018-12-03 03:41:31,794 INFO L448 ceAbstractionStarter]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-12-03 03:41:31,794 INFO L448 ceAbstractionStarter]: For program point L14-11(line 14) no Hoare annotation was computed. [2018-12-03 03:41:31,794 INFO L448 ceAbstractionStarter]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2018-12-03 03:41:31,794 INFO L448 ceAbstractionStarter]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2018-12-03 03:41:31,794 INFO L444 ceAbstractionStarter]: At program point L20(line 20) the Hoare annotation is: (and (< 0 |rec2_#in~j|) (or (and (<= rec2_~j 2147483647) (<= 1 rec2_~j)) (< 2147483647 |rec2_#in~j|))) [2018-12-03 03:41:31,794 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-12-03 03:41:31,794 INFO L448 ceAbstractionStarter]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-03 03:41:31,794 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2018-12-03 03:41:31,794 INFO L448 ceAbstractionStarter]: For program point L20-2(line 20) no Hoare annotation was computed. [2018-12-03 03:41:31,794 INFO L448 ceAbstractionStarter]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-03 03:41:31,794 INFO L448 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-12-03 03:41:31,795 INFO L444 ceAbstractionStarter]: At program point L20-4(line 20) the Hoare annotation is: (and (or (and (<= rec2_~j 2147483647) (<= |rec2_#t~ret3| 1) (<= 0 (+ |rec2_#t~ret3| 2147483647)) (<= 1 rec2_~j)) (< 2147483647 |rec2_#in~j|)) (< 0 |rec2_#in~j|)) [2018-12-03 03:41:31,795 INFO L448 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2018-12-03 03:41:31,795 INFO L448 ceAbstractionStarter]: For program point L20-6(line 20) no Hoare annotation was computed. [2018-12-03 03:41:31,795 INFO L448 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2018-12-03 03:41:31,795 INFO L451 ceAbstractionStarter]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2018-12-03 03:41:31,795 INFO L448 ceAbstractionStarter]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-03 03:41:31,795 INFO L448 ceAbstractionStarter]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-03 03:41:31,795 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-03 03:41:31,795 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-03 03:41:31,795 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-03 03:41:31,795 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-03 03:41:31,795 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 23 26) the Hoare annotation is: true [2018-12-03 03:41:31,795 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 23 26) no Hoare annotation was computed. [2018-12-03 03:41:31,796 INFO L444 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (<= main_~x~0 2147483647) [2018-12-03 03:41:31,796 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 23 26) no Hoare annotation was computed. [2018-12-03 03:41:31,796 INFO L448 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2018-12-03 03:41:31,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:41:31 BoogieIcfgContainer [2018-12-03 03:41:31,798 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 03:41:31,798 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 03:41:31,798 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 03:41:31,799 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 03:41:31,799 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:41:29" (3/4) ... [2018-12-03 03:41:31,802 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-03 03:41:31,807 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-03 03:41:31,807 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2018-12-03 03:41:31,807 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2018-12-03 03:41:31,808 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-03 03:41:31,811 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-03 03:41:31,811 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-03 03:41:31,812 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-03 03:41:31,848 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f07add46-de11-4cb9-9b67-1b323e877316/bin-2019/utaipan/witness.graphml [2018-12-03 03:41:31,848 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 03:41:31,849 INFO L168 Benchmark]: Toolchain (without parser) took 2764.90 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 222.8 MB). Free memory was 957.8 MB in the beginning and 1.0 GB in the end (delta: -86.4 MB). Peak memory consumption was 136.4 MB. Max. memory is 11.5 GB. [2018-12-03 03:41:31,850 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 03:41:31,850 INFO L168 Benchmark]: CACSL2BoogieTranslator took 116.47 ms. Allocated memory is still 1.0 GB. Free memory was 957.8 MB in the beginning and 947.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-03 03:41:31,850 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.52 ms. Allocated memory is still 1.0 GB. Free memory is still 947.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 03:41:31,851 INFO L168 Benchmark]: Boogie Preprocessor took 10.80 ms. Allocated memory is still 1.0 GB. Free memory is still 947.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 03:41:31,851 INFO L168 Benchmark]: RCFGBuilder took 172.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -182.7 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-12-03 03:41:31,851 INFO L168 Benchmark]: TraceAbstraction took 2400.71 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.6 MB). Peak memory consumption was 159.5 MB. Max. memory is 11.5 GB. [2018-12-03 03:41:31,852 INFO L168 Benchmark]: Witness Printer took 49.69 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 03:41:31,853 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 116.47 ms. Allocated memory is still 1.0 GB. Free memory was 957.8 MB in the beginning and 947.0 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.52 ms. Allocated memory is still 1.0 GB. Free memory is still 947.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.80 ms. Allocated memory is still 1.0 GB. Free memory is still 947.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 172.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -182.7 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2400.71 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.6 MB). Peak memory consumption was 159.5 MB. Max. memory is 11.5 GB. * Witness Printer took 49.69 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. 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, 2.3s OverallTime, 17 OverallIterations, 7 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 718 SDtfs, 278 SDslu, 1585 SDs, 0 SdLazy, 457 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 238 GetRequests, 159 SyntacticMatches, 5 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.8815789473684209 AbsIntWeakeningRatio, 0.543859649122807 AbsIntAvgWeakeningVarsNumRemoved, 0.15789473684210525 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 87 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 161 PreInvPairs, 168 NumberOfFragments, 104 HoareAnnotationTreeSize, 161 FomulaSimplifications, 134 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 263 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 577 NumberOfCodeBlocks, 577 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 605 ConstructedInterpolants, 0 QuantifiedInterpolants, 33529 SizeOfPredicates, 1 NumberOfNonLiveVariables, 100 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 353/372 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...