./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fc8ee96c-b6ad-4d76-b195-488b312ad216/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fc8ee96c-b6ad-4d76-b195-488b312ad216/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fc8ee96c-b6ad-4d76-b195-488b312ad216/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fc8ee96c-b6ad-4d76-b195-488b312ad216/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_fc8ee96c-b6ad-4d76-b195-488b312ad216/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fc8ee96c-b6ad-4d76-b195-488b312ad216/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-1dbac8b [2018-10-27 05:42:55,572 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 05:42:55,573 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 05:42:55,582 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 05:42:55,582 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 05:42:55,583 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 05:42:55,585 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 05:42:55,586 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 05:42:55,588 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 05:42:55,596 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 05:42:55,597 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 05:42:55,597 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 05:42:55,598 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 05:42:55,599 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 05:42:55,600 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 05:42:55,600 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 05:42:55,601 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 05:42:55,602 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 05:42:55,604 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 05:42:55,605 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 05:42:55,606 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 05:42:55,607 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 05:42:55,614 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 05:42:55,615 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 05:42:55,615 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 05:42:55,616 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 05:42:55,616 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 05:42:55,617 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 05:42:55,618 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 05:42:55,618 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 05:42:55,618 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 05:42:55,619 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 05:42:55,619 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 05:42:55,619 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 05:42:55,622 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 05:42:55,623 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 05:42:55,623 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fc8ee96c-b6ad-4d76-b195-488b312ad216/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-10-27 05:42:55,636 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 05:42:55,638 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 05:42:55,639 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 05:42:55,639 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 05:42:55,639 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 05:42:55,640 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 05:42:55,640 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 05:42:55,641 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 05:42:55,641 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 05:42:55,641 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 05:42:55,641 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 05:42:55,642 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 05:42:55,644 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 05:42:55,644 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 05:42:55,644 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 05:42:55,644 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 05:42:55,644 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 05:42:55,644 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 05:42:55,645 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-10-27 05:42:55,645 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 05:42:55,645 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 05:42:55,645 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 05:42:55,645 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 05:42:55,645 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 05:42:55,646 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 05:42:55,646 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 05:42:55,646 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 05:42:55,646 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 05:42:55,646 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 05:42:55,646 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 05:42:55,646 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 05:42:55,647 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 05:42:55,647 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 05:42:55,647 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_fc8ee96c-b6ad-4d76-b195-488b312ad216/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-10-27 05:42:55,685 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 05:42:55,699 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 05:42:55,705 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 05:42:55,706 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 05:42:55,707 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 05:42:55,707 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fc8ee96c-b6ad-4d76-b195-488b312ad216/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted/NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c [2018-10-27 05:42:55,759 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fc8ee96c-b6ad-4d76-b195-488b312ad216/bin-2019/utaipan/data/a0d0b4c65/8a2daf0cd6b5457295ace08579af3b9d/FLAGb6d2ecc2b [2018-10-27 05:42:56,141 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 05:42:56,141 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fc8ee96c-b6ad-4d76-b195-488b312ad216/sv-benchmarks/c/termination-crafted/NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c [2018-10-27 05:42:56,147 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fc8ee96c-b6ad-4d76-b195-488b312ad216/bin-2019/utaipan/data/a0d0b4c65/8a2daf0cd6b5457295ace08579af3b9d/FLAGb6d2ecc2b [2018-10-27 05:42:56,159 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fc8ee96c-b6ad-4d76-b195-488b312ad216/bin-2019/utaipan/data/a0d0b4c65/8a2daf0cd6b5457295ace08579af3b9d [2018-10-27 05:42:56,163 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 05:42:56,165 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 05:42:56,165 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 05:42:56,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 05:42:56,169 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 05:42:56,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 05:42:56" (1/1) ... [2018-10-27 05:42:56,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@705c62d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:42:56, skipping insertion in model container [2018-10-27 05:42:56,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 05:42:56" (1/1) ... [2018-10-27 05:42:56,181 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 05:42:56,198 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 05:42:56,327 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 05:42:56,331 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 05:42:56,343 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 05:42:56,355 INFO L193 MainTranslator]: Completed translation [2018-10-27 05:42:56,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:42:56 WrapperNode [2018-10-27 05:42:56,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 05:42:56,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 05:42:56,357 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 05:42:56,357 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 05:42:56,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:42:56" (1/1) ... [2018-10-27 05:42:56,371 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:42:56" (1/1) ... [2018-10-27 05:42:56,376 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 05:42:56,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 05:42:56,377 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 05:42:56,377 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 05:42:56,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:42:56" (1/1) ... [2018-10-27 05:42:56,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:42:56" (1/1) ... [2018-10-27 05:42:56,388 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:42:56" (1/1) ... [2018-10-27 05:42:56,389 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:42:56" (1/1) ... [2018-10-27 05:42:56,391 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:42:56" (1/1) ... [2018-10-27 05:42:56,394 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:42:56" (1/1) ... [2018-10-27 05:42:56,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:42:56" (1/1) ... [2018-10-27 05:42:56,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 05:42:56,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 05:42:56,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 05:42:56,397 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 05:42:56,398 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:42:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc8ee96c-b6ad-4d76-b195-488b312ad216/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-10-27 05:42:56,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 05:42:56,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 05:42:56,516 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2018-10-27 05:42:56,516 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2018-10-27 05:42:56,517 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2018-10-27 05:42:56,517 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2018-10-27 05:42:56,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 05:42:56,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 05:42:56,517 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 05:42:56,518 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 05:42:57,000 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 05:42:57,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:42:57 BoogieIcfgContainer [2018-10-27 05:42:57,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 05:42:57,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 05:42:57,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 05:42:57,005 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 05:42:57,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 05:42:56" (1/3) ... [2018-10-27 05:42:57,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b16420f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 05:42:57, skipping insertion in model container [2018-10-27 05:42:57,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:42:56" (2/3) ... [2018-10-27 05:42:57,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b16420f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 05:42:57, skipping insertion in model container [2018-10-27 05:42:57,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:42:57" (3/3) ... [2018-10-27 05:42:57,008 INFO L112 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c [2018-10-27 05:42:57,017 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 05:42:57,025 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-10-27 05:42:57,039 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2018-10-27 05:42:57,078 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 05:42:57,078 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 05:42:57,078 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 05:42:57,078 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 05:42:57,078 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 05:42:57,079 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 05:42:57,079 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 05:42:57,079 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 05:42:57,100 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-10-27 05:42:57,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-27 05:42:57,107 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:42:57,108 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:42:57,112 INFO L424 AbstractCegarLoop]: === Iteration 1 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:42:57,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:42:57,120 INFO L82 PathProgramCache]: Analyzing trace with hash -359085562, now seen corresponding path program 1 times [2018-10-27 05:42:57,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:42:57,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:42:57,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:42:57,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:42:57,173 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:42:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:42:57,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:42:57,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:42:57,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 05:42:57,412 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:42:57,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 05:42:57,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 05:42:57,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-27 05:42:57,430 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 7 states. [2018-10-27 05:42:57,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:42:57,988 INFO L93 Difference]: Finished difference Result 91 states and 107 transitions. [2018-10-27 05:42:57,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 05:42:57,990 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-10-27 05:42:57,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:42:57,999 INFO L225 Difference]: With dead ends: 91 [2018-10-27 05:42:57,999 INFO L226 Difference]: Without dead ends: 83 [2018-10-27 05:42:58,002 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-27 05:42:58,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-27 05:42:58,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 70. [2018-10-27 05:42:58,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-27 05:42:58,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2018-10-27 05:42:58,054 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 12 [2018-10-27 05:42:58,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:42:58,054 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2018-10-27 05:42:58,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 05:42:58,054 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2018-10-27 05:42:58,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-27 05:42:58,055 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:42:58,056 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:42:58,056 INFO L424 AbstractCegarLoop]: === Iteration 2 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:42:58,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:42:58,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1753249505, now seen corresponding path program 1 times [2018-10-27 05:42:58,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:42:58,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:42:58,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:42:58,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:42:58,058 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:42:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:42:58,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:42:58,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:42:58,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 05:42:58,095 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:42:58,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 05:42:58,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 05:42:58,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:42:58,097 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand 3 states. [2018-10-27 05:42:58,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:42:58,116 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2018-10-27 05:42:58,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 05:42:58,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-10-27 05:42:58,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:42:58,119 INFO L225 Difference]: With dead ends: 74 [2018-10-27 05:42:58,119 INFO L226 Difference]: Without dead ends: 73 [2018-10-27 05:42:58,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:42:58,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-27 05:42:58,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-10-27 05:42:58,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-27 05:42:58,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 86 transitions. [2018-10-27 05:42:58,132 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 86 transitions. Word has length 13 [2018-10-27 05:42:58,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:42:58,132 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 86 transitions. [2018-10-27 05:42:58,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 05:42:58,133 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 86 transitions. [2018-10-27 05:42:58,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-27 05:42:58,133 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:42:58,133 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:42:58,134 INFO L424 AbstractCegarLoop]: === Iteration 3 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:42:58,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:42:58,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1245225281, now seen corresponding path program 1 times [2018-10-27 05:42:58,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:42:58,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:42:58,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:42:58,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:42:58,136 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:42:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:42:58,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:42:58,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:42:58,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 05:42:58,167 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:42:58,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 05:42:58,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 05:42:58,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:42:58,168 INFO L87 Difference]: Start difference. First operand 69 states and 86 transitions. Second operand 3 states. [2018-10-27 05:42:58,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:42:58,194 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2018-10-27 05:42:58,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 05:42:58,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-27 05:42:58,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:42:58,196 INFO L225 Difference]: With dead ends: 69 [2018-10-27 05:42:58,196 INFO L226 Difference]: Without dead ends: 68 [2018-10-27 05:42:58,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:42:58,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-27 05:42:58,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-10-27 05:42:58,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-27 05:42:58,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2018-10-27 05:42:58,210 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 15 [2018-10-27 05:42:58,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:42:58,211 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2018-10-27 05:42:58,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 05:42:58,211 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2018-10-27 05:42:58,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-27 05:42:58,212 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:42:58,212 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:42:58,214 INFO L424 AbstractCegarLoop]: === Iteration 4 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:42:58,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:42:58,214 INFO L82 PathProgramCache]: Analyzing trace with hash -52721888, now seen corresponding path program 1 times [2018-10-27 05:42:58,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:42:58,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:42:58,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:42:58,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:42:58,216 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:42:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:42:58,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:42:58,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:42:58,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 05:42:58,272 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:42:58,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 05:42:58,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 05:42:58,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 05:42:58,273 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand 4 states. [2018-10-27 05:42:58,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:42:58,319 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2018-10-27 05:42:58,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 05:42:58,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-10-27 05:42:58,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:42:58,322 INFO L225 Difference]: With dead ends: 89 [2018-10-27 05:42:58,322 INFO L226 Difference]: Without dead ends: 88 [2018-10-27 05:42:58,322 INFO L605 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-10-27 05:42:58,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-10-27 05:42:58,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2018-10-27 05:42:58,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-27 05:42:58,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2018-10-27 05:42:58,337 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 16 [2018-10-27 05:42:58,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:42:58,337 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2018-10-27 05:42:58,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 05:42:58,338 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2018-10-27 05:42:58,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 05:42:58,338 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:42:58,339 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:42:58,339 INFO L424 AbstractCegarLoop]: === Iteration 5 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:42:58,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:42:58,340 INFO L82 PathProgramCache]: Analyzing trace with hash -571942417, now seen corresponding path program 1 times [2018-10-27 05:42:58,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:42:58,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:42:58,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:42:58,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:42:58,343 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:42:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:42:58,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 05:42:58,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:42:58,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 05:42:58,390 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:42:58,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 05:42:58,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 05:42:58,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:42:58,391 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand 3 states. [2018-10-27 05:42:58,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:42:58,445 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2018-10-27 05:42:58,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 05:42:58,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-10-27 05:42:58,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:42:58,447 INFO L225 Difference]: With dead ends: 78 [2018-10-27 05:42:58,447 INFO L226 Difference]: Without dead ends: 77 [2018-10-27 05:42:58,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:42:58,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-27 05:42:58,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-10-27 05:42:58,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-27 05:42:58,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2018-10-27 05:42:58,471 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 20 [2018-10-27 05:42:58,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:42:58,472 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2018-10-27 05:42:58,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 05:42:58,472 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2018-10-27 05:42:58,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-27 05:42:58,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:42:58,473 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:42:58,473 INFO L424 AbstractCegarLoop]: === Iteration 6 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:42:58,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:42:58,474 INFO L82 PathProgramCache]: Analyzing trace with hash -550345698, now seen corresponding path program 1 times [2018-10-27 05:42:58,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:42:58,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:42:58,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:42:58,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:42:58,475 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:42:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:42:58,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 05:42:58,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:42:58,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 05:42:58,542 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:42:58,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 05:42:58,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 05:42:58,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 05:42:58,543 INFO L87 Difference]: Start difference. First operand 77 states and 98 transitions. Second operand 4 states. [2018-10-27 05:42:58,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:42:58,590 INFO L93 Difference]: Finished difference Result 98 states and 130 transitions. [2018-10-27 05:42:58,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 05:42:58,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-10-27 05:42:58,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:42:58,598 INFO L225 Difference]: With dead ends: 98 [2018-10-27 05:42:58,598 INFO L226 Difference]: Without dead ends: 97 [2018-10-27 05:42:58,598 INFO L605 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-10-27 05:42:58,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-27 05:42:58,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 83. [2018-10-27 05:42:58,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-27 05:42:58,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 104 transitions. [2018-10-27 05:42:58,615 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 104 transitions. Word has length 21 [2018-10-27 05:42:58,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:42:58,616 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 104 transitions. [2018-10-27 05:42:58,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 05:42:58,616 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 104 transitions. [2018-10-27 05:42:58,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-27 05:42:58,617 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:42:58,617 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:42:58,617 INFO L424 AbstractCegarLoop]: === Iteration 7 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:42:58,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:42:58,618 INFO L82 PathProgramCache]: Analyzing trace with hash 838473927, now seen corresponding path program 1 times [2018-10-27 05:42:58,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:42:58,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:42:58,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:42:58,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:42:58,619 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:42:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:42:58,665 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:42:58,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:42:58,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 05:42:58,665 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:42:58,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 05:42:58,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 05:42:58,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 05:42:58,666 INFO L87 Difference]: Start difference. First operand 83 states and 104 transitions. Second operand 5 states. [2018-10-27 05:42:58,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:42:58,766 INFO L93 Difference]: Finished difference Result 129 states and 163 transitions. [2018-10-27 05:42:58,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 05:42:58,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-10-27 05:42:58,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:42:58,767 INFO L225 Difference]: With dead ends: 129 [2018-10-27 05:42:58,768 INFO L226 Difference]: Without dead ends: 79 [2018-10-27 05:42:58,769 INFO L605 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-10-27 05:42:58,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-27 05:42:58,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-10-27 05:42:58,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-27 05:42:58,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 96 transitions. [2018-10-27 05:42:58,782 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 96 transitions. Word has length 23 [2018-10-27 05:42:58,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:42:58,783 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 96 transitions. [2018-10-27 05:42:58,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 05:42:58,783 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2018-10-27 05:42:58,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-27 05:42:58,784 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:42:58,784 INFO L375 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-10-27 05:42:58,785 INFO L424 AbstractCegarLoop]: === Iteration 8 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:42:58,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:42:58,785 INFO L82 PathProgramCache]: Analyzing trace with hash 2032985165, now seen corresponding path program 1 times [2018-10-27 05:42:58,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:42:58,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:42:58,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:42:58,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:42:58,786 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:42:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:42:58,842 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 05:42:58,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:42:58,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 05:42:58,843 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:42:58,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 05:42:58,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 05:42:58,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 05:42:58,844 INFO L87 Difference]: Start difference. First operand 77 states and 96 transitions. Second operand 5 states. [2018-10-27 05:42:59,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:42:59,212 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2018-10-27 05:42:59,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 05:42:59,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-10-27 05:42:59,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:42:59,214 INFO L225 Difference]: With dead ends: 102 [2018-10-27 05:42:59,214 INFO L226 Difference]: Without dead ends: 101 [2018-10-27 05:42:59,215 INFO L605 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-10-27 05:42:59,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-27 05:42:59,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2018-10-27 05:42:59,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-27 05:42:59,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 125 transitions. [2018-10-27 05:42:59,233 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 125 transitions. Word has length 25 [2018-10-27 05:42:59,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:42:59,234 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 125 transitions. [2018-10-27 05:42:59,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 05:42:59,234 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 125 transitions. [2018-10-27 05:42:59,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-27 05:42:59,235 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:42:59,235 INFO L375 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-10-27 05:42:59,236 INFO L424 AbstractCegarLoop]: === Iteration 9 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:42:59,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:42:59,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1980125912, now seen corresponding path program 1 times [2018-10-27 05:42:59,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:42:59,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:42:59,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:42:59,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:42:59,238 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:42:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:42:59,320 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-27 05:42:59,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:42:59,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 05:42:59,321 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:42:59,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 05:42:59,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 05:42:59,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 05:42:59,322 INFO L87 Difference]: Start difference. First operand 98 states and 125 transitions. Second operand 5 states. [2018-10-27 05:42:59,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:42:59,426 INFO L93 Difference]: Finished difference Result 123 states and 155 transitions. [2018-10-27 05:42:59,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 05:42:59,427 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-10-27 05:42:59,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:42:59,428 INFO L225 Difference]: With dead ends: 123 [2018-10-27 05:42:59,428 INFO L226 Difference]: Without dead ends: 122 [2018-10-27 05:42:59,428 INFO L605 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-10-27 05:42:59,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-10-27 05:42:59,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2018-10-27 05:42:59,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-27 05:42:59,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 154 transitions. [2018-10-27 05:42:59,438 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 154 transitions. Word has length 31 [2018-10-27 05:42:59,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:42:59,439 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 154 transitions. [2018-10-27 05:42:59,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 05:42:59,439 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 154 transitions. [2018-10-27 05:42:59,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-27 05:42:59,440 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:42:59,440 INFO L375 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-10-27 05:42:59,441 INFO L424 AbstractCegarLoop]: === Iteration 10 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:42:59,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:42:59,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1444432349, now seen corresponding path program 1 times [2018-10-27 05:42:59,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:42:59,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:42:59,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:42:59,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:42:59,443 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:42:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:42:59,492 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-27 05:42:59,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:42:59,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 05:42:59,493 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:42:59,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 05:42:59,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 05:42:59,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 05:42:59,494 INFO L87 Difference]: Start difference. First operand 119 states and 154 transitions. Second operand 4 states. [2018-10-27 05:42:59,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:42:59,570 INFO L93 Difference]: Finished difference Result 132 states and 174 transitions. [2018-10-27 05:42:59,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 05:42:59,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-10-27 05:42:59,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:42:59,574 INFO L225 Difference]: With dead ends: 132 [2018-10-27 05:42:59,574 INFO L226 Difference]: Without dead ends: 131 [2018-10-27 05:42:59,574 INFO L605 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-10-27 05:42:59,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-10-27 05:42:59,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2018-10-27 05:42:59,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-27 05:42:59,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 162 transitions. [2018-10-27 05:42:59,595 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 162 transitions. Word has length 34 [2018-10-27 05:42:59,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:42:59,595 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 162 transitions. [2018-10-27 05:42:59,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 05:42:59,595 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 162 transitions. [2018-10-27 05:42:59,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-27 05:42:59,596 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:42:59,596 INFO L375 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-10-27 05:42:59,597 INFO L424 AbstractCegarLoop]: === Iteration 11 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:42:59,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:42:59,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1827729912, now seen corresponding path program 1 times [2018-10-27 05:42:59,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:42:59,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:42:59,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:42:59,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:42:59,599 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:42:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:42:59,666 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-27 05:42:59,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:42:59,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 05:42:59,667 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:42:59,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 05:42:59,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 05:42:59,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:42:59,668 INFO L87 Difference]: Start difference. First operand 127 states and 162 transitions. Second operand 3 states. [2018-10-27 05:42:59,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:42:59,725 INFO L93 Difference]: Finished difference Result 127 states and 162 transitions. [2018-10-27 05:42:59,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 05:42:59,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-10-27 05:42:59,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:42:59,727 INFO L225 Difference]: With dead ends: 127 [2018-10-27 05:42:59,727 INFO L226 Difference]: Without dead ends: 126 [2018-10-27 05:42:59,728 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:42:59,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-27 05:42:59,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-10-27 05:42:59,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-27 05:42:59,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 158 transitions. [2018-10-27 05:42:59,740 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 158 transitions. Word has length 35 [2018-10-27 05:42:59,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:42:59,741 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 158 transitions. [2018-10-27 05:42:59,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 05:42:59,742 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 158 transitions. [2018-10-27 05:42:59,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-27 05:42:59,743 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:42:59,743 INFO L375 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-10-27 05:42:59,744 INFO L424 AbstractCegarLoop]: === Iteration 12 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:42:59,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:42:59,744 INFO L82 PathProgramCache]: Analyzing trace with hash 324073318, now seen corresponding path program 1 times [2018-10-27 05:42:59,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:42:59,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:42:59,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:42:59,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:42:59,745 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:42:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:43:00,028 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-27 05:43:00,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:43:00,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 05:43:00,029 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:43:00,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 05:43:00,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 05:43:00,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 05:43:00,030 INFO L87 Difference]: Start difference. First operand 126 states and 158 transitions. Second operand 5 states. [2018-10-27 05:43:00,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:43:00,124 INFO L93 Difference]: Finished difference Result 126 states and 158 transitions. [2018-10-27 05:43:00,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 05:43:00,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-10-27 05:43:00,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:43:00,126 INFO L225 Difference]: With dead ends: 126 [2018-10-27 05:43:00,126 INFO L226 Difference]: Without dead ends: 125 [2018-10-27 05:43:00,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 05:43:00,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-27 05:43:00,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-10-27 05:43:00,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-27 05:43:00,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 156 transitions. [2018-10-27 05:43:00,139 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 156 transitions. Word has length 40 [2018-10-27 05:43:00,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:43:00,139 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 156 transitions. [2018-10-27 05:43:00,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 05:43:00,140 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 156 transitions. [2018-10-27 05:43:00,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-27 05:43:00,141 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:43:00,141 INFO L375 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-10-27 05:43:00,142 INFO L424 AbstractCegarLoop]: === Iteration 13 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:43:00,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:43:00,142 INFO L82 PathProgramCache]: Analyzing trace with hash 364458084, now seen corresponding path program 1 times [2018-10-27 05:43:00,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:43:00,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:43:00,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:43:00,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:43:00,143 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:43:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:43:00,222 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-27 05:43:00,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:43:00,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 05:43:00,223 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:43:00,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 05:43:00,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 05:43:00,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 05:43:00,224 INFO L87 Difference]: Start difference. First operand 125 states and 156 transitions. Second operand 5 states. [2018-10-27 05:43:00,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:43:00,319 INFO L93 Difference]: Finished difference Result 125 states and 156 transitions. [2018-10-27 05:43:00,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 05:43:00,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-10-27 05:43:00,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:43:00,321 INFO L225 Difference]: With dead ends: 125 [2018-10-27 05:43:00,321 INFO L226 Difference]: Without dead ends: 124 [2018-10-27 05:43:00,322 INFO L605 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-10-27 05:43:00,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-27 05:43:00,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 110. [2018-10-27 05:43:00,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-27 05:43:00,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 134 transitions. [2018-10-27 05:43:00,329 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 134 transitions. Word has length 45 [2018-10-27 05:43:00,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:43:00,330 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 134 transitions. [2018-10-27 05:43:00,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 05:43:00,330 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2018-10-27 05:43:00,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-27 05:43:00,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:43:00,335 INFO L375 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-10-27 05:43:00,336 INFO L424 AbstractCegarLoop]: === Iteration 14 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:43:00,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:43:00,336 INFO L82 PathProgramCache]: Analyzing trace with hash -921113151, now seen corresponding path program 1 times [2018-10-27 05:43:00,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:43:00,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:43:00,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:43:00,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:43:00,338 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:43:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:43:00,427 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-27 05:43:00,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:43:00,428 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:43:00,429 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 48 with the following transitions: [2018-10-27 05:43:00,430 INFO L202 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-10-27 05:43:00,467 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:43:00,468 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:43:00,778 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:43:00,779 INFO L272 AbstractInterpreter]: Visited 34 different actions 150 times. Merged at 11 different actions 22 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 6 variables. [2018-10-27 05:43:00,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:43:00,802 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:43:00,965 INFO L227 lantSequenceWeakener]: Weakened 31 states. On average, predicates are now at 63.12% of their original sizes. [2018-10-27 05:43:00,966 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:43:02,955 INFO L415 sIntCurrentIteration]: We unified 46 AI predicates to 46 [2018-10-27 05:43:02,955 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:43:02,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:43:02,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [8] total 29 [2018-10-27 05:43:02,956 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:43:02,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-27 05:43:02,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-27 05:43:02,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2018-10-27 05:43:02,957 INFO L87 Difference]: Start difference. First operand 110 states and 134 transitions. Second operand 23 states. [2018-10-27 05:43:07,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:43:07,347 INFO L93 Difference]: Finished difference Result 160 states and 196 transitions. [2018-10-27 05:43:07,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-27 05:43:07,347 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 47 [2018-10-27 05:43:07,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:43:07,348 INFO L225 Difference]: With dead ends: 160 [2018-10-27 05:43:07,349 INFO L226 Difference]: Without dead ends: 64 [2018-10-27 05:43:07,350 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 66 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=214, Invalid=1592, Unknown=0, NotChecked=0, Total=1806 [2018-10-27 05:43:07,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-27 05:43:07,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-10-27 05:43:07,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-27 05:43:07,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2018-10-27 05:43:07,361 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 47 [2018-10-27 05:43:07,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:43:07,363 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2018-10-27 05:43:07,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-27 05:43:07,364 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-10-27 05:43:07,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-27 05:43:07,367 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:43:07,367 INFO L375 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-10-27 05:43:07,368 INFO L424 AbstractCegarLoop]: === Iteration 15 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:43:07,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:43:07,369 INFO L82 PathProgramCache]: Analyzing trace with hash -922396984, now seen corresponding path program 1 times [2018-10-27 05:43:07,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:43:07,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:43:07,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:43:07,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:43:07,373 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:43:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:43:07,449 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-27 05:43:07,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:43:07,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 05:43:07,449 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:43:07,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 05:43:07,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 05:43:07,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:43:07,450 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 3 states. [2018-10-27 05:43:07,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:43:07,457 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2018-10-27 05:43:07,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 05:43:07,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-10-27 05:43:07,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:43:07,458 INFO L225 Difference]: With dead ends: 62 [2018-10-27 05:43:07,458 INFO L226 Difference]: Without dead ends: 61 [2018-10-27 05:43:07,458 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:43:07,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-27 05:43:07,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-10-27 05:43:07,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-27 05:43:07,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-10-27 05:43:07,466 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 47 [2018-10-27 05:43:07,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:43:07,467 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-10-27 05:43:07,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 05:43:07,467 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-10-27 05:43:07,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-27 05:43:07,468 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:43:07,468 INFO L375 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-10-27 05:43:07,468 INFO L424 AbstractCegarLoop]: === Iteration 16 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:43:07,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:43:07,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1470464639, now seen corresponding path program 1 times [2018-10-27 05:43:07,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:43:07,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:43:07,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:43:07,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:43:07,469 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:43:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:43:07,507 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-27 05:43:07,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:43:07,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 05:43:07,507 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:43:07,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 05:43:07,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 05:43:07,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 05:43:07,508 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 4 states. [2018-10-27 05:43:07,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:43:07,517 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2018-10-27 05:43:07,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 05:43:07,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-10-27 05:43:07,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:43:07,519 INFO L225 Difference]: With dead ends: 61 [2018-10-27 05:43:07,519 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 05:43:07,519 INFO L605 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-10-27 05:43:07,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 05:43:07,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 05:43:07,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 05:43:07,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 05:43:07,520 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2018-10-27 05:43:07,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:43:07,520 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 05:43:07,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 05:43:07,520 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 05:43:07,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 05:43:07,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 05:43:08,009 WARN L179 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 27 [2018-10-27 05:43:08,215 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 32 [2018-10-27 05:43:08,257 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-27 05:43:08,257 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 05:43:08,257 INFO L425 ceAbstractionStarter]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-10-27 05:43:08,257 INFO L425 ceAbstractionStarter]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-10-27 05:43:08,257 INFO L425 ceAbstractionStarter]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2018-10-27 05:43:08,257 INFO L425 ceAbstractionStarter]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2018-10-27 05:43:08,258 INFO L425 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-10-27 05:43:08,258 INFO L428 ceAbstractionStarter]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2018-10-27 05:43:08,258 INFO L425 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2018-10-27 05:43:08,258 INFO L425 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2018-10-27 05:43:08,258 INFO L421 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: (let ((.cse1 (* 2 |rec1_#in~i|))) (and (let ((.cse0 (+ .cse1 2))) (or (< 0 .cse0) (< .cse0 0))) (not (= |rec1_#in~i| 0)) (or (= rec1_~i |rec1_#in~i|) (< .cse1 2) (< 4294967294 .cse1)))) [2018-10-27 05:43:08,258 INFO L425 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2018-10-27 05:43:08,258 INFO L425 ceAbstractionStarter]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-10-27 05:43:08,258 INFO L425 ceAbstractionStarter]: For program point L14-4(line 14) no Hoare annotation was computed. [2018-10-27 05:43:08,258 INFO L425 ceAbstractionStarter]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-10-27 05:43:08,258 INFO L425 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2018-10-27 05:43:08,259 INFO L421 ceAbstractionStarter]: At program point L14-6(line 14) the Hoare annotation is: (let ((.cse0 (* 2 |rec1_#in~i|))) (and (or (< .cse0 2) (or (= |rec1_#t~ret0| 0) (= |rec1_#t~ret0| 1)) (< 4294967294 .cse0)) (or (and (= rec1_~i |rec1_#in~i|) (<= 1 rec1_~i)) (< (+ .cse0 2) 0) (< 2147483647 |rec1_#in~i|)))) [2018-10-27 05:43:08,259 INFO L425 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2018-10-27 05:43:08,259 INFO L421 ceAbstractionStarter]: At program point L14-8(line 14) the Hoare annotation is: (let ((.cse1 (= rec1_~i |rec1_#in~i|)) (.cse0 (* 2 |rec1_#in~i|))) (and (or (< 4294967290 .cse0) (< (+ .cse0 2) 0) (and .cse1 (<= 1 rec1_~i))) (or (< .cse0 2) (let ((.cse2 (* 2 |rec1_#t~ret1|))) (and (or (= |rec1_#t~ret0| 0) (= |rec1_#t~ret0| 1)) .cse1 (<= 0 .cse2) (<= .cse2 0))) (< 4294967294 .cse0)))) [2018-10-27 05:43:08,259 INFO L425 ceAbstractionStarter]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-10-27 05:43:08,259 INFO L425 ceAbstractionStarter]: For program point L14-9(line 14) no Hoare annotation was computed. [2018-10-27 05:43:08,259 INFO L425 ceAbstractionStarter]: For program point L14-10(line 14) no Hoare annotation was computed. [2018-10-27 05:43:08,259 INFO L425 ceAbstractionStarter]: For program point L14-11(line 14) no Hoare annotation was computed. [2018-10-27 05:43:08,259 INFO L425 ceAbstractionStarter]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-10-27 05:43:08,259 INFO L425 ceAbstractionStarter]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2018-10-27 05:43:08,259 INFO L425 ceAbstractionStarter]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-10-27 05:43:08,260 INFO L425 ceAbstractionStarter]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-10-27 05:43:08,260 INFO L425 ceAbstractionStarter]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2018-10-27 05:43:08,260 INFO L421 ceAbstractionStarter]: At program point L20(line 20) the Hoare annotation is: (and (or (< (+ (* 2 |rec2_#in~j|) 4294967296) 0) (and (<= rec2_~j 2147483647) (<= 1 rec2_~j)) (< 2147483647 |rec2_#in~j|)) (not (= |rec2_#in~j| 0))) [2018-10-27 05:43:08,260 INFO L425 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-10-27 05:43:08,260 INFO L425 ceAbstractionStarter]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-10-27 05:43:08,260 INFO L425 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2018-10-27 05:43:08,260 INFO L425 ceAbstractionStarter]: For program point L20-2(line 20) no Hoare annotation was computed. [2018-10-27 05:43:08,260 INFO L425 ceAbstractionStarter]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-10-27 05:43:08,260 INFO L425 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-10-27 05:43:08,260 INFO L421 ceAbstractionStarter]: At program point L20-4(line 20) the Hoare annotation is: (and (or (let ((.cse0 (* 2 rec2_~j))) (and (<= .cse0 4294967294) (= |rec2_#t~ret3| 1) (<= 2 .cse0))) (< (+ (* 2 |rec2_#in~j|) 4294967296) 0) (< 2147483647 |rec2_#in~j|)) (not (= |rec2_#in~j| 0))) [2018-10-27 05:43:08,261 INFO L425 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2018-10-27 05:43:08,261 INFO L425 ceAbstractionStarter]: For program point L20-6(line 20) no Hoare annotation was computed. [2018-10-27 05:43:08,261 INFO L425 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2018-10-27 05:43:08,261 INFO L428 ceAbstractionStarter]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2018-10-27 05:43:08,261 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 05:43:08,261 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-27 05:43:08,261 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 05:43:08,261 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 05:43:08,261 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 23 26) the Hoare annotation is: true [2018-10-27 05:43:08,261 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 23 26) no Hoare annotation was computed. [2018-10-27 05:43:08,261 INFO L421 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (let ((.cse0 (* 2 main_~x~0))) (and (<= 0 (+ .cse0 4294967296)) (<= .cse0 4294967294))) [2018-10-27 05:43:08,261 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 23 26) no Hoare annotation was computed. [2018-10-27 05:43:08,262 INFO L425 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2018-10-27 05:43:08,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 05:43:08 BoogieIcfgContainer [2018-10-27 05:43:08,264 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 05:43:08,265 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 05:43:08,265 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 05:43:08,265 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 05:43:08,265 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:42:57" (3/4) ... [2018-10-27 05:43:08,269 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-27 05:43:08,275 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-27 05:43:08,275 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2018-10-27 05:43:08,275 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2018-10-27 05:43:08,275 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-27 05:43:08,279 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-10-27 05:43:08,280 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-10-27 05:43:08,280 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-27 05:43:08,335 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fc8ee96c-b6ad-4d76-b195-488b312ad216/bin-2019/utaipan/witness.graphml [2018-10-27 05:43:08,335 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 05:43:08,336 INFO L168 Benchmark]: Toolchain (without parser) took 12172.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 184.0 MB). Free memory was 960.7 MB in the beginning and 969.2 MB in the end (delta: -8.5 MB). Peak memory consumption was 175.5 MB. Max. memory is 11.5 GB. [2018-10-27 05:43:08,337 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 05:43:08,338 INFO L168 Benchmark]: CACSL2BoogieTranslator took 191.24 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 948.9 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-10-27 05:43:08,338 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.67 ms. Allocated memory is still 1.0 GB. Free memory is still 948.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 05:43:08,338 INFO L168 Benchmark]: Boogie Preprocessor took 19.67 ms. Allocated memory is still 1.0 GB. Free memory was 948.9 MB in the beginning and 946.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 05:43:08,339 INFO L168 Benchmark]: RCFGBuilder took 604.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -187.6 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2018-10-27 05:43:08,339 INFO L168 Benchmark]: TraceAbstraction took 11262.33 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 31.5 MB). Free memory was 1.1 GB in the beginning and 973.9 MB in the end (delta: 159.8 MB). Peak memory consumption was 191.3 MB. Max. memory is 11.5 GB. [2018-10-27 05:43:08,339 INFO L168 Benchmark]: Witness Printer took 70.55 ms. Allocated memory is still 1.2 GB. Free memory was 973.9 MB in the beginning and 969.2 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 11.5 GB. [2018-10-27 05:43:08,345 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 191.24 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 948.9 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.67 ms. Allocated memory is still 1.0 GB. Free memory is still 948.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.67 ms. Allocated memory is still 1.0 GB. Free memory was 948.9 MB in the beginning and 946.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 604.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -187.6 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11262.33 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 31.5 MB). Free memory was 1.1 GB in the beginning and 973.9 MB in the end (delta: 159.8 MB). Peak memory consumption was 191.3 MB. Max. memory is 11.5 GB. * Witness Printer took 70.55 ms. Allocated memory is still 1.2 GB. Free memory was 973.9 MB in the beginning and 969.2 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. 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, 11.1s OverallTime, 16 OverallIterations, 5 TraceHistogramMax, 6.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 682 SDtfs, 319 SDslu, 1450 SDs, 0 SdLazy, 388 SolverSat, 100 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 129 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.8985507246376809 AbsIntWeakeningRatio, 0.5434782608695652 AbsIntAvgWeakeningVarsNumRemoved, 4.043478260869565 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 69 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 115 PreInvPairs, 122 NumberOfFragments, 213 HoareAnnotationTreeSize, 115 FomulaSimplifications, 134 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 753 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 456 ConstructedInterpolants, 0 QuantifiedInterpolants, 21490 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 15 PerfectInterpolantSequences, 215/217 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...