./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted-lit/ChawdharyCookGulwaniSagivYang-ESOP2008-random2d_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/ChawdharyCookGulwaniSagivYang-ESOP2008-random2d_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/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 b0a853f0131530f88013a3fcfdf4f133f41c0569 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 21:29:48,723 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 21:29:48,724 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 21:29:48,731 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 21:29:48,731 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 21:29:48,731 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 21:29:48,732 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 21:29:48,733 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 21:29:48,733 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 21:29:48,734 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 21:29:48,734 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 21:29:48,734 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 21:29:48,735 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 21:29:48,735 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 21:29:48,736 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 21:29:48,736 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 21:29:48,737 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 21:29:48,738 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 21:29:48,738 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 21:29:48,739 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 21:29:48,740 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 21:29:48,740 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 21:29:48,742 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 21:29:48,742 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 21:29:48,742 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 21:29:48,742 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 21:29:48,743 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 21:29:48,743 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 21:29:48,744 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 21:29:48,744 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 21:29:48,744 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 21:29:48,745 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 21:29:48,745 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 21:29:48,745 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 21:29:48,745 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 21:29:48,746 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 21:29:48,746 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-12-02 21:29:48,753 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 21:29:48,754 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 21:29:48,754 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 21:29:48,754 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 21:29:48,754 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 21:29:48,754 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 21:29:48,754 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 21:29:48,754 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 21:29:48,755 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 21:29:48,755 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 21:29:48,755 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 21:29:48,755 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 21:29:48,755 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 21:29:48,755 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 21:29:48,755 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 21:29:48,755 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 21:29:48,756 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 21:29:48,756 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 21:29:48,756 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 21:29:48,756 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 21:29:48,756 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-12-02 21:29:48,756 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 21:29:48,756 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 21:29:48,756 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 21:29:48,756 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 21:29:48,756 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 21:29:48,756 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 21:29:48,756 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 21:29:48,757 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 21:29:48,757 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 21:29:48,757 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 21:29:48,757 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 21:29:48,757 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 21:29:48,757 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 21:29:48,757 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 21:29:48,757 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_4c4ec797-e884-4e81-a8ff-ae30c1910db1/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 -> b0a853f0131530f88013a3fcfdf4f133f41c0569 [2018-12-02 21:29:48,776 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 21:29:48,785 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 21:29:48,787 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 21:29:48,789 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 21:29:48,789 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 21:29:48,789 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted-lit/ChawdharyCookGulwaniSagivYang-ESOP2008-random2d_true-termination_true-no-overflow.c [2018-12-02 21:29:48,835 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/data/39fe7ecaf/9ca5d7e4c7f041528f46fee31af3f6ed/FLAGc1cf34c84 [2018-12-02 21:29:49,134 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 21:29:49,134 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/sv-benchmarks/c/termination-crafted-lit/ChawdharyCookGulwaniSagivYang-ESOP2008-random2d_true-termination_true-no-overflow.c [2018-12-02 21:29:49,138 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/data/39fe7ecaf/9ca5d7e4c7f041528f46fee31af3f6ed/FLAGc1cf34c84 [2018-12-02 21:29:49,146 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/data/39fe7ecaf/9ca5d7e4c7f041528f46fee31af3f6ed [2018-12-02 21:29:49,148 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 21:29:49,149 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 21:29:49,150 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 21:29:49,150 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 21:29:49,152 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 21:29:49,153 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:29:49" (1/1) ... [2018-12-02 21:29:49,155 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3033e242 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:29:49, skipping insertion in model container [2018-12-02 21:29:49,155 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:29:49" (1/1) ... [2018-12-02 21:29:49,160 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 21:29:49,171 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 21:29:49,259 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:29:49,261 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 21:29:49,270 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:29:49,278 INFO L195 MainTranslator]: Completed translation [2018-12-02 21:29:49,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:29:49 WrapperNode [2018-12-02 21:29:49,278 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 21:29:49,279 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 21:29:49,279 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 21:29:49,279 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 21:29:49,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:29:49" (1/1) ... [2018-12-02 21:29:49,286 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:29:49" (1/1) ... [2018-12-02 21:29:49,290 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 21:29:49,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 21:29:49,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 21:29:49,290 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 21:29:49,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:29:49" (1/1) ... [2018-12-02 21:29:49,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:29:49" (1/1) ... [2018-12-02 21:29:49,295 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:29:49" (1/1) ... [2018-12-02 21:29:49,296 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:29:49" (1/1) ... [2018-12-02 21:29:49,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:29:49" (1/1) ... [2018-12-02 21:29:49,329 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:29:49" (1/1) ... [2018-12-02 21:29:49,330 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:29:49" (1/1) ... [2018-12-02 21:29:49,331 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 21:29:49,331 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 21:29:49,331 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 21:29:49,331 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 21:29:49,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:29:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 21:29:49,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 21:29:49,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 21:29:49,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 21:29:49,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 21:29:49,365 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 21:29:49,366 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 21:29:49,474 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 21:29:49,474 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 21:29:49,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:29:49 BoogieIcfgContainer [2018-12-02 21:29:49,475 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 21:29:49,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 21:29:49,475 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 21:29:49,477 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 21:29:49,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:29:49" (1/3) ... [2018-12-02 21:29:49,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f17f9ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:29:49, skipping insertion in model container [2018-12-02 21:29:49,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:29:49" (2/3) ... [2018-12-02 21:29:49,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f17f9ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:29:49, skipping insertion in model container [2018-12-02 21:29:49,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:29:49" (3/3) ... [2018-12-02 21:29:49,479 INFO L112 eAbstractionObserver]: Analyzing ICFG ChawdharyCookGulwaniSagivYang-ESOP2008-random2d_true-termination_true-no-overflow.c [2018-12-02 21:29:49,484 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 21:29:49,489 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-12-02 21:29:49,498 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2018-12-02 21:29:49,516 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 21:29:49,516 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 21:29:49,516 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 21:29:49,516 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 21:29:49,516 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 21:29:49,517 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 21:29:49,517 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 21:29:49,517 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 21:29:49,526 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-12-02 21:29:49,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-02 21:29:49,529 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:29:49,530 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:29:49,531 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:29:49,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:49,534 INFO L82 PathProgramCache]: Analyzing trace with hash 252417093, now seen corresponding path program 1 times [2018-12-02 21:29:49,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:29:49,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:49,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:29:49,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:49,569 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:29:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:49,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:49,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:29:49,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 21:29:49,612 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:29:49,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:29:49,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:29:49,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:29:49,624 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2018-12-02 21:29:49,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:29:49,655 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2018-12-02 21:29:49,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:29:49,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-02 21:29:49,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:29:49,662 INFO L225 Difference]: With dead ends: 48 [2018-12-02 21:29:49,662 INFO L226 Difference]: Without dead ends: 34 [2018-12-02 21:29:49,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:29:49,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-02 21:29:49,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-12-02 21:29:49,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 21:29:49,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-12-02 21:29:49,685 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 7 [2018-12-02 21:29:49,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:29:49,685 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-12-02 21:29:49,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:29:49,686 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-12-02 21:29:49,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-02 21:29:49,686 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:29:49,686 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:29:49,686 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:29:49,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:49,687 INFO L82 PathProgramCache]: Analyzing trace with hash -765004662, now seen corresponding path program 1 times [2018-12-02 21:29:49,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:29:49,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:49,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:29:49,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:49,688 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:29:49,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:49,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:49,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:29:49,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 21:29:49,708 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:29:49,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:29:49,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:29:49,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:29:49,709 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 3 states. [2018-12-02 21:29:49,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:29:49,716 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-12-02 21:29:49,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:29:49,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-12-02 21:29:49,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:29:49,717 INFO L225 Difference]: With dead ends: 33 [2018-12-02 21:29:49,717 INFO L226 Difference]: Without dead ends: 32 [2018-12-02 21:29:49,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:29:49,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-02 21:29:49,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-02 21:29:49,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-02 21:29:49,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-12-02 21:29:49,720 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 8 [2018-12-02 21:29:49,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:29:49,720 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-12-02 21:29:49,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:29:49,720 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-12-02 21:29:49,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 21:29:49,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:29:49,721 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:29:49,721 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:29:49,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:49,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1157363318, now seen corresponding path program 1 times [2018-12-02 21:29:49,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:29:49,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:49,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:29:49,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:49,722 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:29:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:49,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:49,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:29:49,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 21:29:49,738 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:29:49,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:29:49,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:29:49,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:29:49,739 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 3 states. [2018-12-02 21:29:49,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:29:49,763 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2018-12-02 21:29:49,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:29:49,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-02 21:29:49,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:29:49,764 INFO L225 Difference]: With dead ends: 55 [2018-12-02 21:29:49,764 INFO L226 Difference]: Without dead ends: 53 [2018-12-02 21:29:49,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:29:49,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-02 21:29:49,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2018-12-02 21:29:49,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-02 21:29:49,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 63 transitions. [2018-12-02 21:29:49,768 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 63 transitions. Word has length 11 [2018-12-02 21:29:49,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:29:49,768 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 63 transitions. [2018-12-02 21:29:49,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:29:49,768 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2018-12-02 21:29:49,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 21:29:49,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:29:49,769 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:29:49,769 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:29:49,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:49,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1157326159, now seen corresponding path program 1 times [2018-12-02 21:29:49,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:29:49,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:49,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:29:49,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:49,771 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:29:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:49,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:29:49,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:49,790 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:29:49,790 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-02 21:29:49,791 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [14], [15], [17], [59], [66], [67], [68] [2018-12-02 21:29:49,809 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 21:29:49,810 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 21:29:49,890 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 21:29:49,891 INFO L272 AbstractInterpreter]: Visited 10 different actions 20 times. Merged at 4 different actions 8 times. Never widened. Performed 87 root evaluator evaluations with a maximum evaluation depth of 3. Performed 87 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2018-12-02 21:29:49,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:49,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 21:29:49,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:49,897 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:29:49,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:29:49,907 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:29:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:49,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:29:49,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:49,937 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:29:49,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:49,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:29:49,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2018-12-02 21:29:49,967 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:29:49,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:29:49,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:29:49,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:29:49,968 INFO L87 Difference]: Start difference. First operand 47 states and 63 transitions. Second operand 6 states. [2018-12-02 21:29:50,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:29:50,007 INFO L93 Difference]: Finished difference Result 108 states and 146 transitions. [2018-12-02 21:29:50,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:29:50,008 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-12-02 21:29:50,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:29:50,009 INFO L225 Difference]: With dead ends: 108 [2018-12-02 21:29:50,009 INFO L226 Difference]: Without dead ends: 107 [2018-12-02 21:29:50,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-12-02 21:29:50,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-02 21:29:50,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 44. [2018-12-02 21:29:50,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 21:29:50,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 59 transitions. [2018-12-02 21:29:50,016 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 59 transitions. Word has length 11 [2018-12-02 21:29:50,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:29:50,016 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 59 transitions. [2018-12-02 21:29:50,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:29:50,016 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2018-12-02 21:29:50,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-02 21:29:50,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:29:50,017 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:29:50,017 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:29:50,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:50,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1518524433, now seen corresponding path program 1 times [2018-12-02 21:29:50,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:29:50,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:50,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:29:50,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:50,019 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:29:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:50,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:50,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:29:50,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 21:29:50,040 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:29:50,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:29:50,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:29:50,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:29:50,041 INFO L87 Difference]: Start difference. First operand 44 states and 59 transitions. Second operand 3 states. [2018-12-02 21:29:50,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:29:50,060 INFO L93 Difference]: Finished difference Result 81 states and 113 transitions. [2018-12-02 21:29:50,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:29:50,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-02 21:29:50,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:29:50,061 INFO L225 Difference]: With dead ends: 81 [2018-12-02 21:29:50,062 INFO L226 Difference]: Without dead ends: 79 [2018-12-02 21:29:50,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:29:50,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-02 21:29:50,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2018-12-02 21:29:50,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-02 21:29:50,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 110 transitions. [2018-12-02 21:29:50,068 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 110 transitions. Word has length 12 [2018-12-02 21:29:50,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:29:50,068 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 110 transitions. [2018-12-02 21:29:50,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:29:50,068 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 110 transitions. [2018-12-02 21:29:50,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 21:29:50,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:29:50,068 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:29:50,069 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:29:50,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:50,069 INFO L82 PathProgramCache]: Analyzing trace with hash 170574579, now seen corresponding path program 1 times [2018-12-02 21:29:50,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:29:50,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:50,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:29:50,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:50,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:29:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:50,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:50,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:29:50,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 21:29:50,084 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:29:50,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:29:50,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:29:50,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:29:50,085 INFO L87 Difference]: Start difference. First operand 75 states and 110 transitions. Second operand 3 states. [2018-12-02 21:29:50,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:29:50,106 INFO L93 Difference]: Finished difference Result 143 states and 215 transitions. [2018-12-02 21:29:50,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:29:50,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-02 21:29:50,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:29:50,108 INFO L225 Difference]: With dead ends: 143 [2018-12-02 21:29:50,108 INFO L226 Difference]: Without dead ends: 141 [2018-12-02 21:29:50,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:29:50,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-02 21:29:50,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 133. [2018-12-02 21:29:50,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-02 21:29:50,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 199 transitions. [2018-12-02 21:29:50,118 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 199 transitions. Word has length 13 [2018-12-02 21:29:50,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:29:50,118 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 199 transitions. [2018-12-02 21:29:50,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:29:50,118 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 199 transitions. [2018-12-02 21:29:50,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 21:29:50,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:29:50,119 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:29:50,119 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:29:50,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:50,119 INFO L82 PathProgramCache]: Analyzing trace with hash 992844728, now seen corresponding path program 1 times [2018-12-02 21:29:50,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:29:50,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:50,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:29:50,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:50,120 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:29:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:50,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:50,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:29:50,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 21:29:50,135 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:29:50,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:29:50,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:29:50,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:29:50,135 INFO L87 Difference]: Start difference. First operand 133 states and 199 transitions. Second operand 3 states. [2018-12-02 21:29:50,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:29:50,153 INFO L93 Difference]: Finished difference Result 259 states and 393 transitions. [2018-12-02 21:29:50,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:29:50,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-02 21:29:50,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:29:50,154 INFO L225 Difference]: With dead ends: 259 [2018-12-02 21:29:50,154 INFO L226 Difference]: Without dead ends: 257 [2018-12-02 21:29:50,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:29:50,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-12-02 21:29:50,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 253. [2018-12-02 21:29:50,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-12-02 21:29:50,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 381 transitions. [2018-12-02 21:29:50,166 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 381 transitions. Word has length 14 [2018-12-02 21:29:50,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:29:50,167 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 381 transitions. [2018-12-02 21:29:50,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:29:50,167 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 381 transitions. [2018-12-02 21:29:50,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 21:29:50,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:29:50,167 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:29:50,168 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:29:50,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:50,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1784292138, now seen corresponding path program 1 times [2018-12-02 21:29:50,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:29:50,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:50,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:29:50,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:50,169 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:29:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:50,187 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:50,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:50,188 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:29:50,188 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-02 21:29:50,188 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [15], [17], [20], [23], [24], [25], [27], [66], [67], [68] [2018-12-02 21:29:50,189 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 21:29:50,189 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 21:29:50,224 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 21:29:50,224 INFO L272 AbstractInterpreter]: Visited 13 different actions 37 times. Merged at 7 different actions 21 times. Never widened. Performed 186 root evaluator evaluations with a maximum evaluation depth of 3. Performed 186 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 6 variables. [2018-12-02 21:29:50,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:50,226 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 21:29:50,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:50,226 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:29:50,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:29:50,235 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:29:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:50,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:29:50,244 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:50,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:29:50,263 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:50,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:29:50,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-02 21:29:50,277 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:29:50,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 21:29:50,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 21:29:50,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:29:50,278 INFO L87 Difference]: Start difference. First operand 253 states and 381 transitions. Second operand 4 states. [2018-12-02 21:29:50,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:29:50,307 INFO L93 Difference]: Finished difference Result 453 states and 692 transitions. [2018-12-02 21:29:50,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 21:29:50,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-02 21:29:50,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:29:50,309 INFO L225 Difference]: With dead ends: 453 [2018-12-02 21:29:50,309 INFO L226 Difference]: Without dead ends: 451 [2018-12-02 21:29:50,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:29:50,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-12-02 21:29:50,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 361. [2018-12-02 21:29:50,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-12-02 21:29:50,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 547 transitions. [2018-12-02 21:29:50,329 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 547 transitions. Word has length 18 [2018-12-02 21:29:50,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:29:50,329 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 547 transitions. [2018-12-02 21:29:50,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 21:29:50,330 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 547 transitions. [2018-12-02 21:29:50,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 21:29:50,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:29:50,330 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:29:50,330 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:29:50,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:50,331 INFO L82 PathProgramCache]: Analyzing trace with hash -457667387, now seen corresponding path program 1 times [2018-12-02 21:29:50,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:29:50,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:50,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:29:50,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:50,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:29:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:50,349 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:50,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:50,349 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:29:50,349 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-02 21:29:50,349 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [15], [17], [20], [23], [25], [26], [29], [32], [34], [36], [66], [67], [68] [2018-12-02 21:29:50,350 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 21:29:50,350 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 21:29:50,400 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 21:29:50,401 INFO L272 AbstractInterpreter]: Visited 16 different actions 60 times. Merged at 11 different actions 41 times. Never widened. Performed 290 root evaluator evaluations with a maximum evaluation depth of 3. Performed 290 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 6 variables. [2018-12-02 21:29:50,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:50,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 21:29:50,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:50,403 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:29:50,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:29:50,410 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:29:50,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:50,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:29:50,424 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:50,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:29:50,446 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:50,460 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 21:29:50,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [3] total 5 [2018-12-02 21:29:50,460 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:29:50,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:29:50,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:29:50,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:29:50,461 INFO L87 Difference]: Start difference. First operand 361 states and 547 transitions. Second operand 3 states. [2018-12-02 21:29:50,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:29:50,474 INFO L93 Difference]: Finished difference Result 361 states and 547 transitions. [2018-12-02 21:29:50,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:29:50,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-02 21:29:50,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:29:50,476 INFO L225 Difference]: With dead ends: 361 [2018-12-02 21:29:50,476 INFO L226 Difference]: Without dead ends: 360 [2018-12-02 21:29:50,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:29:50,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-12-02 21:29:50,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2018-12-02 21:29:50,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-12-02 21:29:50,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 539 transitions. [2018-12-02 21:29:50,487 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 539 transitions. Word has length 20 [2018-12-02 21:29:50,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:29:50,488 INFO L480 AbstractCegarLoop]: Abstraction has 360 states and 539 transitions. [2018-12-02 21:29:50,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:29:50,488 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 539 transitions. [2018-12-02 21:29:50,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 21:29:50,488 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:29:50,488 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:29:50,489 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:29:50,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:50,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1302601353, now seen corresponding path program 1 times [2018-12-02 21:29:50,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:29:50,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:50,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:29:50,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:50,491 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:29:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:50,521 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:50,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:50,521 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:29:50,521 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-02 21:29:50,521 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [15], [17], [20], [29], [32], [34], [35], [36], [66], [67], [68] [2018-12-02 21:29:50,522 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 21:29:50,523 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 21:29:50,560 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 21:29:50,560 INFO L272 AbstractInterpreter]: Visited 14 different actions 41 times. Merged at 8 different actions 24 times. Never widened. Performed 198 root evaluator evaluations with a maximum evaluation depth of 3. Performed 198 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 6 variables. [2018-12-02 21:29:50,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:50,562 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 21:29:50,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:50,562 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:29:50,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:29:50,569 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:29:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:50,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:29:50,578 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:50,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:29:50,589 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:50,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:29:50,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-02 21:29:50,603 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:29:50,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 21:29:50,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 21:29:50,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:29:50,604 INFO L87 Difference]: Start difference. First operand 360 states and 539 transitions. Second operand 4 states. [2018-12-02 21:29:50,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:29:50,634 INFO L93 Difference]: Finished difference Result 613 states and 923 transitions. [2018-12-02 21:29:50,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 21:29:50,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-12-02 21:29:50,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:29:50,635 INFO L225 Difference]: With dead ends: 613 [2018-12-02 21:29:50,636 INFO L226 Difference]: Without dead ends: 612 [2018-12-02 21:29:50,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:29:50,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2018-12-02 21:29:50,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 468. [2018-12-02 21:29:50,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-12-02 21:29:50,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 705 transitions. [2018-12-02 21:29:50,648 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 705 transitions. Word has length 21 [2018-12-02 21:29:50,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:29:50,648 INFO L480 AbstractCegarLoop]: Abstraction has 468 states and 705 transitions. [2018-12-02 21:29:50,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 21:29:50,648 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 705 transitions. [2018-12-02 21:29:50,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 21:29:50,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:29:50,649 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:29:50,649 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:29:50,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:50,649 INFO L82 PathProgramCache]: Analyzing trace with hash -789737976, now seen corresponding path program 1 times [2018-12-02 21:29:50,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:29:50,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:50,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:29:50,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:50,650 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:29:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:50,670 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:50,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:50,671 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:29:50,671 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-12-02 21:29:50,671 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [15], [17], [20], [29], [38], [41], [42], [43], [45], [66], [67], [68] [2018-12-02 21:29:50,672 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 21:29:50,672 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 21:29:50,695 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 21:29:50,695 INFO L272 AbstractInterpreter]: Visited 15 different actions 45 times. Merged at 9 different actions 27 times. Never widened. Performed 210 root evaluator evaluations with a maximum evaluation depth of 3. Performed 210 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 6 variables. [2018-12-02 21:29:50,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:50,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 21:29:50,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:50,698 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:29:50,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:29:50,705 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:29:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:50,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:29:50,713 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:50,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:29:50,723 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:50,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:29:50,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-02 21:29:50,738 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:29:50,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 21:29:50,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 21:29:50,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:29:50,738 INFO L87 Difference]: Start difference. First operand 468 states and 705 transitions. Second operand 4 states. [2018-12-02 21:29:50,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:29:50,769 INFO L93 Difference]: Finished difference Result 838 states and 1288 transitions. [2018-12-02 21:29:50,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 21:29:50,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-12-02 21:29:50,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:29:50,771 INFO L225 Difference]: With dead ends: 838 [2018-12-02 21:29:50,771 INFO L226 Difference]: Without dead ends: 836 [2018-12-02 21:29:50,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:29:50,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2018-12-02 21:29:50,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 672. [2018-12-02 21:29:50,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2018-12-02 21:29:50,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1011 transitions. [2018-12-02 21:29:50,786 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1011 transitions. Word has length 22 [2018-12-02 21:29:50,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:29:50,786 INFO L480 AbstractCegarLoop]: Abstraction has 672 states and 1011 transitions. [2018-12-02 21:29:50,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 21:29:50,786 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1011 transitions. [2018-12-02 21:29:50,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 21:29:50,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:29:50,787 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:29:50,787 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:29:50,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:50,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1545985083, now seen corresponding path program 1 times [2018-12-02 21:29:50,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:29:50,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:50,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:29:50,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:50,788 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:29:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:50,800 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:50,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:50,801 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:29:50,801 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-02 21:29:50,801 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [15], [17], [20], [29], [38], [41], [43], [44], [47], [50], [52], [54], [66], [67], [68] [2018-12-02 21:29:50,802 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 21:29:50,802 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 21:29:50,834 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 21:29:50,834 INFO L272 AbstractInterpreter]: Visited 18 different actions 57 times. Merged at 12 different actions 36 times. Never widened. Performed 246 root evaluator evaluations with a maximum evaluation depth of 3. Performed 246 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 6 variables. [2018-12-02 21:29:50,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:50,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 21:29:50,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:50,836 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:29:50,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:29:50,842 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:29:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:50,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:29:50,857 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:50,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:29:50,871 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:50,885 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 21:29:50,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [3] total 5 [2018-12-02 21:29:50,885 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:29:50,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:29:50,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:29:50,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:29:50,886 INFO L87 Difference]: Start difference. First operand 672 states and 1011 transitions. Second operand 3 states. [2018-12-02 21:29:50,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:29:50,902 INFO L93 Difference]: Finished difference Result 672 states and 1011 transitions. [2018-12-02 21:29:50,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:29:50,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-02 21:29:50,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:29:50,904 INFO L225 Difference]: With dead ends: 672 [2018-12-02 21:29:50,904 INFO L226 Difference]: Without dead ends: 671 [2018-12-02 21:29:50,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:29:50,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2018-12-02 21:29:50,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2018-12-02 21:29:50,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2018-12-02 21:29:50,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 995 transitions. [2018-12-02 21:29:50,920 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 995 transitions. Word has length 24 [2018-12-02 21:29:50,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:29:50,920 INFO L480 AbstractCegarLoop]: Abstraction has 671 states and 995 transitions. [2018-12-02 21:29:50,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:29:50,920 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 995 transitions. [2018-12-02 21:29:50,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 21:29:50,921 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:29:50,921 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-02 21:29:50,921 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:29:50,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:50,921 INFO L82 PathProgramCache]: Analyzing trace with hash 582614026, now seen corresponding path program 2 times [2018-12-02 21:29:50,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:29:50,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:50,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:29:50,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:50,922 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:29:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:50,943 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:50,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:50,943 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:29:50,943 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:29:50,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:29:50,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:50,943 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:29:50,952 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:29:50,952 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:29:50,960 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 21:29:50,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:29:50,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:29:50,963 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:50,964 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:29:50,990 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:51,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:29:51,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-02 21:29:51,014 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:29:51,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:29:51,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:29:51,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:29:51,015 INFO L87 Difference]: Start difference. First operand 671 states and 995 transitions. Second operand 5 states. [2018-12-02 21:29:51,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:29:51,051 INFO L93 Difference]: Finished difference Result 1156 states and 1733 transitions. [2018-12-02 21:29:51,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:29:51,051 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-12-02 21:29:51,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:29:51,054 INFO L225 Difference]: With dead ends: 1156 [2018-12-02 21:29:51,054 INFO L226 Difference]: Without dead ends: 1154 [2018-12-02 21:29:51,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:29:51,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2018-12-02 21:29:51,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 917. [2018-12-02 21:29:51,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 917 states. [2018-12-02 21:29:51,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1355 transitions. [2018-12-02 21:29:51,076 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1355 transitions. Word has length 25 [2018-12-02 21:29:51,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:29:51,076 INFO L480 AbstractCegarLoop]: Abstraction has 917 states and 1355 transitions. [2018-12-02 21:29:51,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:29:51,076 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1355 transitions. [2018-12-02 21:29:51,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 21:29:51,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:29:51,077 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:29:51,077 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:29:51,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:51,077 INFO L82 PathProgramCache]: Analyzing trace with hash -680711543, now seen corresponding path program 1 times [2018-12-02 21:29:51,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:29:51,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:51,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:29:51,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:51,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:29:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:51,099 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:51,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:51,099 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:29:51,099 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-12-02 21:29:51,099 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [15], [17], [20], [29], [38], [47], [50], [52], [53], [54], [66], [67], [68] [2018-12-02 21:29:51,100 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 21:29:51,100 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 21:29:51,126 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 21:29:51,126 INFO L272 AbstractInterpreter]: Visited 16 different actions 60 times. Merged at 11 different actions 41 times. Never widened. Performed 290 root evaluator evaluations with a maximum evaluation depth of 3. Performed 290 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 6 variables. [2018-12-02 21:29:51,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:51,134 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 21:29:51,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:51,134 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:29:51,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:29:51,152 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:29:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:51,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:29:51,161 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:51,161 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:29:51,172 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:51,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:29:51,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-02 21:29:51,186 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:29:51,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 21:29:51,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 21:29:51,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:29:51,187 INFO L87 Difference]: Start difference. First operand 917 states and 1355 transitions. Second operand 4 states. [2018-12-02 21:29:51,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:29:51,217 INFO L93 Difference]: Finished difference Result 1561 states and 2332 transitions. [2018-12-02 21:29:51,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 21:29:51,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-12-02 21:29:51,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:29:51,220 INFO L225 Difference]: With dead ends: 1561 [2018-12-02 21:29:51,220 INFO L226 Difference]: Without dead ends: 1560 [2018-12-02 21:29:51,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:29:51,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2018-12-02 21:29:51,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1197. [2018-12-02 21:29:51,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2018-12-02 21:29:51,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1772 transitions. [2018-12-02 21:29:51,242 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1772 transitions. Word has length 25 [2018-12-02 21:29:51,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:29:51,242 INFO L480 AbstractCegarLoop]: Abstraction has 1197 states and 1772 transitions. [2018-12-02 21:29:51,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 21:29:51,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1772 transitions. [2018-12-02 21:29:51,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 21:29:51,243 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:29:51,243 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-12-02 21:29:51,243 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:29:51,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:51,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1259703649, now seen corresponding path program 2 times [2018-12-02 21:29:51,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:29:51,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:51,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:29:51,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:51,244 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:29:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:51,274 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:51,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:51,274 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:29:51,274 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:29:51,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:29:51,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:51,274 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:29:51,281 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:29:51,282 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:29:51,288 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 21:29:51,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:29:51,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:29:51,291 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:51,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:29:51,324 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:51,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:29:51,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-02 21:29:51,348 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:29:51,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:29:51,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:29:51,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:29:51,349 INFO L87 Difference]: Start difference. First operand 1197 states and 1772 transitions. Second operand 5 states. [2018-12-02 21:29:51,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:29:51,390 INFO L93 Difference]: Finished difference Result 1955 states and 2906 transitions. [2018-12-02 21:29:51,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:29:51,391 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-12-02 21:29:51,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:29:51,394 INFO L225 Difference]: With dead ends: 1955 [2018-12-02 21:29:51,394 INFO L226 Difference]: Without dead ends: 1954 [2018-12-02 21:29:51,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:29:51,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2018-12-02 21:29:51,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1433. [2018-12-02 21:29:51,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1433 states. [2018-12-02 21:29:51,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 2118 transitions. [2018-12-02 21:29:51,423 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 2118 transitions. Word has length 29 [2018-12-02 21:29:51,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:29:51,423 INFO L480 AbstractCegarLoop]: Abstraction has 1433 states and 2118 transitions. [2018-12-02 21:29:51,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:29:51,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 2118 transitions. [2018-12-02 21:29:51,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 21:29:51,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:29:51,424 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-02 21:29:51,424 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:29:51,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:51,424 INFO L82 PathProgramCache]: Analyzing trace with hash -886740333, now seen corresponding path program 2 times [2018-12-02 21:29:51,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:29:51,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:51,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:29:51,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:51,426 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:29:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:51,448 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:51,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:51,448 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:29:51,448 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:29:51,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:29:51,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:51,448 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:29:51,457 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:29:51,457 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:29:51,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 21:29:51,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:29:51,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:29:51,472 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:51,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:29:51,492 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:51,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:29:51,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-02 21:29:51,514 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:29:51,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:29:51,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:29:51,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:29:51,515 INFO L87 Difference]: Start difference. First operand 1433 states and 2118 transitions. Second operand 5 states. [2018-12-02 21:29:51,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:29:51,574 INFO L93 Difference]: Finished difference Result 2466 states and 3697 transitions. [2018-12-02 21:29:51,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:29:51,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-12-02 21:29:51,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:29:51,581 INFO L225 Difference]: With dead ends: 2466 [2018-12-02 21:29:51,582 INFO L226 Difference]: Without dead ends: 2464 [2018-12-02 21:29:51,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:29:51,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2018-12-02 21:29:51,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 1963. [2018-12-02 21:29:51,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2018-12-02 21:29:51,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 2886 transitions. [2018-12-02 21:29:51,636 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 2886 transitions. Word has length 31 [2018-12-02 21:29:51,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:29:51,636 INFO L480 AbstractCegarLoop]: Abstraction has 1963 states and 2886 transitions. [2018-12-02 21:29:51,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:29:51,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 2886 transitions. [2018-12-02 21:29:51,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 21:29:51,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:29:51,637 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2018-12-02 21:29:51,637 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:29:51,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:51,638 INFO L82 PathProgramCache]: Analyzing trace with hash -716039594, now seen corresponding path program 3 times [2018-12-02 21:29:51,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:29:51,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:51,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:29:51,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:51,639 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:29:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:51,680 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:51,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:51,680 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:29:51,680 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:29:51,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:29:51,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:51,681 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:29:51,689 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 21:29:51,689 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 21:29:51,697 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 21:29:51,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:29:51,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:29:51,701 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:51,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:29:51,734 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:51,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:29:51,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-02 21:29:51,750 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:29:51,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:29:51,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:29:51,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:29:51,751 INFO L87 Difference]: Start difference. First operand 1963 states and 2886 transitions. Second operand 6 states. [2018-12-02 21:29:51,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:29:51,841 INFO L93 Difference]: Finished difference Result 3177 states and 4736 transitions. [2018-12-02 21:29:51,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:29:51,842 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-12-02 21:29:51,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:29:51,850 INFO L225 Difference]: With dead ends: 3177 [2018-12-02 21:29:51,850 INFO L226 Difference]: Without dead ends: 3175 [2018-12-02 21:29:51,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:29:51,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3175 states. [2018-12-02 21:29:51,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3175 to 2567. [2018-12-02 21:29:51,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2567 states. [2018-12-02 21:29:51,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2567 states to 2567 states and 3753 transitions. [2018-12-02 21:29:51,907 INFO L78 Accepts]: Start accepts. Automaton has 2567 states and 3753 transitions. Word has length 32 [2018-12-02 21:29:51,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:29:51,907 INFO L480 AbstractCegarLoop]: Abstraction has 2567 states and 3753 transitions. [2018-12-02 21:29:51,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:29:51,907 INFO L276 IsEmpty]: Start isEmpty. Operand 2567 states and 3753 transitions. [2018-12-02 21:29:51,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 21:29:51,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:29:51,908 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-12-02 21:29:51,908 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:29:51,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:51,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1327564892, now seen corresponding path program 2 times [2018-12-02 21:29:51,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:29:51,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:51,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:29:51,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:51,909 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:29:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:51,933 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:51,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:51,933 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:29:51,933 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:29:51,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:29:51,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:51,933 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:29:51,943 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:29:51,943 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:29:51,951 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 21:29:51,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:29:51,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:29:51,954 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:51,954 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:29:51,974 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:51,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:29:51,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-02 21:29:51,999 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:29:51,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:29:51,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:29:51,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:29:51,999 INFO L87 Difference]: Start difference. First operand 2567 states and 3753 transitions. Second operand 5 states. [2018-12-02 21:29:52,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:29:52,082 INFO L93 Difference]: Finished difference Result 4186 states and 6159 transitions. [2018-12-02 21:29:52,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:29:52,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-12-02 21:29:52,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:29:52,092 INFO L225 Difference]: With dead ends: 4186 [2018-12-02 21:29:52,092 INFO L226 Difference]: Without dead ends: 4185 [2018-12-02 21:29:52,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:29:52,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4185 states. [2018-12-02 21:29:52,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4185 to 3075. [2018-12-02 21:29:52,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3075 states. [2018-12-02 21:29:52,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3075 states to 3075 states and 4487 transitions. [2018-12-02 21:29:52,152 INFO L78 Accepts]: Start accepts. Automaton has 3075 states and 4487 transitions. Word has length 35 [2018-12-02 21:29:52,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:29:52,152 INFO L480 AbstractCegarLoop]: Abstraction has 3075 states and 4487 transitions. [2018-12-02 21:29:52,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:29:52,153 INFO L276 IsEmpty]: Start isEmpty. Operand 3075 states and 4487 transitions. [2018-12-02 21:29:52,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 21:29:52,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:29:52,154 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2018-12-02 21:29:52,154 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:29:52,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:52,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1468116811, now seen corresponding path program 3 times [2018-12-02 21:29:52,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:29:52,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:52,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:29:52,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:52,155 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:29:52,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:52,184 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:52,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:52,184 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:29:52,184 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:29:52,184 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:29:52,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:52,185 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:29:52,194 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 21:29:52,194 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 21:29:52,205 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 21:29:52,206 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:29:52,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:29:52,213 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:52,213 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:29:52,246 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:52,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:29:52,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-02 21:29:52,261 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:29:52,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:29:52,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:29:52,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:29:52,262 INFO L87 Difference]: Start difference. First operand 3075 states and 4487 transitions. Second operand 6 states. [2018-12-02 21:29:52,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:29:52,362 INFO L93 Difference]: Finished difference Result 4731 states and 6951 transitions. [2018-12-02 21:29:52,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:29:52,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-12-02 21:29:52,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:29:52,375 INFO L225 Difference]: With dead ends: 4731 [2018-12-02 21:29:52,375 INFO L226 Difference]: Without dead ends: 4730 [2018-12-02 21:29:52,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:29:52,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4730 states. [2018-12-02 21:29:52,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4730 to 3463. [2018-12-02 21:29:52,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3463 states. [2018-12-02 21:29:52,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3463 states to 3463 states and 5051 transitions. [2018-12-02 21:29:52,468 INFO L78 Accepts]: Start accepts. Automaton has 3463 states and 5051 transitions. Word has length 37 [2018-12-02 21:29:52,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:29:52,468 INFO L480 AbstractCegarLoop]: Abstraction has 3463 states and 5051 transitions. [2018-12-02 21:29:52,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:29:52,468 INFO L276 IsEmpty]: Start isEmpty. Operand 3463 states and 5051 transitions. [2018-12-02 21:29:52,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 21:29:52,469 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:29:52,469 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2018-12-02 21:29:52,469 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:29:52,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:52,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1042968950, now seen corresponding path program 4 times [2018-12-02 21:29:52,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:29:52,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:52,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:29:52,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:52,470 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:29:52,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:52,529 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:52,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:52,530 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:29:52,530 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:29:52,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:29:52,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:52,530 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:29:52,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:29:52,548 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:29:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:52,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:29:52,561 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:52,561 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:29:52,600 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:52,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:29:52,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-02 21:29:52,615 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:29:52,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 21:29:52,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 21:29:52,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-02 21:29:52,615 INFO L87 Difference]: Start difference. First operand 3463 states and 5051 transitions. Second operand 7 states. [2018-12-02 21:29:52,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:29:52,693 INFO L93 Difference]: Finished difference Result 5330 states and 7888 transitions. [2018-12-02 21:29:52,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 21:29:52,694 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-12-02 21:29:52,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:29:52,702 INFO L225 Difference]: With dead ends: 5330 [2018-12-02 21:29:52,702 INFO L226 Difference]: Without dead ends: 5328 [2018-12-02 21:29:52,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-02 21:29:52,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5328 states. [2018-12-02 21:29:52,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5328 to 4381. [2018-12-02 21:29:52,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4381 states. [2018-12-02 21:29:52,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4381 states to 4381 states and 6357 transitions. [2018-12-02 21:29:52,762 INFO L78 Accepts]: Start accepts. Automaton has 4381 states and 6357 transitions. Word has length 39 [2018-12-02 21:29:52,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:29:52,762 INFO L480 AbstractCegarLoop]: Abstraction has 4381 states and 6357 transitions. [2018-12-02 21:29:52,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 21:29:52,762 INFO L276 IsEmpty]: Start isEmpty. Operand 4381 states and 6357 transitions. [2018-12-02 21:29:52,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 21:29:52,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:29:52,763 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2018-12-02 21:29:52,763 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:29:52,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:52,763 INFO L82 PathProgramCache]: Analyzing trace with hash 535132776, now seen corresponding path program 3 times [2018-12-02 21:29:52,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:29:52,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:52,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:29:52,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:52,764 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:29:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:52,807 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:52,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:52,807 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:29:52,807 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:29:52,807 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:29:52,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:52,807 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:29:52,817 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 21:29:52,817 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 21:29:52,824 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 21:29:52,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:29:52,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:29:52,828 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:52,828 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:29:52,847 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:52,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:29:52,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-02 21:29:52,861 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:29:52,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:29:52,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:29:52,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:29:52,862 INFO L87 Difference]: Start difference. First operand 4381 states and 6357 transitions. Second operand 6 states. [2018-12-02 21:29:52,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:29:52,929 INFO L93 Difference]: Finished difference Result 7073 states and 10429 transitions. [2018-12-02 21:29:52,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:29:52,929 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-12-02 21:29:52,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:29:52,939 INFO L225 Difference]: With dead ends: 7073 [2018-12-02 21:29:52,939 INFO L226 Difference]: Without dead ends: 7071 [2018-12-02 21:29:52,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:29:52,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7071 states. [2018-12-02 21:29:53,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7071 to 5733. [2018-12-02 21:29:53,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5733 states. [2018-12-02 21:29:53,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5733 states to 5733 states and 8269 transitions. [2018-12-02 21:29:53,023 INFO L78 Accepts]: Start accepts. Automaton has 5733 states and 8269 transitions. Word has length 40 [2018-12-02 21:29:53,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:29:53,023 INFO L480 AbstractCegarLoop]: Abstraction has 5733 states and 8269 transitions. [2018-12-02 21:29:53,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:29:53,023 INFO L276 IsEmpty]: Start isEmpty. Operand 5733 states and 8269 transitions. [2018-12-02 21:29:53,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 21:29:53,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:29:53,025 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2018-12-02 21:29:53,025 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:29:53,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:53,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1865791691, now seen corresponding path program 4 times [2018-12-02 21:29:53,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:29:53,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:53,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:29:53,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:53,026 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:29:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:53,071 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:53,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:53,071 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:29:53,071 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:29:53,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:29:53,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:53,072 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:29:53,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:29:53,080 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:29:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:53,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:29:53,091 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:53,091 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:29:53,118 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:53,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:29:53,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-02 21:29:53,133 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:29:53,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 21:29:53,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 21:29:53,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-02 21:29:53,133 INFO L87 Difference]: Start difference. First operand 5733 states and 8269 transitions. Second operand 7 states. [2018-12-02 21:29:53,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:29:53,220 INFO L93 Difference]: Finished difference Result 8442 states and 12279 transitions. [2018-12-02 21:29:53,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 21:29:53,220 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-12-02 21:29:53,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:29:53,228 INFO L225 Difference]: With dead ends: 8442 [2018-12-02 21:29:53,228 INFO L226 Difference]: Without dead ends: 8441 [2018-12-02 21:29:53,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-02 21:29:53,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8441 states. [2018-12-02 21:29:53,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8441 to 6241. [2018-12-02 21:29:53,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6241 states. [2018-12-02 21:29:53,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6241 states to 6241 states and 9003 transitions. [2018-12-02 21:29:53,320 INFO L78 Accepts]: Start accepts. Automaton has 6241 states and 9003 transitions. Word has length 45 [2018-12-02 21:29:53,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:29:53,320 INFO L480 AbstractCegarLoop]: Abstraction has 6241 states and 9003 transitions. [2018-12-02 21:29:53,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 21:29:53,320 INFO L276 IsEmpty]: Start isEmpty. Operand 6241 states and 9003 transitions. [2018-12-02 21:29:53,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 21:29:53,321 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:29:53,321 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2018-12-02 21:29:53,321 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:29:53,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:53,321 INFO L82 PathProgramCache]: Analyzing trace with hash 702806639, now seen corresponding path program 3 times [2018-12-02 21:29:53,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:29:53,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:53,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:29:53,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:53,322 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:29:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:53,350 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:53,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:53,350 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:29:53,350 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:29:53,350 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:29:53,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:53,350 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:29:53,359 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 21:29:53,359 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 21:29:53,367 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 21:29:53,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:29:53,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:29:53,371 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:53,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:29:53,412 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:53,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:29:53,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-02 21:29:53,438 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:29:53,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:29:53,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:29:53,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:29:53,438 INFO L87 Difference]: Start difference. First operand 6241 states and 9003 transitions. Second operand 6 states. [2018-12-02 21:29:53,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:29:53,535 INFO L93 Difference]: Finished difference Result 9588 states and 13947 transitions. [2018-12-02 21:29:53,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:29:53,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-12-02 21:29:53,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:29:53,545 INFO L225 Difference]: With dead ends: 9588 [2018-12-02 21:29:53,545 INFO L226 Difference]: Without dead ends: 9587 [2018-12-02 21:29:53,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:29:53,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9587 states. [2018-12-02 21:29:53,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9587 to 7029. [2018-12-02 21:29:53,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7029 states. [2018-12-02 21:29:53,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7029 states to 7029 states and 10135 transitions. [2018-12-02 21:29:53,656 INFO L78 Accepts]: Start accepts. Automaton has 7029 states and 10135 transitions. Word has length 45 [2018-12-02 21:29:53,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:29:53,656 INFO L480 AbstractCegarLoop]: Abstraction has 7029 states and 10135 transitions. [2018-12-02 21:29:53,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:29:53,656 INFO L276 IsEmpty]: Start isEmpty. Operand 7029 states and 10135 transitions. [2018-12-02 21:29:53,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 21:29:53,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:29:53,657 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2018-12-02 21:29:53,657 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:29:53,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:53,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1845802966, now seen corresponding path program 5 times [2018-12-02 21:29:53,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:29:53,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:53,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:29:53,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:53,658 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:29:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:53,710 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:53,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:53,710 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:29:53,710 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:29:53,710 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:29:53,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:53,710 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:29:53,716 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:29:53,716 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:29:53,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-02 21:29:53,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:29:53,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:29:53,739 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:53,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:29:53,779 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:53,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:29:53,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-02 21:29:53,794 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:29:53,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 21:29:53,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 21:29:53,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-02 21:29:53,794 INFO L87 Difference]: Start difference. First operand 7029 states and 10135 transitions. Second operand 8 states. [2018-12-02 21:29:53,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:29:53,886 INFO L93 Difference]: Finished difference Result 10385 states and 15210 transitions. [2018-12-02 21:29:53,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 21:29:53,886 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-12-02 21:29:53,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:29:53,893 INFO L225 Difference]: With dead ends: 10385 [2018-12-02 21:29:53,893 INFO L226 Difference]: Without dead ends: 10383 [2018-12-02 21:29:53,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-02 21:29:53,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10383 states. [2018-12-02 21:29:53,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10383 to 8669. [2018-12-02 21:29:53,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8669 states. [2018-12-02 21:29:54,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8669 states to 8669 states and 12442 transitions. [2018-12-02 21:29:54,005 INFO L78 Accepts]: Start accepts. Automaton has 8669 states and 12442 transitions. Word has length 46 [2018-12-02 21:29:54,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:29:54,005 INFO L480 AbstractCegarLoop]: Abstraction has 8669 states and 12442 transitions. [2018-12-02 21:29:54,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 21:29:54,005 INFO L276 IsEmpty]: Start isEmpty. Operand 8669 states and 12442 transitions. [2018-12-02 21:29:54,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 21:29:54,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:29:54,006 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2018-12-02 21:29:54,006 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:29:54,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:54,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1310627277, now seen corresponding path program 4 times [2018-12-02 21:29:54,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:29:54,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:54,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:29:54,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:54,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:29:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:54,043 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:54,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:54,043 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:29:54,044 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:29:54,044 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:29:54,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:54,044 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:29:54,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:29:54,053 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:29:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:54,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:29:54,065 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:54,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:29:54,115 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:54,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:29:54,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-02 21:29:54,129 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:29:54,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 21:29:54,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 21:29:54,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-02 21:29:54,130 INFO L87 Difference]: Start difference. First operand 8669 states and 12442 transitions. Second operand 7 states. [2018-12-02 21:29:54,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:29:54,252 INFO L93 Difference]: Finished difference Result 13316 states and 19433 transitions. [2018-12-02 21:29:54,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 21:29:54,252 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-12-02 21:29:54,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:29:54,260 INFO L225 Difference]: With dead ends: 13316 [2018-12-02 21:29:54,260 INFO L226 Difference]: Without dead ends: 13314 [2018-12-02 21:29:54,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-02 21:29:54,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13314 states. [2018-12-02 21:29:54,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13314 to 10971. [2018-12-02 21:29:54,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10971 states. [2018-12-02 21:29:54,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10971 states to 10971 states and 15661 transitions. [2018-12-02 21:29:54,397 INFO L78 Accepts]: Start accepts. Automaton has 10971 states and 15661 transitions. Word has length 49 [2018-12-02 21:29:54,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:29:54,397 INFO L480 AbstractCegarLoop]: Abstraction has 10971 states and 15661 transitions. [2018-12-02 21:29:54,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 21:29:54,397 INFO L276 IsEmpty]: Start isEmpty. Operand 10971 states and 15661 transitions. [2018-12-02 21:29:54,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 21:29:54,398 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:29:54,398 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1] [2018-12-02 21:29:54,399 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:29:54,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:54,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1711194378, now seen corresponding path program 6 times [2018-12-02 21:29:54,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:29:54,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:54,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:29:54,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:54,400 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:29:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:54,443 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:54,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:54,443 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:29:54,443 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:29:54,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:29:54,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:54,443 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:29:54,453 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 21:29:54,454 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 21:29:54,464 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 21:29:54,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:29:54,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:29:54,470 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:54,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:29:54,536 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:54,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:29:54,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-02 21:29:54,551 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:29:54,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 21:29:54,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 21:29:54,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-02 21:29:54,552 INFO L87 Difference]: Start difference. First operand 10971 states and 15661 transitions. Second operand 9 states. [2018-12-02 21:29:54,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:29:54,684 INFO L93 Difference]: Finished difference Result 15626 states and 22669 transitions. [2018-12-02 21:29:54,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 21:29:54,685 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2018-12-02 21:29:54,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:29:54,696 INFO L225 Difference]: With dead ends: 15626 [2018-12-02 21:29:54,696 INFO L226 Difference]: Without dead ends: 15624 [2018-12-02 21:29:54,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-02 21:29:54,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15624 states. [2018-12-02 21:29:54,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15624 to 13095. [2018-12-02 21:29:54,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13095 states. [2018-12-02 21:29:54,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13095 states to 13095 states and 18613 transitions. [2018-12-02 21:29:54,873 INFO L78 Accepts]: Start accepts. Automaton has 13095 states and 18613 transitions. Word has length 53 [2018-12-02 21:29:54,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:29:54,873 INFO L480 AbstractCegarLoop]: Abstraction has 13095 states and 18613 transitions. [2018-12-02 21:29:54,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 21:29:54,873 INFO L276 IsEmpty]: Start isEmpty. Operand 13095 states and 18613 transitions. [2018-12-02 21:29:54,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 21:29:54,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:29:54,874 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1] [2018-12-02 21:29:54,874 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:29:54,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:54,874 INFO L82 PathProgramCache]: Analyzing trace with hash -434547425, now seen corresponding path program 5 times [2018-12-02 21:29:54,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:29:54,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:54,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:29:54,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:54,875 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:29:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:54,913 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:54,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:54,913 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:29:54,913 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:29:54,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:29:54,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:54,914 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:29:54,920 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:29:54,921 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:29:54,929 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-02 21:29:54,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:29:54,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:29:54,933 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:54,933 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:29:54,981 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:54,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:29:54,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-02 21:29:54,996 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:29:54,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 21:29:54,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 21:29:54,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-02 21:29:54,997 INFO L87 Difference]: Start difference. First operand 13095 states and 18613 transitions. Second operand 8 states. [2018-12-02 21:29:55,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:29:55,198 INFO L93 Difference]: Finished difference Result 19894 states and 28525 transitions. [2018-12-02 21:29:55,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 21:29:55,198 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-12-02 21:29:55,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:29:55,212 INFO L225 Difference]: With dead ends: 19894 [2018-12-02 21:29:55,212 INFO L226 Difference]: Without dead ends: 19893 [2018-12-02 21:29:55,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-02 21:29:55,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19893 states. [2018-12-02 21:29:55,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19893 to 14133. [2018-12-02 21:29:55,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14133 states. [2018-12-02 21:29:55,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14133 states to 14133 states and 20101 transitions. [2018-12-02 21:29:55,407 INFO L78 Accepts]: Start accepts. Automaton has 14133 states and 20101 transitions. Word has length 53 [2018-12-02 21:29:55,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:29:55,407 INFO L480 AbstractCegarLoop]: Abstraction has 14133 states and 20101 transitions. [2018-12-02 21:29:55,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 21:29:55,407 INFO L276 IsEmpty]: Start isEmpty. Operand 14133 states and 20101 transitions. [2018-12-02 21:29:55,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 21:29:55,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:29:55,408 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2018-12-02 21:29:55,408 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:29:55,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:55,409 INFO L82 PathProgramCache]: Analyzing trace with hash 941207746, now seen corresponding path program 4 times [2018-12-02 21:29:55,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:29:55,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:55,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:29:55,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:55,409 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:29:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:55,453 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:55,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:55,453 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:29:55,453 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:29:55,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:29:55,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:55,454 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:29:55,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:29:55,459 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:29:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:55,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:29:55,471 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:55,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:29:55,505 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:55,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:29:55,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-02 21:29:55,519 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:29:55,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 21:29:55,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 21:29:55,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-02 21:29:55,520 INFO L87 Difference]: Start difference. First operand 14133 states and 20101 transitions. Second operand 7 states. [2018-12-02 21:29:55,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:29:55,689 INFO L93 Difference]: Finished difference Result 20778 states and 29841 transitions. [2018-12-02 21:29:55,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 21:29:55,689 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2018-12-02 21:29:55,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:29:55,703 INFO L225 Difference]: With dead ends: 20778 [2018-12-02 21:29:55,703 INFO L226 Difference]: Without dead ends: 20777 [2018-12-02 21:29:55,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-02 21:29:55,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20777 states. [2018-12-02 21:29:55,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20777 to 15385. [2018-12-02 21:29:55,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15385 states. [2018-12-02 21:29:55,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15385 states to 15385 states and 21885 transitions. [2018-12-02 21:29:55,929 INFO L78 Accepts]: Start accepts. Automaton has 15385 states and 21885 transitions. Word has length 55 [2018-12-02 21:29:55,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:29:55,929 INFO L480 AbstractCegarLoop]: Abstraction has 15385 states and 21885 transitions. [2018-12-02 21:29:55,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 21:29:55,929 INFO L276 IsEmpty]: Start isEmpty. Operand 15385 states and 21885 transitions. [2018-12-02 21:29:55,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 21:29:55,930 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:29:55,930 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2018-12-02 21:29:55,930 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:29:55,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:55,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1897860808, now seen corresponding path program 5 times [2018-12-02 21:29:55,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:29:55,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:55,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:29:55,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:55,954 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:29:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:55,996 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:55,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:55,996 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:29:55,996 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:29:55,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:29:55,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:55,996 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:29:56,003 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:29:56,003 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:29:56,013 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-02 21:29:56,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:29:56,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:29:56,019 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:56,019 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:29:56,059 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:56,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:29:56,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-02 21:29:56,083 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:29:56,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 21:29:56,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 21:29:56,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-02 21:29:56,084 INFO L87 Difference]: Start difference. First operand 15385 states and 21885 transitions. Second operand 8 states. [2018-12-02 21:29:56,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:29:56,267 INFO L93 Difference]: Finished difference Result 22701 states and 32845 transitions. [2018-12-02 21:29:56,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 21:29:56,267 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-12-02 21:29:56,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:29:56,282 INFO L225 Difference]: With dead ends: 22701 [2018-12-02 21:29:56,282 INFO L226 Difference]: Without dead ends: 22699 [2018-12-02 21:29:56,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-02 21:29:56,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22699 states. [2018-12-02 21:29:56,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22699 to 18977. [2018-12-02 21:29:56,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18977 states. [2018-12-02 21:29:56,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18977 states to 18977 states and 26868 transitions. [2018-12-02 21:29:56,535 INFO L78 Accepts]: Start accepts. Automaton has 18977 states and 26868 transitions. Word has length 58 [2018-12-02 21:29:56,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:29:56,535 INFO L480 AbstractCegarLoop]: Abstraction has 18977 states and 26868 transitions. [2018-12-02 21:29:56,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 21:29:56,536 INFO L276 IsEmpty]: Start isEmpty. Operand 18977 states and 26868 transitions. [2018-12-02 21:29:56,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 21:29:56,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:29:56,537 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1] [2018-12-02 21:29:56,537 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:29:56,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:56,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1695921494, now seen corresponding path program 7 times [2018-12-02 21:29:56,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:29:56,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:56,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:29:56,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:56,538 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:29:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:56,604 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:56,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:56,605 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:29:56,605 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:29:56,605 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:29:56,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:56,605 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:29:56,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:29:56,613 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:29:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:56,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:29:56,626 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:56,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:29:56,697 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:56,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:29:56,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-02 21:29:56,712 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:29:56,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 21:29:56,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 21:29:56,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-02 21:29:56,713 INFO L87 Difference]: Start difference. First operand 18977 states and 26868 transitions. Second operand 10 states. [2018-12-02 21:29:56,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:29:56,933 INFO L93 Difference]: Finished difference Result 26255 states and 37782 transitions. [2018-12-02 21:29:56,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 21:29:56,933 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2018-12-02 21:29:56,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:29:56,956 INFO L225 Difference]: With dead ends: 26255 [2018-12-02 21:29:56,956 INFO L226 Difference]: Without dead ends: 26253 [2018-12-02 21:29:56,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-02 21:29:56,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26253 states. [2018-12-02 21:29:57,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26253 to 22315. [2018-12-02 21:29:57,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22315 states. [2018-12-02 21:29:57,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22315 states to 22315 states and 31477 transitions. [2018-12-02 21:29:57,289 INFO L78 Accepts]: Start accepts. Automaton has 22315 states and 31477 transitions. Word has length 60 [2018-12-02 21:29:57,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:29:57,289 INFO L480 AbstractCegarLoop]: Abstraction has 22315 states and 31477 transitions. [2018-12-02 21:29:57,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 21:29:57,289 INFO L276 IsEmpty]: Start isEmpty. Operand 22315 states and 31477 transitions. [2018-12-02 21:29:57,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 21:29:57,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:29:57,291 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1] [2018-12-02 21:29:57,291 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:29:57,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:57,291 INFO L82 PathProgramCache]: Analyzing trace with hash 2090391817, now seen corresponding path program 6 times [2018-12-02 21:29:57,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:29:57,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:57,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:29:57,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:57,292 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:29:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:57,343 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:57,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:57,343 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:29:57,343 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:29:57,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:29:57,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:57,343 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:29:57,351 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 21:29:57,351 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 21:29:57,369 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 21:29:57,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:29:57,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:29:57,374 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:57,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:29:57,418 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:57,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:29:57,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-02 21:29:57,433 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:29:57,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 21:29:57,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 21:29:57,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-02 21:29:57,433 INFO L87 Difference]: Start difference. First operand 22315 states and 31477 transitions. Second operand 9 states. [2018-12-02 21:29:57,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:29:57,682 INFO L93 Difference]: Finished difference Result 32959 states and 46936 transitions. [2018-12-02 21:29:57,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 21:29:57,683 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-12-02 21:29:57,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:29:57,708 INFO L225 Difference]: With dead ends: 32959 [2018-12-02 21:29:57,708 INFO L226 Difference]: Without dead ends: 32958 [2018-12-02 21:29:57,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-02 21:29:57,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32958 states. [2018-12-02 21:29:58,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32958 to 23709. [2018-12-02 21:29:58,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23709 states. [2018-12-02 21:29:58,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23709 states to 23709 states and 33466 transitions. [2018-12-02 21:29:58,109 INFO L78 Accepts]: Start accepts. Automaton has 23709 states and 33466 transitions. Word has length 61 [2018-12-02 21:29:58,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:29:58,109 INFO L480 AbstractCegarLoop]: Abstraction has 23709 states and 33466 transitions. [2018-12-02 21:29:58,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 21:29:58,109 INFO L276 IsEmpty]: Start isEmpty. Operand 23709 states and 33466 transitions. [2018-12-02 21:29:58,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 21:29:58,111 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:29:58,111 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1] [2018-12-02 21:29:58,111 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:29:58,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:58,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1521886379, now seen corresponding path program 5 times [2018-12-02 21:29:58,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:29:58,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:58,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:29:58,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:58,112 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:29:58,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:58,152 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:58,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:58,152 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:29:58,152 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:29:58,152 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:29:58,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:58,152 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:29:58,158 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:29:58,158 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:29:58,168 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-02 21:29:58,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:29:58,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:29:58,173 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:58,173 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:29:58,223 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:58,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:29:58,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-02 21:29:58,238 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:29:58,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 21:29:58,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 21:29:58,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-02 21:29:58,239 INFO L87 Difference]: Start difference. First operand 23709 states and 33466 transitions. Second operand 8 states. [2018-12-02 21:29:58,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:29:58,498 INFO L93 Difference]: Finished difference Result 33673 states and 48022 transitions. [2018-12-02 21:29:58,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 21:29:58,499 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2018-12-02 21:29:58,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:29:58,524 INFO L225 Difference]: With dead ends: 33673 [2018-12-02 21:29:58,524 INFO L226 Difference]: Without dead ends: 33672 [2018-12-02 21:29:58,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-02 21:29:58,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33672 states. [2018-12-02 21:29:58,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33672 to 25273. [2018-12-02 21:29:58,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25273 states. [2018-12-02 21:29:58,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25273 states to 25273 states and 35688 transitions. [2018-12-02 21:29:58,889 INFO L78 Accepts]: Start accepts. Automaton has 25273 states and 35688 transitions. Word has length 65 [2018-12-02 21:29:58,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:29:58,889 INFO L480 AbstractCegarLoop]: Abstraction has 25273 states and 35688 transitions. [2018-12-02 21:29:58,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 21:29:58,889 INFO L276 IsEmpty]: Start isEmpty. Operand 25273 states and 35688 transitions. [2018-12-02 21:29:58,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 21:29:58,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:29:58,891 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1] [2018-12-02 21:29:58,891 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:29:58,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:58,891 INFO L82 PathProgramCache]: Analyzing trace with hash -690121846, now seen corresponding path program 8 times [2018-12-02 21:29:58,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:29:58,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:58,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:29:58,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:58,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:29:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:58,951 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:58,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:58,951 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:29:58,951 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:29:58,951 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:29:58,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:58,951 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:29:58,958 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:29:58,958 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:29:58,977 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-02 21:29:58,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:29:58,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:29:58,985 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:58,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:29:59,075 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:59,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:29:59,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-02 21:29:59,090 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:29:59,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 21:29:59,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 21:29:59,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-02 21:29:59,090 INFO L87 Difference]: Start difference. First operand 25273 states and 35688 transitions. Second operand 11 states. [2018-12-02 21:29:59,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:29:59,382 INFO L93 Difference]: Finished difference Result 34134 states and 48972 transitions. [2018-12-02 21:29:59,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 21:29:59,382 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2018-12-02 21:29:59,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:29:59,412 INFO L225 Difference]: With dead ends: 34134 [2018-12-02 21:29:59,413 INFO L226 Difference]: Without dead ends: 34132 [2018-12-02 21:29:59,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-02 21:29:59,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34132 states. [2018-12-02 21:29:59,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34132 to 29349. [2018-12-02 21:29:59,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29349 states. [2018-12-02 21:29:59,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29349 states to 29349 states and 41310 transitions. [2018-12-02 21:29:59,860 INFO L78 Accepts]: Start accepts. Automaton has 29349 states and 41310 transitions. Word has length 67 [2018-12-02 21:29:59,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:29:59,860 INFO L480 AbstractCegarLoop]: Abstraction has 29349 states and 41310 transitions. [2018-12-02 21:29:59,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 21:29:59,860 INFO L276 IsEmpty]: Start isEmpty. Operand 29349 states and 41310 transitions. [2018-12-02 21:29:59,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 21:29:59,862 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:29:59,862 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1] [2018-12-02 21:29:59,862 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:29:59,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:29:59,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1044856365, now seen corresponding path program 6 times [2018-12-02 21:29:59,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:29:59,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:59,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:29:59,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:29:59,863 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:29:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:29:59,900 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:59,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:59,900 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:29:59,900 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:29:59,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:29:59,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:29:59,900 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:29:59,907 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 21:29:59,907 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 21:29:59,915 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 21:29:59,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:29:59,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:29:59,919 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:59,920 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:29:59,963 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:29:59,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:29:59,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-02 21:29:59,978 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:29:59,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 21:29:59,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 21:29:59,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-02 21:29:59,978 INFO L87 Difference]: Start difference. First operand 29349 states and 41310 transitions. Second operand 9 states. [2018-12-02 21:30:00,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:30:00,277 INFO L93 Difference]: Finished difference Result 41884 states and 59975 transitions. [2018-12-02 21:30:00,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 21:30:00,278 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2018-12-02 21:30:00,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:30:00,311 INFO L225 Difference]: With dead ends: 41884 [2018-12-02 21:30:00,311 INFO L226 Difference]: Without dead ends: 41882 [2018-12-02 21:30:00,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-02 21:30:00,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41882 states. [2018-12-02 21:30:00,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41882 to 35469. [2018-12-02 21:30:00,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35469 states. [2018-12-02 21:30:00,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35469 states to 35469 states and 49722 transitions. [2018-12-02 21:30:00,844 INFO L78 Accepts]: Start accepts. Automaton has 35469 states and 49722 transitions. Word has length 67 [2018-12-02 21:30:00,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:30:00,844 INFO L480 AbstractCegarLoop]: Abstraction has 35469 states and 49722 transitions. [2018-12-02 21:30:00,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 21:30:00,844 INFO L276 IsEmpty]: Start isEmpty. Operand 35469 states and 49722 transitions. [2018-12-02 21:30:00,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 21:30:00,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:30:00,847 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1] [2018-12-02 21:30:00,847 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:30:00,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:30:00,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1351429389, now seen corresponding path program 7 times [2018-12-02 21:30:00,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:30:00,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:00,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:30:00,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:00,848 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:30:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:00,890 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:00,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:30:00,890 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:30:00,890 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:30:00,891 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:30:00,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:30:00,891 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:30:00,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:30:00,897 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:30:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:00,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:30:00,913 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:00,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:30:00,974 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:00,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:30:00,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-02 21:30:00,989 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:30:00,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 21:30:00,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 21:30:00,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-02 21:30:00,990 INFO L87 Difference]: Start difference. First operand 35469 states and 49722 transitions. Second operand 10 states. [2018-12-02 21:30:01,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:30:01,366 INFO L93 Difference]: Finished difference Result 51133 states and 72401 transitions. [2018-12-02 21:30:01,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 21:30:01,366 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 69 [2018-12-02 21:30:01,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:30:01,409 INFO L225 Difference]: With dead ends: 51133 [2018-12-02 21:30:01,409 INFO L226 Difference]: Without dead ends: 51132 [2018-12-02 21:30:01,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-02 21:30:01,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51132 states. [2018-12-02 21:30:01,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51132 to 37265. [2018-12-02 21:30:01,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37265 states. [2018-12-02 21:30:01,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37265 states to 37265 states and 52275 transitions. [2018-12-02 21:30:01,998 INFO L78 Accepts]: Start accepts. Automaton has 37265 states and 52275 transitions. Word has length 69 [2018-12-02 21:30:01,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:30:01,998 INFO L480 AbstractCegarLoop]: Abstraction has 37265 states and 52275 transitions. [2018-12-02 21:30:01,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 21:30:01,998 INFO L276 IsEmpty]: Start isEmpty. Operand 37265 states and 52275 transitions. [2018-12-02 21:30:02,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 21:30:02,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:30:02,001 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1] [2018-12-02 21:30:02,001 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:30:02,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:30:02,001 INFO L82 PathProgramCache]: Analyzing trace with hash -2049109290, now seen corresponding path program 9 times [2018-12-02 21:30:02,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:30:02,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:02,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:30:02,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:02,002 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:30:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:02,062 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:02,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:30:02,062 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:30:02,063 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:30:02,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:30:02,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:30:02,063 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:30:02,069 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 21:30:02,069 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 21:30:02,081 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 21:30:02,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:30:02,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:30:02,089 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:02,089 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:30:02,211 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:02,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:30:02,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-02 21:30:02,226 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:30:02,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 21:30:02,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 21:30:02,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-02 21:30:02,226 INFO L87 Difference]: Start difference. First operand 37265 states and 52275 transitions. Second operand 12 states. [2018-12-02 21:30:02,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:30:02,596 INFO L93 Difference]: Finished difference Result 49303 states and 70258 transitions. [2018-12-02 21:30:02,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 21:30:02,597 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 74 [2018-12-02 21:30:02,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:30:02,639 INFO L225 Difference]: With dead ends: 49303 [2018-12-02 21:30:02,639 INFO L226 Difference]: Without dead ends: 49301 [2018-12-02 21:30:02,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-02 21:30:02,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49301 states. [2018-12-02 21:30:03,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49301 to 42817. [2018-12-02 21:30:03,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42817 states. [2018-12-02 21:30:03,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42817 states to 42817 states and 59893 transitions. [2018-12-02 21:30:03,226 INFO L78 Accepts]: Start accepts. Automaton has 42817 states and 59893 transitions. Word has length 74 [2018-12-02 21:30:03,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:30:03,226 INFO L480 AbstractCegarLoop]: Abstraction has 42817 states and 59893 transitions. [2018-12-02 21:30:03,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 21:30:03,226 INFO L276 IsEmpty]: Start isEmpty. Operand 42817 states and 59893 transitions. [2018-12-02 21:30:03,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-02 21:30:03,229 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:30:03,229 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1] [2018-12-02 21:30:03,229 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:30:03,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:30:03,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1528834600, now seen corresponding path program 6 times [2018-12-02 21:30:03,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:30:03,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:03,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:30:03,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:03,230 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:30:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:03,270 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:03,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:30:03,270 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:30:03,270 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:30:03,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:30:03,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:30:03,270 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:30:03,275 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 21:30:03,276 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 21:30:03,284 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 21:30:03,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:30:03,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:30:03,290 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:03,290 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:30:03,338 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:03,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:30:03,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-02 21:30:03,353 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:30:03,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 21:30:03,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 21:30:03,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-02 21:30:03,353 INFO L87 Difference]: Start difference. First operand 42817 states and 59893 transitions. Second operand 9 states. [2018-12-02 21:30:03,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:30:03,827 INFO L93 Difference]: Finished difference Result 59106 states and 83567 transitions. [2018-12-02 21:30:03,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 21:30:03,827 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2018-12-02 21:30:03,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:30:03,874 INFO L225 Difference]: With dead ends: 59106 [2018-12-02 21:30:03,874 INFO L226 Difference]: Without dead ends: 59105 [2018-12-02 21:30:03,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-02 21:30:03,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59105 states. [2018-12-02 21:30:04,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59105 to 45009. [2018-12-02 21:30:04,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45009 states. [2018-12-02 21:30:04,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45009 states to 45009 states and 62991 transitions. [2018-12-02 21:30:04,503 INFO L78 Accepts]: Start accepts. Automaton has 45009 states and 62991 transitions. Word has length 75 [2018-12-02 21:30:04,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:30:04,503 INFO L480 AbstractCegarLoop]: Abstraction has 45009 states and 62991 transitions. [2018-12-02 21:30:04,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 21:30:04,503 INFO L276 IsEmpty]: Start isEmpty. Operand 45009 states and 62991 transitions. [2018-12-02 21:30:04,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-02 21:30:04,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:30:04,506 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1] [2018-12-02 21:30:04,506 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:30:04,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:30:04,506 INFO L82 PathProgramCache]: Analyzing trace with hash -427799768, now seen corresponding path program 7 times [2018-12-02 21:30:04,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:30:04,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:04,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:30:04,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:04,507 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:30:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:04,571 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:04,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:30:04,572 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:30:04,572 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:30:04,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:30:04,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:30:04,572 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:30:04,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:30:04,580 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:30:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:04,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:30:04,595 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:04,595 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:30:04,657 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:04,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:30:04,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-02 21:30:04,671 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:30:04,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 21:30:04,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 21:30:04,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-02 21:30:04,672 INFO L87 Difference]: Start difference. First operand 45009 states and 62991 transitions. Second operand 10 states. [2018-12-02 21:30:05,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:30:05,149 INFO L93 Difference]: Finished difference Result 62469 states and 88924 transitions. [2018-12-02 21:30:05,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 21:30:05,149 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 76 [2018-12-02 21:30:05,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:30:05,204 INFO L225 Difference]: With dead ends: 62469 [2018-12-02 21:30:05,204 INFO L226 Difference]: Without dead ends: 62467 [2018-12-02 21:30:05,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-02 21:30:05,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62467 states. [2018-12-02 21:30:06,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62467 to 53493. [2018-12-02 21:30:06,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53493 states. [2018-12-02 21:30:06,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53493 states to 53493 states and 74602 transitions. [2018-12-02 21:30:06,083 INFO L78 Accepts]: Start accepts. Automaton has 53493 states and 74602 transitions. Word has length 76 [2018-12-02 21:30:06,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:30:06,083 INFO L480 AbstractCegarLoop]: Abstraction has 53493 states and 74602 transitions. [2018-12-02 21:30:06,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 21:30:06,083 INFO L276 IsEmpty]: Start isEmpty. Operand 53493 states and 74602 transitions. [2018-12-02 21:30:06,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-02 21:30:06,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:30:06,086 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1] [2018-12-02 21:30:06,086 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:30:06,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:30:06,087 INFO L82 PathProgramCache]: Analyzing trace with hash 265372381, now seen corresponding path program 8 times [2018-12-02 21:30:06,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:30:06,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:06,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:30:06,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:06,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:30:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:06,144 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:06,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:30:06,145 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:30:06,145 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:30:06,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:30:06,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:30:06,145 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:30:06,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:30:06,152 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:30:06,166 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-02 21:30:06,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:30:06,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:30:06,172 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:06,173 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:30:06,264 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:06,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:30:06,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-02 21:30:06,278 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:30:06,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 21:30:06,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 21:30:06,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-02 21:30:06,279 INFO L87 Difference]: Start difference. First operand 53493 states and 74602 transitions. Second operand 11 states. [2018-12-02 21:30:06,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:30:06,818 INFO L93 Difference]: Finished difference Result 75502 states and 106384 transitions. [2018-12-02 21:30:06,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 21:30:06,819 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 77 [2018-12-02 21:30:06,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:30:06,884 INFO L225 Difference]: With dead ends: 75502 [2018-12-02 21:30:06,884 INFO L226 Difference]: Without dead ends: 75501 [2018-12-02 21:30:06,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-02 21:30:06,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75501 states. [2018-12-02 21:30:07,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75501 to 55737. [2018-12-02 21:30:07,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55737 states. [2018-12-02 21:30:07,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55737 states to 55737 states and 77782 transitions. [2018-12-02 21:30:07,779 INFO L78 Accepts]: Start accepts. Automaton has 55737 states and 77782 transitions. Word has length 77 [2018-12-02 21:30:07,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:30:07,779 INFO L480 AbstractCegarLoop]: Abstraction has 55737 states and 77782 transitions. [2018-12-02 21:30:07,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 21:30:07,779 INFO L276 IsEmpty]: Start isEmpty. Operand 55737 states and 77782 transitions. [2018-12-02 21:30:07,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-02 21:30:07,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:30:07,851 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1] [2018-12-02 21:30:07,851 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:30:07,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:30:07,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1444546058, now seen corresponding path program 10 times [2018-12-02 21:30:07,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:30:07,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:07,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:30:07,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:07,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:30:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:07,917 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 0 proven. 375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:07,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:30:07,918 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:30:07,918 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:30:07,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:30:07,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:30:07,918 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:30:07,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:30:07,924 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:30:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:07,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:30:07,941 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 0 proven. 375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:07,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:30:08,034 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 0 proven. 375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:08,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:30:08,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-02 21:30:08,048 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:30:08,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 21:30:08,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 21:30:08,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-02 21:30:08,048 INFO L87 Difference]: Start difference. First operand 55737 states and 77782 transitions. Second operand 13 states. [2018-12-02 21:30:08,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:30:08,576 INFO L93 Difference]: Finished difference Result 72432 states and 102654 transitions. [2018-12-02 21:30:08,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 21:30:08,577 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2018-12-02 21:30:08,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:30:08,640 INFO L225 Difference]: With dead ends: 72432 [2018-12-02 21:30:08,640 INFO L226 Difference]: Without dead ends: 72430 [2018-12-02 21:30:08,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-02 21:30:08,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72430 states. [2018-12-02 21:30:09,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72430 to 63455. [2018-12-02 21:30:09,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63455 states. [2018-12-02 21:30:09,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63455 states to 63455 states and 88331 transitions. [2018-12-02 21:30:09,569 INFO L78 Accepts]: Start accepts. Automaton has 63455 states and 88331 transitions. Word has length 81 [2018-12-02 21:30:09,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:30:09,570 INFO L480 AbstractCegarLoop]: Abstraction has 63455 states and 88331 transitions. [2018-12-02 21:30:09,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 21:30:09,570 INFO L276 IsEmpty]: Start isEmpty. Operand 63455 states and 88331 transitions. [2018-12-02 21:30:09,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-02 21:30:09,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:30:09,574 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1] [2018-12-02 21:30:09,574 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:30:09,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:30:09,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1692281031, now seen corresponding path program 9 times [2018-12-02 21:30:09,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:30:09,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:09,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:30:09,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:09,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:30:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:09,653 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:09,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:30:09,653 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:30:09,653 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:30:09,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:30:09,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:30:09,653 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:30:09,661 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 21:30:09,661 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 21:30:09,673 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 21:30:09,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:30:09,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:30:09,681 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:09,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:30:09,793 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:09,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:30:09,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-02 21:30:09,808 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:30:09,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 21:30:09,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 21:30:09,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-02 21:30:09,809 INFO L87 Difference]: Start difference. First operand 63455 states and 88331 transitions. Second operand 12 states. [2018-12-02 21:30:10,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:30:10,517 INFO L93 Difference]: Finished difference Result 87915 states and 123650 transitions. [2018-12-02 21:30:10,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 21:30:10,517 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 85 [2018-12-02 21:30:10,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:30:10,605 INFO L225 Difference]: With dead ends: 87915 [2018-12-02 21:30:10,605 INFO L226 Difference]: Without dead ends: 87914 [2018-12-02 21:30:10,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-02 21:30:10,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87914 states. [2018-12-02 21:30:11,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87914 to 65699. [2018-12-02 21:30:11,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65699 states. [2018-12-02 21:30:11,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65699 states to 65699 states and 91511 transitions. [2018-12-02 21:30:11,706 INFO L78 Accepts]: Start accepts. Automaton has 65699 states and 91511 transitions. Word has length 85 [2018-12-02 21:30:11,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:30:11,707 INFO L480 AbstractCegarLoop]: Abstraction has 65699 states and 91511 transitions. [2018-12-02 21:30:11,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 21:30:11,707 INFO L276 IsEmpty]: Start isEmpty. Operand 65699 states and 91511 transitions. [2018-12-02 21:30:11,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-02 21:30:11,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:30:11,712 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1] [2018-12-02 21:30:11,712 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:30:11,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:30:11,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1685753485, now seen corresponding path program 8 times [2018-12-02 21:30:11,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:30:11,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:11,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:30:11,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:11,713 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:30:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:11,765 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:11,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:30:11,765 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:30:11,765 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:30:11,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:30:11,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:30:11,766 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:30:11,771 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:30:11,771 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:30:11,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-02 21:30:11,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:30:11,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:30:11,789 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:11,790 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:30:11,872 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:11,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:30:11,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-02 21:30:11,886 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:30:11,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 21:30:11,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 21:30:11,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-02 21:30:11,887 INFO L87 Difference]: Start difference. First operand 65699 states and 91511 transitions. Second operand 11 states. [2018-12-02 21:30:12,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:30:12,541 INFO L93 Difference]: Finished difference Result 88656 states and 125565 transitions. [2018-12-02 21:30:12,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 21:30:12,541 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-12-02 21:30:12,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:30:12,619 INFO L225 Difference]: With dead ends: 88656 [2018-12-02 21:30:12,619 INFO L226 Difference]: Without dead ends: 88654 [2018-12-02 21:30:12,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-02 21:30:12,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88654 states. [2018-12-02 21:30:13,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88654 to 76293. [2018-12-02 21:30:13,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76293 states. [2018-12-02 21:30:13,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76293 states to 76293 states and 105928 transitions. [2018-12-02 21:30:13,789 INFO L78 Accepts]: Start accepts. Automaton has 76293 states and 105928 transitions. Word has length 85 [2018-12-02 21:30:13,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:30:13,789 INFO L480 AbstractCegarLoop]: Abstraction has 76293 states and 105928 transitions. [2018-12-02 21:30:13,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 21:30:13,790 INFO L276 IsEmpty]: Start isEmpty. Operand 76293 states and 105928 transitions. [2018-12-02 21:30:13,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-02 21:30:13,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:30:13,794 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1] [2018-12-02 21:30:13,794 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:30:13,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:30:13,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1536406213, now seen corresponding path program 7 times [2018-12-02 21:30:13,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:30:13,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:13,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:30:13,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:13,795 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:30:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:13,854 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:13,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:30:13,854 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:30:13,855 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:30:13,855 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:30:13,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:30:13,855 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:30:13,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:30:13,861 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:30:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:13,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:30:13,878 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:13,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:30:13,935 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:13,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:30:13,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-02 21:30:13,950 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:30:13,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 21:30:13,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 21:30:13,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-02 21:30:13,950 INFO L87 Difference]: Start difference. First operand 76293 states and 105928 transitions. Second operand 10 states. [2018-12-02 21:30:14,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:30:14,752 INFO L93 Difference]: Finished difference Result 109927 states and 154225 transitions. [2018-12-02 21:30:14,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 21:30:14,752 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2018-12-02 21:30:14,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:30:14,858 INFO L225 Difference]: With dead ends: 109927 [2018-12-02 21:30:14,858 INFO L226 Difference]: Without dead ends: 109926 [2018-12-02 21:30:14,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-02 21:30:14,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109926 states. [2018-12-02 21:30:16,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109926 to 80157. [2018-12-02 21:30:16,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80157 states. [2018-12-02 21:30:16,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80157 states to 80157 states and 111367 transitions. [2018-12-02 21:30:16,174 INFO L78 Accepts]: Start accepts. Automaton has 80157 states and 111367 transitions. Word has length 85 [2018-12-02 21:30:16,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:30:16,175 INFO L480 AbstractCegarLoop]: Abstraction has 80157 states and 111367 transitions. [2018-12-02 21:30:16,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 21:30:16,175 INFO L276 IsEmpty]: Start isEmpty. Operand 80157 states and 111367 transitions. [2018-12-02 21:30:16,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-02 21:30:16,179 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:30:16,179 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 1, 1, 1, 1, 1, 1] [2018-12-02 21:30:16,180 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:30:16,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:30:16,180 INFO L82 PathProgramCache]: Analyzing trace with hash -508374954, now seen corresponding path program 11 times [2018-12-02 21:30:16,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:30:16,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:16,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:30:16,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:16,180 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:30:16,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:16,257 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:16,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:30:16,257 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:30:16,257 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:30:16,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:30:16,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:30:16,257 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:30:16,266 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:30:16,267 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:30:16,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-02 21:30:16,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:30:16,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:30:16,289 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:16,289 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:30:16,421 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:16,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:30:16,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-02 21:30:16,435 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:30:16,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 21:30:16,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 21:30:16,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-02 21:30:16,436 INFO L87 Difference]: Start difference. First operand 80157 states and 111367 transitions. Second operand 14 states. [2018-12-02 21:30:17,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:30:17,244 INFO L93 Difference]: Finished difference Result 102547 states and 144645 transitions. [2018-12-02 21:30:17,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 21:30:17,244 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 88 [2018-12-02 21:30:17,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:30:17,351 INFO L225 Difference]: With dead ends: 102547 [2018-12-02 21:30:17,351 INFO L226 Difference]: Without dead ends: 102545 [2018-12-02 21:30:17,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-02 21:30:17,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102545 states. [2018-12-02 21:30:18,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102545 to 90527. [2018-12-02 21:30:18,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90527 states. [2018-12-02 21:30:18,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90527 states to 90527 states and 125495 transitions. [2018-12-02 21:30:18,713 INFO L78 Accepts]: Start accepts. Automaton has 90527 states and 125495 transitions. Word has length 88 [2018-12-02 21:30:18,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:30:18,713 INFO L480 AbstractCegarLoop]: Abstraction has 90527 states and 125495 transitions. [2018-12-02 21:30:18,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 21:30:18,713 INFO L276 IsEmpty]: Start isEmpty. Operand 90527 states and 125495 transitions. [2018-12-02 21:30:18,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 21:30:18,719 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:30:18,719 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2018-12-02 21:30:18,719 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:30:18,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:30:18,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1413249871, now seen corresponding path program 10 times [2018-12-02 21:30:18,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:30:18,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:18,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:30:18,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:18,720 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:30:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:18,794 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:18,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:30:18,794 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:30:18,795 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:30:18,795 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:30:18,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:30:18,795 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:30:18,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:30:18,800 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:30:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:18,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:30:18,819 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:18,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:30:18,911 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:18,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:30:18,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-02 21:30:18,925 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:30:18,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 21:30:18,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 21:30:18,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-02 21:30:18,926 INFO L87 Difference]: Start difference. First operand 90527 states and 125495 transitions. Second operand 13 states. [2018-12-02 21:30:19,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:30:19,971 INFO L93 Difference]: Finished difference Result 123345 states and 172777 transitions. [2018-12-02 21:30:19,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 21:30:19,971 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 93 [2018-12-02 21:30:19,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:30:20,091 INFO L225 Difference]: With dead ends: 123345 [2018-12-02 21:30:20,091 INFO L226 Difference]: Without dead ends: 123344 [2018-12-02 21:30:20,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-02 21:30:20,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123344 states. [2018-12-02 21:30:21,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123344 to 93265. [2018-12-02 21:30:21,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93265 states. [2018-12-02 21:30:21,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93265 states to 93265 states and 129365 transitions. [2018-12-02 21:30:21,574 INFO L78 Accepts]: Start accepts. Automaton has 93265 states and 129365 transitions. Word has length 93 [2018-12-02 21:30:21,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:30:21,574 INFO L480 AbstractCegarLoop]: Abstraction has 93265 states and 129365 transitions. [2018-12-02 21:30:21,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 21:30:21,575 INFO L276 IsEmpty]: Start isEmpty. Operand 93265 states and 129365 transitions. [2018-12-02 21:30:21,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 21:30:21,580 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:30:21,580 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1] [2018-12-02 21:30:21,580 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:30:21,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:30:21,580 INFO L82 PathProgramCache]: Analyzing trace with hash 879701896, now seen corresponding path program 9 times [2018-12-02 21:30:21,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:30:21,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:21,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:30:21,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:21,581 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:30:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:21,630 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:21,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:30:21,630 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:30:21,630 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:30:21,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:30:21,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:30:21,631 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:30:21,637 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 21:30:21,637 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 21:30:21,648 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 21:30:21,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:30:21,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:30:21,654 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:21,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:30:21,748 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:21,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:30:21,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-02 21:30:21,762 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:30:21,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 21:30:21,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 21:30:21,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-02 21:30:21,763 INFO L87 Difference]: Start difference. First operand 93265 states and 129365 transitions. Second operand 12 states. [2018-12-02 21:30:22,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:30:22,685 INFO L93 Difference]: Finished difference Result 123303 states and 173838 transitions. [2018-12-02 21:30:22,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 21:30:22,685 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-12-02 21:30:22,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:30:22,802 INFO L225 Difference]: With dead ends: 123303 [2018-12-02 21:30:22,802 INFO L226 Difference]: Without dead ends: 123301 [2018-12-02 21:30:22,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-02 21:30:22,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123301 states. [2018-12-02 21:30:24,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123301 to 107157. [2018-12-02 21:30:24,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107157 states. [2018-12-02 21:30:24,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107157 states to 107157 states and 148218 transitions. [2018-12-02 21:30:24,564 INFO L78 Accepts]: Start accepts. Automaton has 107157 states and 148218 transitions. Word has length 94 [2018-12-02 21:30:24,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:30:24,565 INFO L480 AbstractCegarLoop]: Abstraction has 107157 states and 148218 transitions. [2018-12-02 21:30:24,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 21:30:24,565 INFO L276 IsEmpty]: Start isEmpty. Operand 107157 states and 148218 transitions. [2018-12-02 21:30:24,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 21:30:24,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:30:24,570 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 1, 1, 1, 1, 1, 1] [2018-12-02 21:30:24,570 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:30:24,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:30:24,570 INFO L82 PathProgramCache]: Analyzing trace with hash 526129290, now seen corresponding path program 12 times [2018-12-02 21:30:24,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:30:24,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:24,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:30:24,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:24,571 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:30:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:24,637 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 517 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-02 21:30:24,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:30:24,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 21:30:24,638 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:30:24,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 21:30:24,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 21:30:24,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-02 21:30:24,638 INFO L87 Difference]: Start difference. First operand 107157 states and 148218 transitions. Second operand 13 states. [2018-12-02 21:30:25,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:30:25,173 INFO L93 Difference]: Finished difference Result 125640 states and 173038 transitions. [2018-12-02 21:30:25,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 21:30:25,174 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 95 [2018-12-02 21:30:25,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:30:25,174 INFO L225 Difference]: With dead ends: 125640 [2018-12-02 21:30:25,174 INFO L226 Difference]: Without dead ends: 423 [2018-12-02 21:30:25,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-02 21:30:25,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-12-02 21:30:25,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 226. [2018-12-02 21:30:25,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-12-02 21:30:25,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 264 transitions. [2018-12-02 21:30:25,256 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 264 transitions. Word has length 95 [2018-12-02 21:30:25,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:30:25,257 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 264 transitions. [2018-12-02 21:30:25,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 21:30:25,257 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 264 transitions. [2018-12-02 21:30:25,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 21:30:25,257 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:30:25,257 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1] [2018-12-02 21:30:25,257 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:30:25,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:30:25,257 INFO L82 PathProgramCache]: Analyzing trace with hash 270660750, now seen corresponding path program 8 times [2018-12-02 21:30:25,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:30:25,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:25,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:30:25,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:25,258 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:30:25,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:25,316 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:25,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:30:25,316 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:30:25,316 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:30:25,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:30:25,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:30:25,316 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:30:25,322 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:30:25,322 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:30:25,337 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-02 21:30:25,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:30:25,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:30:25,345 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:25,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:30:25,413 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:25,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:30:25,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-02 21:30:25,427 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:30:25,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 21:30:25,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 21:30:25,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-02 21:30:25,428 INFO L87 Difference]: Start difference. First operand 226 states and 264 transitions. Second operand 11 states. [2018-12-02 21:30:25,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:30:25,453 INFO L93 Difference]: Finished difference Result 247 states and 284 transitions. [2018-12-02 21:30:25,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 21:30:25,453 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-12-02 21:30:25,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:30:25,454 INFO L225 Difference]: With dead ends: 247 [2018-12-02 21:30:25,454 INFO L226 Difference]: Without dead ends: 106 [2018-12-02 21:30:25,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-02 21:30:25,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-02 21:30:25,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-02 21:30:25,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-02 21:30:25,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 105 transitions. [2018-12-02 21:30:25,456 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 105 transitions. Word has length 95 [2018-12-02 21:30:25,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:30:25,456 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 105 transitions. [2018-12-02 21:30:25,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 21:30:25,456 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 105 transitions. [2018-12-02 21:30:25,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 21:30:25,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:30:25,456 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1] [2018-12-02 21:30:25,457 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:30:25,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:30:25,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1806118879, now seen corresponding path program 9 times [2018-12-02 21:30:25,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:30:25,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:25,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:30:25,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:30:25,457 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:30:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:30:25,509 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:25,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:30:25,509 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:30:25,509 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:30:25,509 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:30:25,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:30:25,509 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:30:25,515 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 21:30:25,515 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 21:30:25,528 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 21:30:25,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:30:25,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:30:25,538 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:25,538 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:30:25,621 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:30:25,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:30:25,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-02 21:30:25,635 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:30:25,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 21:30:25,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 21:30:25,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-02 21:30:25,636 INFO L87 Difference]: Start difference. First operand 106 states and 105 transitions. Second operand 12 states. [2018-12-02 21:30:25,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:30:25,651 INFO L93 Difference]: Finished difference Result 106 states and 105 transitions. [2018-12-02 21:30:25,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 21:30:25,651 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2018-12-02 21:30:25,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:30:25,651 INFO L225 Difference]: With dead ends: 106 [2018-12-02 21:30:25,651 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 21:30:25,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-02 21:30:25,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 21:30:25,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 21:30:25,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 21:30:25,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 21:30:25,652 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 105 [2018-12-02 21:30:25,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:30:25,653 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 21:30:25,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 21:30:25,653 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 21:30:25,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 21:30:25,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 21:30:26,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:26,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:26,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:26,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:26,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:26,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:27,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:27,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:27,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:27,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:27,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:27,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:27,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:27,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:27,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:27,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:27,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:27,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:28,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:28,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:28,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:28,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:28,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:28,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:28,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:28,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:28,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:28,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:28,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:29,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:29,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:29,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:29,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:29,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:30,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:30,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:31,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:32,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:33,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:33,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:33,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:33,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:33,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:33,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:34,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:35,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:36,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:36,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:37,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:37,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:38,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:39,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:39,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:39,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:40,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:40,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:40,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:41,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:41,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:41,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:42,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:43,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:43,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:44,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:45,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:46,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:46,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:47,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:47,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:47,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:48,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:48,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:49,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:50,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:30:50,201 WARN L180 SmtUtils]: Spent 24.53 s on a formula simplification. DAG size of input: 2594 DAG size of output: 2228 [2018-12-02 21:31:51,639 WARN L180 SmtUtils]: Spent 1.02 m on a formula simplification. DAG size of input: 2065 DAG size of output: 353 [2018-12-02 21:31:51,643 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-02 21:31:51,643 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 21:31:51,643 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 21:31:51,643 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 21:31:51,643 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 21:31:51,643 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 21:31:51,643 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-02 21:31:51,643 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 31) no Hoare annotation was computed. [2018-12-02 21:31:51,643 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 13 35) no Hoare annotation was computed. [2018-12-02 21:31:51,643 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 31) no Hoare annotation was computed. [2018-12-02 21:31:51,643 INFO L448 ceAbstractionStarter]: For program point L19-2(lines 19 33) no Hoare annotation was computed. [2018-12-02 21:31:51,643 INFO L448 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2018-12-02 21:31:51,643 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-12-02 21:31:51,644 INFO L448 ceAbstractionStarter]: For program point L28-1(line 28) no Hoare annotation was computed. [2018-12-02 21:31:51,644 INFO L448 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2018-12-02 21:31:51,644 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-12-02 21:31:51,644 INFO L448 ceAbstractionStarter]: For program point L24-1(line 24) no Hoare annotation was computed. [2018-12-02 21:31:51,644 INFO L448 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2018-12-02 21:31:51,644 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-12-02 21:31:51,644 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-12-02 21:31:51,644 INFO L448 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2018-12-02 21:31:51,644 INFO L448 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2018-12-02 21:31:51,644 INFO L448 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2018-12-02 21:31:51,644 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2018-12-02 21:31:51,644 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 31) no Hoare annotation was computed. [2018-12-02 21:31:51,644 INFO L448 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2018-12-02 21:31:51,644 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 13 35) no Hoare annotation was computed. [2018-12-02 21:31:51,644 INFO L448 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2018-12-02 21:31:51,644 INFO L448 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-12-02 21:31:51,644 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 13 35) the Hoare annotation is: true [2018-12-02 21:31:51,644 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-02 21:31:51,644 INFO L448 ceAbstractionStarter]: For program point L30-1(line 30) no Hoare annotation was computed. [2018-12-02 21:31:51,644 INFO L448 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-12-02 21:31:51,644 INFO L448 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-12-02 21:31:51,645 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 32) no Hoare annotation was computed. [2018-12-02 21:31:51,646 INFO L444 ceAbstractionStarter]: At program point L22-1(lines 19 33) the Hoare annotation is: (let ((.cse66 (<= 0 (+ main_~x~0 2147483648))) (.cse1 (<= 0 main_~i~0)) (.cse6 (<= main_~N~0 10)) (.cse59 (<= 0 (+ main_~y~0 2147483648)))) (let ((.cse11 (<= 0 (+ main_~x~0 4))) (.cse13 (<= 0 (+ main_~x~0 2))) (.cse16 (and .cse66 .cse1 .cse6 .cse59))) (let ((.cse24 (<= main_~y~0 2)) (.cse15 (<= 0 (+ main_~y~0 1))) (.cse7 (<= 0 (+ main_~x~0 1))) (.cse9 (<= main_~y~0 0)) (.cse20 (<= main_~y~0 4)) (.cse36 (<= 0 (+ main_~y~0 2))) (.cse27 (<= main_~y~0 3)) (.cse42 (and .cse13 .cse16)) (.cse35 (<= 0 (+ main_~x~0 5))) (.cse4 (<= main_~x~0 0)) (.cse0 (<= 0 (+ main_~x~0 3))) (.cse3 (<= 0 main_~y~0)) (.cse63 (and .cse11 .cse16))) (let ((.cse48 (and .cse3 .cse63)) (.cse8 (<= main_~N~0 (+ main_~i~0 9))) (.cse40 (<= main_~y~0 9)) (.cse47 (<= main_~x~0 8)) (.cse32 (and .cse0 .cse16)) (.cse61 (and .cse1 .cse35 .cse4 .cse6 .cse59)) (.cse25 (<= main_~y~0 5)) (.cse43 (<= main_~x~0 9)) (.cse17 (and .cse42 .cse3)) (.cse60 (and (and .cse16 .cse3 .cse27) .cse4)) (.cse39 (and .cse66 .cse1 .cse36 .cse4 .cse6)) (.cse57 (<= 0 (+ main_~x~0 9))) (.cse49 (<= main_~x~0 3)) (.cse56 (<= main_~x~0 7)) (.cse50 (<= 0 (+ main_~y~0 5))) (.cse52 (<= main_~x~0 5)) (.cse28 (<= 0 (+ main_~x~0 6))) (.cse65 (and .cse20 .cse16 .cse4)) (.cse14 (<= main_~N~0 (+ main_~i~0 7))) (.cse19 (<= main_~y~0 8)) (.cse64 (and .cse0 .cse1 .cse3 .cse6)) (.cse34 (<= main_~y~0 6)) (.cse41 (and .cse1 .cse7 .cse4 .cse6 .cse59 .cse9)) (.cse55 (<= 0 (+ main_~y~0 6))) (.cse53 (<= 0 (+ main_~y~0 7))) (.cse23 (<= main_~x~0 1)) (.cse45 (<= main_~N~0 (+ main_~i~0 8))) (.cse26 (<= main_~N~0 (+ main_~i~0 5))) (.cse51 (and .cse13 .cse1 .cse4 .cse6 .cse59 .cse9)) (.cse33 (<= 0 (+ main_~y~0 3))) (.cse29 (<= main_~N~0 (+ main_~i~0 3))) (.cse2 (<= main_~N~0 (+ main_~i~0 6))) (.cse38 (<= main_~x~0 4)) (.cse30 (<= 0 (+ main_~x~0 8))) (.cse5 (<= main_~y~0 1)) (.cse12 (<= main_~N~0 (+ main_~i~0 4))) (.cse58 (and .cse66 .cse15 .cse1 .cse6)) (.cse46 (<= main_~x~0 6)) (.cse18 (<= main_~N~0 main_~i~0)) (.cse31 (<= main_~N~0 (+ main_~i~0 2))) (.cse44 (<= 0 (+ main_~y~0 4))) (.cse62 (<= main_~y~0 7)) (.cse21 (<= main_~x~0 2)) (.cse22 (<= 0 main_~x~0)) (.cse37 (<= main_~N~0 (+ main_~i~0 1))) (.cse54 (<= 0 (+ main_~x~0 7))) (.cse10 (and .cse66 .cse1 .cse3 .cse24 .cse6))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse3 .cse7 .cse8 .cse4 .cse6 .cse9) (and .cse10 .cse11 .cse12 .cse4) (and .cse13 .cse14 .cse15 .cse16 .cse4 .cse9) (and .cse17 .cse4 .cse18 .cse19) (and .cse20 .cse1 .cse3 .cse12 .cse21 .cse6 .cse22) (and .cse14 .cse1 .cse23 .cse3 .cse24 .cse6 .cse22) (and .cse1 .cse23 .cse3 .cse12 .cse25 .cse6 .cse22) (and .cse1 .cse26 .cse3 .cse27 .cse21 .cse6 .cse22) (and .cse1 .cse28 .cse3 .cse4 .cse5 .cse6 .cse29) (and .cse30 .cse31 .cse1 .cse3 .cse4 .cse6 .cse9) (and .cse32 .cse12 .cse33 .cse4 .cse9) (and .cse1 .cse23 .cse34 .cse3 .cse6 .cse22 .cse29) (and .cse31 .cse28 .cse4 .cse10) (and .cse31 .cse35 .cse16 .cse33 .cse4 .cse9) (and .cse13 .cse16 .cse2 .cse36 .cse4 .cse9) (and .cse16 .cse28 .cse37 .cse33 .cse4 .cse9) (and .cse1 .cse12 .cse38 .cse36 .cse6 .cse22 .cse9) (and .cse39 .cse11 .cse12 .cse9) (and .cse11 .cse16 .cse33 .cse4 .cse9 .cse29) (and (and .cse11 .cse16 .cse3 .cse27) .cse4 .cse29) (and .cse1 .cse40 .cse3 .cse37 .cse4 .cse6 .cse22) (and .cse1 .cse3 .cse18 .cse4 (<= 0 (+ main_~x~0 10)) .cse6 .cse9) (and (or (and .cse1 .cse23 .cse2 .cse6 .cse22 .cse9) (and .cse2 .cse41)) .cse33) (and .cse3 .cse12 .cse4 (and .cse20 .cse42)) (and .cse32 .cse3 .cse27 .cse12 .cse4) (and .cse43 .cse1 .cse3 .cse37 .cse6 .cse22 .cse9) (and .cse31 .cse39 .cse28 .cse9) (and .cse44 .cse35 .cse16 .cse37 .cse4 .cse9) (and .cse1 .cse45 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse1 .cse46 .cse3 .cse12 .cse6 .cse22 .cse9) (and .cse1 .cse23 .cse3 .cse37 .cse6 .cse22 .cse19) (and .cse1 .cse3 .cse47 .cse24 .cse18 .cse6 .cse22) (and .cse37 .cse4 (and .cse25 .cse48)) (and .cse14 .cse49 .cse1 .cse3 .cse6 .cse22 .cse9) (and .cse50 .cse51 .cse29) (and .cse20 .cse1 .cse3 .cse37 .cse6 .cse22 .cse52) (and .cse32 .cse44 .cse4 .cse9 .cse29) (and .cse44 .cse1 .cse2 .cse4 .cse6 .cse22 .cse9) (and .cse31 .cse53 .cse41) (and .cse1 .cse23 .cse3 .cse45 .cse5 .cse6 .cse22) (and .cse16 .cse33 .cse4 .cse18 .cse54 .cse9) (and .cse1 .cse3 .cse8 .cse4 .cse5 .cse6 .cse22) (and .cse1 .cse12 .cse55 .cse4 .cse6 .cse22 .cse9) (and .cse1 .cse50 .cse38 .cse37 .cse6 .cse22 .cse9) (and .cse15 .cse49 .cse1 .cse2 .cse6 .cse22 .cse9) (and .cse14 .cse1 .cse3 .cse21 .cse5 .cse6 .cse22) (and .cse1 .cse3 .cse25 .cse18 .cse6 .cse22 .cse52) (and .cse31 .cse32 .cse3 .cse25 .cse4) (and .cse1 .cse3 .cse25 .cse38 .cse37 .cse6 .cse22) (and .cse1 .cse38 .cse33 .cse6 .cse22 .cse9 .cse29) (and .cse20 .cse31 .cse1 .cse3 .cse38 .cse6 .cse22) (and .cse49 .cse1 .cse53 .cse18 .cse6 .cse22 .cse9) (and .cse1 .cse3 .cse56 .cse24 .cse37 .cse6 .cse22) (and .cse1 .cse26 .cse11 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse3 .cse47 .cse37 .cse5 .cse6 .cse22) (and .cse1 .cse3 .cse37 .cse4 .cse6 .cse57 .cse9) (and .cse30 .cse37 .cse4 .cse58 .cse9) (and .cse1 .cse47 .cse36 .cse18 .cse6 .cse22 .cse9) (and (or (and .cse14 .cse1 .cse23 .cse6 .cse22 .cse9) (and .cse14 .cse41)) .cse36) (and .cse31 .cse1 .cse3 .cse27 .cse6 .cse22 .cse52) (and .cse35 .cse10 .cse4 .cse29) (and .cse1 .cse53 .cse21 .cse37 .cse6 .cse22 .cse9) (and .cse1 (<= main_~x~0 10) .cse3 .cse18 .cse6 .cse22 .cse9) (and .cse31 .cse44 .cse1 .cse38 .cse6 .cse22 .cse9) (and .cse15 .cse1 .cse46 .cse6 .cse22 .cse9 .cse29) (and .cse1 .cse40 .cse7 .cse4 .cse18 .cse6 .cse59) (and .cse1 .cse56 .cse37 .cse36 .cse6 .cse22 .cse9) (and .cse44 .cse12 .cse51) (and .cse1 .cse3 .cse12 .cse38 .cse24 .cse6 .cse22) (and .cse1 .cse38 .cse55 .cse18 .cse6 .cse22 .cse9) (and .cse43 .cse15 .cse1 .cse18 .cse6 .cse22 .cse9) (and .cse31 .cse60 .cse35) (and .cse1 .cse2 .cse27 .cse3 .cse7 .cse4 .cse6) (and .cse49 .cse1 .cse12 .cse33 .cse6 .cse22 .cse9) (and .cse1 .cse36 .cse6 .cse22 .cse9 .cse52 .cse29) (and .cse31 .cse1 .cse34 .cse3 .cse21 .cse6 .cse22) (and .cse14 .cse15 .cse1 .cse21 .cse6 .cse22 .cse9) (and .cse1 .cse12 .cse3 .cse25 .cse7 .cse4 .cse6) (and .cse1 .cse26 .cse3 .cse25 .cse4 .cse6 .cse22) (and .cse49 .cse1 .cse2 .cse3 .cse5 .cse6 .cse22) (and .cse15 .cse1 .cse8 .cse4 .cse6 .cse22 .cse9) (and .cse1 .cse50 .cse23 .cse12 .cse6 .cse22 .cse9) (and .cse61 .cse3 .cse25 .cse18) (and .cse13 .cse14 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse21 .cse18 .cse6 .cse22 .cse19 .cse59) (and .cse31 .cse15 .cse1 .cse56 .cse6 .cse22 .cse9) (and .cse49 .cse1 .cse26 .cse36 .cse6 .cse22 .cse9) (and .cse20 .cse1 .cse26 .cse3 .cse7 .cse4 .cse6) (and .cse1 .cse4 .cse18 .cse6 .cse22 .cse59) (and .cse1 .cse46 .cse3 .cse27 .cse37 .cse6 .cse22) (and .cse44 .cse1 .cse26 .cse23 .cse6 .cse22 .cse9) (and .cse1 .cse50 .cse26 .cse4 .cse6 .cse22 .cse9) (and .cse0 .cse14 .cse1 .cse3 .cse4 .cse6 .cse9) (and .cse15 .cse1 .cse47 .cse37 .cse6 .cse22 .cse9) (and .cse1 .cse35 .cse26 .cse3 .cse4 .cse6 .cse9) (and .cse30 .cse39 .cse18 .cse9) (and .cse15 .cse1 .cse26 .cse38 .cse6 .cse22 .cse9) (and .cse1 .cse2 .cse3 .cse24 .cse21 .cse6 .cse22) (and .cse42 .cse3 .cse25 .cse4 .cse29) (and .cse28 .cse58 .cse4 .cse9 .cse29) (and .cse14 .cse1 .cse3 .cse27 .cse4 .cse6 .cse22) (and .cse1 .cse45 .cse36 .cse4 .cse6 .cse22 .cse9) (and .cse1 .cse3 .cse27 .cse38 .cse6 .cse22 .cse29) (and .cse44 .cse49 .cse1 .cse6 .cse22 .cse9 .cse29) (and .cse1 .cse11 .cse2 .cse3 .cse4 .cse6 .cse9) (and .cse44 .cse1 .cse46 .cse18 .cse6 .cse22 .cse9) (and .cse32 .cse37 .cse55 .cse4 .cse9) (and .cse1 .cse46 .cse3 .cse5 .cse6 .cse22 .cse29) (and .cse31 .cse1 .cse23 .cse3 .cse62 .cse6 .cse22) (and .cse4 .cse18 (and .cse34 .cse48)) (and .cse1 .cse34 .cse3 .cse7 .cse4 .cse6 .cse29) (and .cse1 .cse23 .cse3 .cse8 .cse6 .cse22 .cse9) (and .cse31 .cse1 (<= 0 (+ main_~y~0 8)) .cse4 .cse6 .cse22 .cse9) (and .cse0 .cse26 .cse16 .cse36 .cse4 .cse9) (and .cse1 .cse3 .cse12 .cse5 .cse6 .cse22 .cse52) (and .cse31 .cse1 .cse3 .cse62 .cse7 .cse4 .cse6) (and .cse31 .cse1 .cse46 .cse3 .cse24 .cse6 .cse22) (and .cse1 .cse53 .cse4 .cse6 .cse22 .cse9 .cse29) (and .cse13 .cse31 .cse34 (and .cse1 .cse4 .cse6) .cse3) (and .cse50 .cse37 .cse63 .cse4 .cse9) (and .cse1 .cse3 .cse7 .cse37 .cse4 .cse6 .cse19) (and .cse30 .cse4 .cse18 .cse10) (and .cse53 .cse51 .cse37) (and .cse1 .cse26 .cse3 .cse6 .cse22 .cse9 .cse52) (and .cse55 .cse63 .cse4 .cse18 .cse9) (and .cse1 .cse35 .cse3 .cse12 .cse4 .cse5 .cse6) (and .cse31 .cse1 .cse3 .cse54 .cse4 .cse5 .cse6) (and .cse1 .cse23 .cse40 .cse18 .cse6 .cse22 .cse59) (and .cse60 .cse28 .cse37) (and .cse32 .cse31 .cse50 .cse4 .cse9) (and .cse31 .cse1 .cse3 .cse56 .cse5 .cse6 .cse22) (and .cse31 .cse49 .cse1 .cse50 .cse6 .cse22 .cse9) (and .cse31 .cse1 .cse33 .cse6 .cse22 .cse9 .cse52) (and .cse44 .cse1 .cse12 .cse21 .cse6 .cse22 .cse9) (and .cse26 .cse3 .cse27 .cse4 .cse42) (and .cse31 .cse1 .cse3 .cse47 .cse6 .cse22 .cse9) (and .cse1 .cse50 .cse21 .cse6 .cse22 .cse9 .cse29) (and .cse15 .cse1 .cse12 .cse6 .cse22 .cse9 .cse52) (and .cse1 .cse3 .cse24 .cse6 .cse22 .cse52 .cse29) (and .cse1 .cse3 .cse25 .cse21 .cse6 .cse22 .cse29) (and .cse49 .cse1 .cse34 .cse3 .cse37 .cse6 .cse22) (and .cse44 .cse26 .cse41) (and .cse1 .cse28 .cse12 .cse3 .cse4 .cse6 .cse9) (and .cse58 .cse4 .cse18 .cse57 .cse9) (and .cse15 .cse1 .cse23 .cse45 .cse6 .cse22 .cse9) (and (or (and .cse1 .cse23 .cse37 .cse6 .cse22 .cse9) (and .cse37 .cse41)) (<= 0 (+ main_~y~0 9))) (and .cse1 .cse23 .cse2 .cse3 .cse27 .cse6 .cse22) (and .cse26 .cse11 .cse58 .cse4 .cse9) (and .cse32 .cse53 .cse4 .cse18 .cse9) (and .cse13 .cse1 .cse45 .cse3 .cse4 .cse6 .cse9) (and .cse50 .cse61 .cse18 .cse9) (and .cse1 .cse3 .cse56 .cse6 .cse22 .cse9 .cse29) (and .cse0 .cse26 .cse10 .cse4) (and .cse1 .cse26 .cse3 .cse38 .cse5 .cse6 .cse22) (and .cse62 .cse64 .cse4 .cse18) (and .cse44 .cse16 .cse28 .cse4 .cse18 .cse9) (and .cse1 .cse2 .cse21 .cse36 .cse6 .cse22 .cse9) (and .cse31 .cse1 .cse21 .cse55 .cse6 .cse22 .cse9) (and .cse31 .cse49 .cse1 .cse3 .cse25 .cse6 .cse22) (and .cse20 .cse49 .cse1 .cse3 .cse6 .cse22 .cse29) (and .cse43 .cse1 .cse3 .cse5 .cse18 .cse6 .cse22) (and .cse31 .cse58 .cse4 .cse54 .cse9) (and .cse17 .cse62 .cse37 .cse4) (and .cse1 .cse3 .cse4 .cse6 .cse22 .cse9) (and .cse51 .cse18) (and .cse49 .cse1 .cse26 .cse3 .cse24 .cse6 .cse22) (and .cse1 .cse34 .cse3 .cse12 .cse4 .cse6 .cse22) (and .cse60 .cse18 .cse54) (and .cse49 .cse1 .cse3 .cse27 .cse12 .cse6 .cse22) (and .cse1 .cse3 .cse56 .cse27 .cse18 .cse6 .cse22) (and .cse39 .cse37 .cse54 .cse9) (and .cse44 .cse1 .cse37 .cse6 .cse22 .cse9 .cse52) (and .cse39 .cse35 .cse9 .cse29) (and .cse35 .cse3 .cse65 .cse37) (and .cse50 .cse12 .cse41) (and .cse31 .cse51 .cse55) (and .cse49 .cse1 .cse3 .cse62 .cse18 .cse6 .cse22) (and .cse1 .cse3 .cse4 .cse5 .cse18 .cse6 .cse57) (and .cse1 .cse26 .cse21 .cse33 .cse6 .cse22 .cse9) (and .cse14 .cse1 .cse3 .cse24 .cse7 .cse4 .cse6) (and .cse1 .cse46 .cse37 .cse33 .cse6 .cse22 .cse9) (and .cse2 .cse3 .cse24 (and .cse13 .cse1 .cse4 .cse6)) (and .cse49 .cse1 .cse37 .cse55 .cse6 .cse22 .cse9) (and .cse31 .cse3 .cse4 (and .cse20 .cse63)) (and .cse1 .cse3 .cse45 .cse24 .cse4 .cse6 .cse22) (and .cse1 .cse34 .cse3 .cse38 .cse18 .cse6 .cse22) (and .cse1 .cse56 .cse33 .cse18 .cse6 .cse22 .cse9) (and .cse1 .cse50 .cse18 .cse6 .cse22 .cse9 .cse52) (and .cse28 (and .cse3 .cse65) .cse18) (and .cse20 .cse1 .cse2 .cse3 .cse4 .cse6 .cse22) (and .cse0 .cse3 (and .cse20 .cse1 .cse4 .cse6) .cse29) (and .cse14 .cse1 .cse33 .cse4 .cse6 .cse22 .cse9) (and .cse1 .cse3 .cse4 .cse54 .cse6 .cse9 .cse29) (and .cse0 .cse2 .cse58 .cse4 .cse9) (and .cse31 .cse1 .cse3 .cse4 .cse6 .cse22 .cse19) (and .cse31 .cse1 .cse46 .cse36 .cse6 .cse22 .cse9) (and .cse15 .cse45 (and .cse1 .cse6) .cse7 .cse4 .cse9) (and .cse64 .cse34 .cse37 .cse4) (and .cse20 .cse1 .cse26 .cse23 .cse3 .cse6 .cse22) (and (or (and .cse1 .cse23 .cse6 .cse22 .cse9 .cse29) (and .cse41 .cse29)) .cse55) (and .cse31 .cse1 .cse53 .cse23 .cse6 .cse22 .cse9) (and .cse1 .cse3 .cse45 .cse21 .cse6 .cse22 .cse9) (and .cse26 .cse51 .cse33) (and .cse1 .cse3 .cse62 .cse4 .cse6 .cse22 .cse29) (and .cse1 .cse2 .cse3 .cse38 .cse6 .cse22 .cse9) (and .cse30 .cse1 .cse3 .cse37 .cse4 .cse5 .cse6) (and .cse35 .cse12 .cse58 .cse4 .cse9) (and .cse20 .cse1 .cse46 .cse3 .cse18 .cse6 .cse22) (and .cse31 .cse44 .cse63 .cse4 .cse9) (and .cse1 .cse3 .cse62 .cse21 .cse37 .cse6 .cse22) (and .cse37 .cse4 .cse54 .cse10)))))) [2018-12-02 21:31:51,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 09:31:51 BoogieIcfgContainer [2018-12-02 21:31:51,688 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 21:31:51,688 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 21:31:51,688 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 21:31:51,688 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 21:31:51,689 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:29:49" (3/4) ... [2018-12-02 21:31:51,692 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 21:31:51,697 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 21:31:51,698 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 21:31:51,701 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-02 21:31:51,701 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-02 21:31:51,701 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 21:31:51,701 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 21:31:51,747 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4c4ec797-e884-4e81-a8ff-ae30c1910db1/bin-2019/utaipan/witness.graphml [2018-12-02 21:31:51,747 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 21:31:51,748 INFO L168 Benchmark]: Toolchain (without parser) took 122599.40 ms. Allocated memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: 2.0 GB). Free memory was 959.8 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 992.4 MB. Max. memory is 11.5 GB. [2018-12-02 21:31:51,748 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:31:51,748 INFO L168 Benchmark]: CACSL2BoogieTranslator took 128.68 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 949.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 21:31:51,748 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.00 ms. Allocated memory is still 1.0 GB. Free memory is still 949.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:31:51,749 INFO L168 Benchmark]: Boogie Preprocessor took 40.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 68.2 MB). Free memory was 949.0 MB in the beginning and 1.1 GB in the end (delta: -116.9 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2018-12-02 21:31:51,749 INFO L168 Benchmark]: RCFGBuilder took 143.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2018-12-02 21:31:51,749 INFO L168 Benchmark]: TraceAbstraction took 122212.57 ms. Allocated memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: 2.0 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -952.6 MB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. [2018-12-02 21:31:51,749 INFO L168 Benchmark]: Witness Printer took 59.39 ms. Allocated memory is still 3.1 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:31:51,750 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 128.68 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 949.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.00 ms. Allocated memory is still 1.0 GB. Free memory is still 949.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 68.2 MB). Free memory was 949.0 MB in the beginning and 1.1 GB in the end (delta: -116.9 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 143.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 122212.57 ms. Allocated memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: 2.0 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -952.6 MB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. * Witness Printer took 59.39 ms. Allocated memory is still 3.1 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: 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: 28]: 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: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: 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 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= x + 3 && 0 <= i) && N <= i + 6) && 0 <= y) && x <= 0) && y <= 1) && N <= 10) || ((((((0 <= i && 0 <= y) && 0 <= x + 1) && N <= i + 9) && x <= 0) && N <= 10) && y <= 0)) || (((((((0 <= x + 2147483648 && 0 <= i) && 0 <= y) && y <= 2) && N <= 10) && 0 <= x + 4) && N <= i + 4) && x <= 0)) || (((((0 <= x + 2 && N <= i + 7) && 0 <= y + 1) && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && x <= 0) && y <= 0)) || (((((0 <= x + 2 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && 0 <= y) && x <= 0) && N <= i) && y <= 8)) || ((((((y <= 4 && 0 <= i) && 0 <= y) && N <= i + 4) && x <= 2) && N <= 10) && 0 <= x)) || ((((((N <= i + 7 && 0 <= i) && x <= 1) && 0 <= y) && y <= 2) && N <= 10) && 0 <= x)) || ((((((0 <= i && x <= 1) && 0 <= y) && N <= i + 4) && y <= 5) && N <= 10) && 0 <= x)) || ((((((0 <= i && N <= i + 5) && 0 <= y) && y <= 3) && x <= 2) && N <= 10) && 0 <= x)) || ((((((0 <= i && 0 <= x + 6) && 0 <= y) && x <= 0) && y <= 1) && N <= 10) && N <= i + 3)) || ((((((0 <= x + 8 && N <= i + 2) && 0 <= i) && 0 <= y) && x <= 0) && N <= 10) && y <= 0)) || (((((0 <= x + 3 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && N <= i + 4) && 0 <= y + 3) && x <= 0) && y <= 0)) || ((((((0 <= i && x <= 1) && y <= 6) && 0 <= y) && N <= 10) && 0 <= x) && N <= i + 3)) || (((N <= i + 2 && 0 <= x + 6) && x <= 0) && (((0 <= x + 2147483648 && 0 <= i) && 0 <= y) && y <= 2) && N <= 10)) || (((((N <= i + 2 && 0 <= x + 5) && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && 0 <= y + 3) && x <= 0) && y <= 0)) || (((((0 <= x + 2 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && N <= i + 6) && 0 <= y + 2) && x <= 0) && y <= 0)) || ((((((((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && 0 <= x + 6) && N <= i + 1) && 0 <= y + 3) && x <= 0) && y <= 0)) || ((((((0 <= i && N <= i + 4) && x <= 4) && 0 <= y + 2) && N <= 10) && 0 <= x) && y <= 0)) || (((((((0 <= x + 2147483648 && 0 <= i) && 0 <= y + 2) && x <= 0) && N <= 10) && 0 <= x + 4) && N <= i + 4) && y <= 0)) || (((((0 <= x + 4 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && 0 <= y + 3) && x <= 0) && y <= 0) && N <= i + 3)) || (((((0 <= x + 4 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && 0 <= y) && y <= 3) && x <= 0) && N <= i + 3)) || ((((((0 <= i && y <= 9) && 0 <= y) && N <= i + 1) && x <= 0) && N <= 10) && 0 <= x)) || ((((((0 <= i && 0 <= y) && N <= i) && x <= 0) && 0 <= x + 10) && N <= 10) && y <= 0)) || (((((((0 <= i && x <= 1) && N <= i + 6) && N <= 10) && 0 <= x) && y <= 0) || (N <= i + 6 && ((((0 <= i && 0 <= x + 1) && x <= 0) && N <= 10) && 0 <= y + 2147483648) && y <= 0)) && 0 <= y + 3)) || (((0 <= y && N <= i + 4) && x <= 0) && y <= 4 && 0 <= x + 2 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648)) || (((((0 <= x + 3 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && 0 <= y) && y <= 3) && N <= i + 4) && x <= 0)) || ((((((x <= 9 && 0 <= i) && 0 <= y) && N <= i + 1) && N <= 10) && 0 <= x) && y <= 0)) || (((N <= i + 2 && (((0 <= x + 2147483648 && 0 <= i) && 0 <= y + 2) && x <= 0) && N <= 10) && 0 <= x + 6) && y <= 0)) || (((((0 <= y + 4 && 0 <= x + 5) && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && N <= i + 1) && x <= 0) && y <= 0)) || ((((((0 <= i && N <= i + 8) && 0 <= y) && 0 <= x + 1) && x <= 0) && y <= 1) && N <= 10)) || ((((((0 <= i && x <= 6) && 0 <= y) && N <= i + 4) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= i && x <= 1) && 0 <= y) && N <= i + 1) && N <= 10) && 0 <= x) && y <= 8)) || ((((((0 <= i && 0 <= y) && x <= 8) && y <= 2) && N <= i) && N <= 10) && 0 <= x)) || ((N <= i + 1 && x <= 0) && y <= 5 && 0 <= y && 0 <= x + 4 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648)) || ((((((N <= i + 7 && x <= 3) && 0 <= i) && 0 <= y) && N <= 10) && 0 <= x) && y <= 0)) || ((0 <= y + 5 && ((((0 <= x + 2 && 0 <= i) && x <= 0) && N <= 10) && 0 <= y + 2147483648) && y <= 0) && N <= i + 3)) || ((((((y <= 4 && 0 <= i) && 0 <= y) && N <= i + 1) && N <= 10) && 0 <= x) && x <= 5)) || (((((0 <= x + 3 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && 0 <= y + 4) && x <= 0) && y <= 0) && N <= i + 3)) || ((((((0 <= y + 4 && 0 <= i) && N <= i + 6) && x <= 0) && N <= 10) && 0 <= x) && y <= 0)) || ((N <= i + 2 && 0 <= y + 7) && ((((0 <= i && 0 <= x + 1) && x <= 0) && N <= 10) && 0 <= y + 2147483648) && y <= 0)) || ((((((0 <= i && x <= 1) && 0 <= y) && N <= i + 8) && y <= 1) && N <= 10) && 0 <= x)) || ((((((((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && 0 <= y + 3) && x <= 0) && N <= i) && 0 <= x + 7) && y <= 0)) || ((((((0 <= i && 0 <= y) && N <= i + 9) && x <= 0) && y <= 1) && N <= 10) && 0 <= x)) || ((((((0 <= i && N <= i + 4) && 0 <= y + 6) && x <= 0) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= i && 0 <= y + 5) && x <= 4) && N <= i + 1) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= y + 1 && x <= 3) && 0 <= i) && N <= i + 6) && N <= 10) && 0 <= x) && y <= 0)) || ((((((N <= i + 7 && 0 <= i) && 0 <= y) && x <= 2) && y <= 1) && N <= 10) && 0 <= x)) || ((((((0 <= i && 0 <= y) && y <= 5) && N <= i) && N <= 10) && 0 <= x) && x <= 5)) || ((((N <= i + 2 && 0 <= x + 3 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && 0 <= y) && y <= 5) && x <= 0)) || ((((((0 <= i && 0 <= y) && y <= 5) && x <= 4) && N <= i + 1) && N <= 10) && 0 <= x)) || ((((((0 <= i && x <= 4) && 0 <= y + 3) && N <= 10) && 0 <= x) && y <= 0) && N <= i + 3)) || ((((((y <= 4 && N <= i + 2) && 0 <= i) && 0 <= y) && x <= 4) && N <= 10) && 0 <= x)) || ((((((x <= 3 && 0 <= i) && 0 <= y + 7) && N <= i) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= i && 0 <= y) && x <= 7) && y <= 2) && N <= i + 1) && N <= 10) && 0 <= x)) || ((((((0 <= i && N <= i + 5) && 0 <= x + 4) && 0 <= y) && x <= 0) && y <= 1) && N <= 10)) || ((((((0 <= i && 0 <= y) && x <= 8) && N <= i + 1) && y <= 1) && N <= 10) && 0 <= x)) || ((((((0 <= i && 0 <= y) && N <= i + 1) && x <= 0) && N <= 10) && 0 <= x + 9) && y <= 0)) || ((((0 <= x + 8 && N <= i + 1) && x <= 0) && ((0 <= x + 2147483648 && 0 <= y + 1) && 0 <= i) && N <= 10) && y <= 0)) || ((((((0 <= i && x <= 8) && 0 <= y + 2) && N <= i) && N <= 10) && 0 <= x) && y <= 0)) || (((((((N <= i + 7 && 0 <= i) && x <= 1) && N <= 10) && 0 <= x) && y <= 0) || (N <= i + 7 && ((((0 <= i && 0 <= x + 1) && x <= 0) && N <= 10) && 0 <= y + 2147483648) && y <= 0)) && 0 <= y + 2)) || ((((((N <= i + 2 && 0 <= i) && 0 <= y) && y <= 3) && N <= 10) && 0 <= x) && x <= 5)) || (((0 <= x + 5 && (((0 <= x + 2147483648 && 0 <= i) && 0 <= y) && y <= 2) && N <= 10) && x <= 0) && N <= i + 3)) || ((((((0 <= i && 0 <= y + 7) && x <= 2) && N <= i + 1) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= i && x <= 10) && 0 <= y) && N <= i) && N <= 10) && 0 <= x) && y <= 0)) || ((((((N <= i + 2 && 0 <= y + 4) && 0 <= i) && x <= 4) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= y + 1 && 0 <= i) && x <= 6) && N <= 10) && 0 <= x) && y <= 0) && N <= i + 3)) || ((((((0 <= i && y <= 9) && 0 <= x + 1) && x <= 0) && N <= i) && N <= 10) && 0 <= y + 2147483648)) || ((((((0 <= i && x <= 7) && N <= i + 1) && 0 <= y + 2) && N <= 10) && 0 <= x) && y <= 0)) || ((0 <= y + 4 && N <= i + 4) && ((((0 <= x + 2 && 0 <= i) && x <= 0) && N <= 10) && 0 <= y + 2147483648) && y <= 0)) || ((((((0 <= i && 0 <= y) && N <= i + 4) && x <= 4) && y <= 2) && N <= 10) && 0 <= x)) || ((((((0 <= i && x <= 4) && 0 <= y + 6) && N <= i) && N <= 10) && 0 <= x) && y <= 0)) || ((((((x <= 9 && 0 <= y + 1) && 0 <= i) && N <= i) && N <= 10) && 0 <= x) && y <= 0)) || ((N <= i + 2 && (((((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && 0 <= y) && y <= 3) && x <= 0) && 0 <= x + 5)) || ((((((0 <= i && N <= i + 6) && y <= 3) && 0 <= y) && 0 <= x + 1) && x <= 0) && N <= 10)) || ((((((x <= 3 && 0 <= i) && N <= i + 4) && 0 <= y + 3) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= i && 0 <= y + 2) && N <= 10) && 0 <= x) && y <= 0) && x <= 5) && N <= i + 3)) || ((((((N <= i + 2 && 0 <= i) && y <= 6) && 0 <= y) && x <= 2) && N <= 10) && 0 <= x)) || ((((((N <= i + 7 && 0 <= y + 1) && 0 <= i) && x <= 2) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= i && N <= i + 4) && 0 <= y) && y <= 5) && 0 <= x + 1) && x <= 0) && N <= 10)) || ((((((0 <= i && N <= i + 5) && 0 <= y) && y <= 5) && x <= 0) && N <= 10) && 0 <= x)) || ((((((x <= 3 && 0 <= i) && N <= i + 6) && 0 <= y) && y <= 1) && N <= 10) && 0 <= x)) || ((((((0 <= y + 1 && 0 <= i) && N <= i + 9) && x <= 0) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= i && 0 <= y + 5) && x <= 1) && N <= i + 4) && N <= 10) && 0 <= x) && y <= 0)) || (((((((0 <= i && 0 <= x + 5) && x <= 0) && N <= 10) && 0 <= y + 2147483648) && 0 <= y) && y <= 5) && N <= i)) || ((((((0 <= x + 2 && N <= i + 7) && 0 <= i) && 0 <= y) && x <= 0) && y <= 1) && N <= 10)) || ((((((0 <= i && x <= 2) && N <= i) && N <= 10) && 0 <= x) && y <= 8) && 0 <= y + 2147483648)) || ((((((N <= i + 2 && 0 <= y + 1) && 0 <= i) && x <= 7) && N <= 10) && 0 <= x) && y <= 0)) || ((((((x <= 3 && 0 <= i) && N <= i + 5) && 0 <= y + 2) && N <= 10) && 0 <= x) && y <= 0)) || ((((((y <= 4 && 0 <= i) && N <= i + 5) && 0 <= y) && 0 <= x + 1) && x <= 0) && N <= 10)) || (((((0 <= i && x <= 0) && N <= i) && N <= 10) && 0 <= x) && 0 <= y + 2147483648)) || ((((((0 <= i && x <= 6) && 0 <= y) && y <= 3) && N <= i + 1) && N <= 10) && 0 <= x)) || ((((((0 <= y + 4 && 0 <= i) && N <= i + 5) && x <= 1) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= i && 0 <= y + 5) && N <= i + 5) && x <= 0) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= x + 3 && N <= i + 7) && 0 <= i) && 0 <= y) && x <= 0) && N <= 10) && y <= 0)) || ((((((0 <= y + 1 && 0 <= i) && x <= 8) && N <= i + 1) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= i && 0 <= x + 5) && N <= i + 5) && 0 <= y) && x <= 0) && N <= 10) && y <= 0)) || (((0 <= x + 8 && (((0 <= x + 2147483648 && 0 <= i) && 0 <= y + 2) && x <= 0) && N <= 10) && N <= i) && y <= 0)) || ((((((0 <= y + 1 && 0 <= i) && N <= i + 5) && x <= 4) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= i && N <= i + 6) && 0 <= y) && y <= 2) && x <= 2) && N <= 10) && 0 <= x)) || (((((0 <= x + 2 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && 0 <= y) && y <= 5) && x <= 0) && N <= i + 3)) || ((((0 <= x + 6 && ((0 <= x + 2147483648 && 0 <= y + 1) && 0 <= i) && N <= 10) && x <= 0) && y <= 0) && N <= i + 3)) || ((((((N <= i + 7 && 0 <= i) && 0 <= y) && y <= 3) && x <= 0) && N <= 10) && 0 <= x)) || ((((((0 <= i && N <= i + 8) && 0 <= y + 2) && x <= 0) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= i && 0 <= y) && y <= 3) && x <= 4) && N <= 10) && 0 <= x) && N <= i + 3)) || ((((((0 <= y + 4 && x <= 3) && 0 <= i) && N <= 10) && 0 <= x) && y <= 0) && N <= i + 3)) || ((((((0 <= i && 0 <= x + 4) && N <= i + 6) && 0 <= y) && x <= 0) && N <= 10) && y <= 0)) || ((((((0 <= y + 4 && 0 <= i) && x <= 6) && N <= i) && N <= 10) && 0 <= x) && y <= 0)) || (((((0 <= x + 3 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && N <= i + 1) && 0 <= y + 6) && x <= 0) && y <= 0)) || ((((((0 <= i && x <= 6) && 0 <= y) && y <= 1) && N <= 10) && 0 <= x) && N <= i + 3)) || ((((((N <= i + 2 && 0 <= i) && x <= 1) && 0 <= y) && y <= 7) && N <= 10) && 0 <= x)) || ((x <= 0 && N <= i) && y <= 6 && 0 <= y && 0 <= x + 4 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648)) || ((((((0 <= i && y <= 6) && 0 <= y) && 0 <= x + 1) && x <= 0) && N <= 10) && N <= i + 3)) || ((((((0 <= i && x <= 1) && 0 <= y) && N <= i + 9) && N <= 10) && 0 <= x) && y <= 0)) || ((((((N <= i + 2 && 0 <= i) && 0 <= y + 8) && x <= 0) && N <= 10) && 0 <= x) && y <= 0)) || (((((0 <= x + 3 && N <= i + 5) && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && 0 <= y + 2) && x <= 0) && y <= 0)) || ((((((0 <= i && 0 <= y) && N <= i + 4) && y <= 1) && N <= 10) && 0 <= x) && x <= 5)) || ((((((N <= i + 2 && 0 <= i) && 0 <= y) && y <= 7) && 0 <= x + 1) && x <= 0) && N <= 10)) || ((((((N <= i + 2 && 0 <= i) && x <= 6) && 0 <= y) && y <= 2) && N <= 10) && 0 <= x)) || ((((((0 <= i && 0 <= y + 7) && x <= 0) && N <= 10) && 0 <= x) && y <= 0) && N <= i + 3)) || ((((0 <= x + 2 && N <= i + 2) && y <= 6) && (0 <= i && x <= 0) && N <= 10) && 0 <= y)) || ((((0 <= y + 5 && N <= i + 1) && 0 <= x + 4 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && x <= 0) && y <= 0)) || ((((((0 <= i && 0 <= y) && 0 <= x + 1) && N <= i + 1) && x <= 0) && N <= 10) && y <= 8)) || (((0 <= x + 8 && x <= 0) && N <= i) && (((0 <= x + 2147483648 && 0 <= i) && 0 <= y) && y <= 2) && N <= 10)) || ((0 <= y + 7 && ((((0 <= x + 2 && 0 <= i) && x <= 0) && N <= 10) && 0 <= y + 2147483648) && y <= 0) && N <= i + 1)) || ((((((0 <= i && N <= i + 5) && 0 <= y) && N <= 10) && 0 <= x) && y <= 0) && x <= 5)) || ((((0 <= y + 6 && 0 <= x + 4 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && x <= 0) && N <= i) && y <= 0)) || ((((((0 <= i && 0 <= x + 5) && 0 <= y) && N <= i + 4) && x <= 0) && y <= 1) && N <= 10)) || ((((((N <= i + 2 && 0 <= i) && 0 <= y) && 0 <= x + 7) && x <= 0) && y <= 1) && N <= 10)) || ((((((0 <= i && x <= 1) && y <= 9) && N <= i) && N <= 10) && 0 <= x) && 0 <= y + 2147483648)) || ((((((((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && 0 <= y) && y <= 3) && x <= 0) && 0 <= x + 6) && N <= i + 1)) || (((((0 <= x + 3 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && N <= i + 2) && 0 <= y + 5) && x <= 0) && y <= 0)) || ((((((N <= i + 2 && 0 <= i) && 0 <= y) && x <= 7) && y <= 1) && N <= 10) && 0 <= x)) || ((((((N <= i + 2 && x <= 3) && 0 <= i) && 0 <= y + 5) && N <= 10) && 0 <= x) && y <= 0)) || ((((((N <= i + 2 && 0 <= i) && 0 <= y + 3) && N <= 10) && 0 <= x) && y <= 0) && x <= 5)) || ((((((0 <= y + 4 && 0 <= i) && N <= i + 4) && x <= 2) && N <= 10) && 0 <= x) && y <= 0)) || ((((N <= i + 5 && 0 <= y) && y <= 3) && x <= 0) && 0 <= x + 2 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648)) || ((((((N <= i + 2 && 0 <= i) && 0 <= y) && x <= 8) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= i && 0 <= y + 5) && x <= 2) && N <= 10) && 0 <= x) && y <= 0) && N <= i + 3)) || ((((((0 <= y + 1 && 0 <= i) && N <= i + 4) && N <= 10) && 0 <= x) && y <= 0) && x <= 5)) || ((((((0 <= i && 0 <= y) && y <= 2) && N <= 10) && 0 <= x) && x <= 5) && N <= i + 3)) || ((((((0 <= i && 0 <= y) && y <= 5) && x <= 2) && N <= 10) && 0 <= x) && N <= i + 3)) || ((((((x <= 3 && 0 <= i) && y <= 6) && 0 <= y) && N <= i + 1) && N <= 10) && 0 <= x)) || ((0 <= y + 4 && N <= i + 5) && ((((0 <= i && 0 <= x + 1) && x <= 0) && N <= 10) && 0 <= y + 2147483648) && y <= 0)) || ((((((0 <= i && 0 <= x + 6) && N <= i + 4) && 0 <= y) && x <= 0) && N <= 10) && y <= 0)) || (((((((0 <= x + 2147483648 && 0 <= y + 1) && 0 <= i) && N <= 10) && x <= 0) && N <= i) && 0 <= x + 9) && y <= 0)) || ((((((0 <= y + 1 && 0 <= i) && x <= 1) && N <= i + 8) && N <= 10) && 0 <= x) && y <= 0)) || (((((((0 <= i && x <= 1) && N <= i + 1) && N <= 10) && 0 <= x) && y <= 0) || (N <= i + 1 && ((((0 <= i && 0 <= x + 1) && x <= 0) && N <= 10) && 0 <= y + 2147483648) && y <= 0)) && 0 <= y + 9)) || ((((((0 <= i && x <= 1) && N <= i + 6) && 0 <= y) && y <= 3) && N <= 10) && 0 <= x)) || ((((N <= i + 5 && 0 <= x + 4) && ((0 <= x + 2147483648 && 0 <= y + 1) && 0 <= i) && N <= 10) && x <= 0) && y <= 0)) || (((((0 <= x + 3 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && 0 <= y + 7) && x <= 0) && N <= i) && y <= 0)) || ((((((0 <= x + 2 && 0 <= i) && N <= i + 8) && 0 <= y) && x <= 0) && N <= 10) && y <= 0)) || (((0 <= y + 5 && (((0 <= i && 0 <= x + 5) && x <= 0) && N <= 10) && 0 <= y + 2147483648) && N <= i) && y <= 0)) || ((((((0 <= i && 0 <= y) && x <= 7) && N <= 10) && 0 <= x) && y <= 0) && N <= i + 3)) || (((0 <= x + 3 && N <= i + 5) && (((0 <= x + 2147483648 && 0 <= i) && 0 <= y) && y <= 2) && N <= 10) && x <= 0)) || ((((((0 <= i && N <= i + 5) && 0 <= y) && x <= 4) && y <= 1) && N <= 10) && 0 <= x)) || (((y <= 7 && ((0 <= x + 3 && 0 <= i) && 0 <= y) && N <= 10) && x <= 0) && N <= i)) || (((((0 <= y + 4 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && 0 <= x + 6) && x <= 0) && N <= i) && y <= 0)) || ((((((0 <= i && N <= i + 6) && x <= 2) && 0 <= y + 2) && N <= 10) && 0 <= x) && y <= 0)) || ((((((N <= i + 2 && 0 <= i) && x <= 2) && 0 <= y + 6) && N <= 10) && 0 <= x) && y <= 0)) || ((((((N <= i + 2 && x <= 3) && 0 <= i) && 0 <= y) && y <= 5) && N <= 10) && 0 <= x)) || ((((((y <= 4 && x <= 3) && 0 <= i) && 0 <= y) && N <= 10) && 0 <= x) && N <= i + 3)) || ((((((x <= 9 && 0 <= i) && 0 <= y) && y <= 1) && N <= i) && N <= 10) && 0 <= x)) || ((((N <= i + 2 && ((0 <= x + 2147483648 && 0 <= y + 1) && 0 <= i) && N <= 10) && x <= 0) && 0 <= x + 7) && y <= 0)) || (((((0 <= x + 2 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && 0 <= y) && y <= 7) && N <= i + 1) && x <= 0)) || (((((0 <= i && 0 <= y) && x <= 0) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= x + 2 && 0 <= i) && x <= 0) && N <= 10) && 0 <= y + 2147483648) && y <= 0) && N <= i)) || ((((((x <= 3 && 0 <= i) && N <= i + 5) && 0 <= y) && y <= 2) && N <= 10) && 0 <= x)) || ((((((0 <= i && y <= 6) && 0 <= y) && N <= i + 4) && x <= 0) && N <= 10) && 0 <= x)) || ((((((((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && 0 <= y) && y <= 3) && x <= 0) && N <= i) && 0 <= x + 7)) || ((((((x <= 3 && 0 <= i) && 0 <= y) && y <= 3) && N <= i + 4) && N <= 10) && 0 <= x)) || ((((((0 <= i && 0 <= y) && x <= 7) && y <= 3) && N <= i) && N <= 10) && 0 <= x)) || (((((((0 <= x + 2147483648 && 0 <= i) && 0 <= y + 2) && x <= 0) && N <= 10) && N <= i + 1) && 0 <= x + 7) && y <= 0)) || ((((((0 <= y + 4 && 0 <= i) && N <= i + 1) && N <= 10) && 0 <= x) && y <= 0) && x <= 5)) || (((((((0 <= x + 2147483648 && 0 <= i) && 0 <= y + 2) && x <= 0) && N <= 10) && 0 <= x + 5) && y <= 0) && N <= i + 3)) || (((0 <= x + 5 && 0 <= y) && (y <= 4 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && x <= 0) && N <= i + 1)) || ((0 <= y + 5 && N <= i + 4) && ((((0 <= i && 0 <= x + 1) && x <= 0) && N <= 10) && 0 <= y + 2147483648) && y <= 0)) || ((N <= i + 2 && ((((0 <= x + 2 && 0 <= i) && x <= 0) && N <= 10) && 0 <= y + 2147483648) && y <= 0) && 0 <= y + 6)) || ((((((x <= 3 && 0 <= i) && 0 <= y) && y <= 7) && N <= i) && N <= 10) && 0 <= x)) || ((((((0 <= i && 0 <= y) && x <= 0) && y <= 1) && N <= i) && N <= 10) && 0 <= x + 9)) || ((((((0 <= i && N <= i + 5) && x <= 2) && 0 <= y + 3) && N <= 10) && 0 <= x) && y <= 0)) || ((((((N <= i + 7 && 0 <= i) && 0 <= y) && y <= 2) && 0 <= x + 1) && x <= 0) && N <= 10)) || ((((((0 <= i && x <= 6) && N <= i + 1) && 0 <= y + 3) && N <= 10) && 0 <= x) && y <= 0)) || (((N <= i + 6 && 0 <= y) && y <= 2) && ((0 <= x + 2 && 0 <= i) && x <= 0) && N <= 10)) || ((((((x <= 3 && 0 <= i) && N <= i + 1) && 0 <= y + 6) && N <= 10) && 0 <= x) && y <= 0)) || (((N <= i + 2 && 0 <= y) && x <= 0) && y <= 4 && 0 <= x + 4 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648)) || ((((((0 <= i && 0 <= y) && N <= i + 8) && y <= 2) && x <= 0) && N <= 10) && 0 <= x)) || ((((((0 <= i && y <= 6) && 0 <= y) && x <= 4) && N <= i) && N <= 10) && 0 <= x)) || ((((((0 <= i && x <= 7) && 0 <= y + 3) && N <= i) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= i && 0 <= y + 5) && N <= i) && N <= 10) && 0 <= x) && y <= 0) && x <= 5)) || ((0 <= x + 6 && 0 <= y && (y <= 4 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && x <= 0) && N <= i)) || ((((((y <= 4 && 0 <= i) && N <= i + 6) && 0 <= y) && x <= 0) && N <= 10) && 0 <= x)) || (((0 <= x + 3 && 0 <= y) && ((y <= 4 && 0 <= i) && x <= 0) && N <= 10) && N <= i + 3)) || ((((((N <= i + 7 && 0 <= i) && 0 <= y + 3) && x <= 0) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= i && 0 <= y) && x <= 0) && 0 <= x + 7) && N <= 10) && y <= 0) && N <= i + 3)) || ((((0 <= x + 3 && N <= i + 6) && ((0 <= x + 2147483648 && 0 <= y + 1) && 0 <= i) && N <= 10) && x <= 0) && y <= 0)) || ((((((N <= i + 2 && 0 <= i) && 0 <= y) && x <= 0) && N <= 10) && 0 <= x) && y <= 8)) || ((((((N <= i + 2 && 0 <= i) && x <= 6) && 0 <= y + 2) && N <= 10) && 0 <= x) && y <= 0)) || (((((0 <= y + 1 && N <= i + 8) && 0 <= i && N <= 10) && 0 <= x + 1) && x <= 0) && y <= 0)) || ((((((0 <= x + 3 && 0 <= i) && 0 <= y) && N <= 10) && y <= 6) && N <= i + 1) && x <= 0)) || ((((((y <= 4 && 0 <= i) && N <= i + 5) && x <= 1) && 0 <= y) && N <= 10) && 0 <= x)) || (((((((0 <= i && x <= 1) && N <= 10) && 0 <= x) && y <= 0) && N <= i + 3) || ((((((0 <= i && 0 <= x + 1) && x <= 0) && N <= 10) && 0 <= y + 2147483648) && y <= 0) && N <= i + 3)) && 0 <= y + 6)) || ((((((N <= i + 2 && 0 <= i) && 0 <= y + 7) && x <= 1) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= i && 0 <= y) && N <= i + 8) && x <= 2) && N <= 10) && 0 <= x) && y <= 0)) || ((N <= i + 5 && ((((0 <= x + 2 && 0 <= i) && x <= 0) && N <= 10) && 0 <= y + 2147483648) && y <= 0) && 0 <= y + 3)) || ((((((0 <= i && 0 <= y) && y <= 7) && x <= 0) && N <= 10) && 0 <= x) && N <= i + 3)) || ((((((0 <= i && N <= i + 6) && 0 <= y) && x <= 4) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= x + 8 && 0 <= i) && 0 <= y) && N <= i + 1) && x <= 0) && y <= 1) && N <= 10)) || ((((0 <= x + 5 && N <= i + 4) && ((0 <= x + 2147483648 && 0 <= y + 1) && 0 <= i) && N <= 10) && x <= 0) && y <= 0)) || ((((((y <= 4 && 0 <= i) && x <= 6) && 0 <= y) && N <= i) && N <= 10) && 0 <= x)) || ((((N <= i + 2 && 0 <= y + 4) && 0 <= x + 4 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && x <= 0) && y <= 0)) || ((((((0 <= i && 0 <= y) && y <= 7) && x <= 2) && N <= i + 1) && N <= 10) && 0 <= x)) || (((N <= i + 1 && x <= 0) && 0 <= x + 7) && (((0 <= x + 2147483648 && 0 <= i) && 0 <= y) && y <= 2) && N <= 10) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 36 locations, 10 error locations. SAFE Result, 122.1s OverallTime, 49 OverallIterations, 13 TraceHistogramMax, 13.1s AutomataDifference, 0.0s DeadEndRemovalTime, 85.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1469 SDtfs, 8173 SDslu, 6256 SDs, 0 SdLazy, 1594 SolverSat, 1407 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4914 GetRequests, 4380 SyntacticMatches, 0 SemanticMatches, 534 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107157occurred in iteration=46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 7 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 16.4s AutomataMinimizationTime, 49 MinimizatonAttempts, 261319 StatesRemovedByMinimization, 44 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 1839 NumberOfFragments, 6091 HoareAnnotationTreeSize, 5 FomulaSimplifications, 292925 FormulaSimplificationTreeSizeReduction, 24.5s HoareSimplificationTime, 5 FomulaSimplificationsInter, 79435 FormulaSimplificationTreeSizeReductionInter, 61.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 4790 NumberOfCodeBlocks, 4790 NumberOfCodeBlocksAsserted, 174 NumberOfCheckSat, 6972 ConstructedInterpolants, 0 QuantifiedInterpolants, 1738298 SizeOfPredicates, 2 NumberOfNonLiveVariables, 5325 ConjunctsInSsa, 298 ConjunctsInUnsatCore, 133 InterpolantComputations, 11 PerfectInterpolantSequences, 559/20934 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...