./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-lit/gj2007_true-unreach-call_true-termination.c.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-lit/gj2007_true-unreach-call_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1a9963030a13e3c679db84f21688cc66372a5ac3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 04:21:15,200 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 04:21:15,201 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 04:21:15,207 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 04:21:15,207 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 04:21:15,207 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 04:21:15,208 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 04:21:15,209 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 04:21:15,209 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 04:21:15,210 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 04:21:15,210 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 04:21:15,210 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 04:21:15,211 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 04:21:15,211 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 04:21:15,212 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 04:21:15,212 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 04:21:15,212 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 04:21:15,213 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 04:21:15,214 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 04:21:15,215 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 04:21:15,215 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 04:21:15,216 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 04:21:15,217 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 04:21:15,217 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 04:21:15,217 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 04:21:15,217 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 04:21:15,218 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 04:21:15,218 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 04:21:15,219 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 04:21:15,219 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 04:21:15,219 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 04:21:15,219 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 04:21:15,220 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 04:21:15,220 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 04:21:15,220 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 04:21:15,220 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 04:21:15,221 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 04:21:15,227 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 04:21:15,227 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 04:21:15,228 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 04:21:15,228 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 04:21:15,228 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 04:21:15,228 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 04:21:15,228 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 04:21:15,228 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 04:21:15,228 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 04:21:15,228 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 04:21:15,229 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 04:21:15,229 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 04:21:15,229 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 04:21:15,229 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 04:21:15,229 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 04:21:15,229 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 04:21:15,229 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 04:21:15,229 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 04:21:15,230 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 04:21:15,230 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 04:21:15,230 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 04:21:15,230 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 04:21:15,230 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 04:21:15,230 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 04:21:15,230 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 04:21:15,230 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 04:21:15,230 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 04:21:15,230 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 04:21:15,230 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 04:21:15,231 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 04:21:15,231 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 04:21:15,231 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 04:21:15,231 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 04:21:15,231 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 04:21:15,231 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 04:21:15,231 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 04:21:15,231 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_18a58a35-fdff-45b2-ba43-a652470bbaed/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 ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1a9963030a13e3c679db84f21688cc66372a5ac3 [2018-12-02 04:21:15,249 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 04:21:15,258 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 04:21:15,260 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 04:21:15,262 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 04:21:15,262 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 04:21:15,262 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/bin-2019/utaipan/../../sv-benchmarks/c/loop-lit/gj2007_true-unreach-call_true-termination.c.i [2018-12-02 04:21:15,304 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/bin-2019/utaipan/data/61c46abf5/70cffd2510654bba877a5121446c3a0e/FLAG8d65c70ab [2018-12-02 04:21:15,741 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 04:21:15,742 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/sv-benchmarks/c/loop-lit/gj2007_true-unreach-call_true-termination.c.i [2018-12-02 04:21:15,745 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/bin-2019/utaipan/data/61c46abf5/70cffd2510654bba877a5121446c3a0e/FLAG8d65c70ab [2018-12-02 04:21:15,753 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/bin-2019/utaipan/data/61c46abf5/70cffd2510654bba877a5121446c3a0e [2018-12-02 04:21:15,755 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 04:21:15,756 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 04:21:15,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 04:21:15,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 04:21:15,759 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 04:21:15,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:21:15" (1/1) ... [2018-12-02 04:21:15,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@428c1b87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:21:15, skipping insertion in model container [2018-12-02 04:21:15,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:21:15" (1/1) ... [2018-12-02 04:21:15,765 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 04:21:15,774 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 04:21:15,854 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:21:15,857 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 04:21:15,865 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:21:15,873 INFO L195 MainTranslator]: Completed translation [2018-12-02 04:21:15,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:21:15 WrapperNode [2018-12-02 04:21:15,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 04:21:15,873 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 04:21:15,874 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 04:21:15,874 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 04:21:15,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:21:15" (1/1) ... [2018-12-02 04:21:15,881 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:21:15" (1/1) ... [2018-12-02 04:21:15,884 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 04:21:15,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 04:21:15,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 04:21:15,884 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 04:21:15,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:21:15" (1/1) ... [2018-12-02 04:21:15,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:21:15" (1/1) ... [2018-12-02 04:21:15,890 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:21:15" (1/1) ... [2018-12-02 04:21:15,890 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:21:15" (1/1) ... [2018-12-02 04:21:15,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:21:15" (1/1) ... [2018-12-02 04:21:15,894 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:21:15" (1/1) ... [2018-12-02 04:21:15,895 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:21:15" (1/1) ... [2018-12-02 04:21:15,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 04:21:15,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 04:21:15,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 04:21:15,896 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 04:21:15,896 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:21:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:15,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 04:21:15,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 04:21:15,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 04:21:15,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 04:21:15,956 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 04:21:15,956 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 04:21:15,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-02 04:21:15,957 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-02 04:21:16,028 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 04:21:16,028 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 04:21:16,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:21:16 BoogieIcfgContainer [2018-12-02 04:21:16,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 04:21:16,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 04:21:16,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 04:21:16,030 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 04:21:16,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 04:21:15" (1/3) ... [2018-12-02 04:21:16,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6950ada6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:21:16, skipping insertion in model container [2018-12-02 04:21:16,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:21:15" (2/3) ... [2018-12-02 04:21:16,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6950ada6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:21:16, skipping insertion in model container [2018-12-02 04:21:16,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:21:16" (3/3) ... [2018-12-02 04:21:16,032 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007_true-unreach-call_true-termination.c.i [2018-12-02 04:21:16,037 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 04:21:16,041 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 04:21:16,050 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 04:21:16,067 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 04:21:16,067 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 04:21:16,067 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 04:21:16,067 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 04:21:16,067 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 04:21:16,068 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 04:21:16,068 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 04:21:16,068 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 04:21:16,078 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-12-02 04:21:16,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 04:21:16,081 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:16,081 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:16,083 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:16,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:16,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1712329921, now seen corresponding path program 1 times [2018-12-02 04:21:16,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:16,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:16,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:16,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:16,115 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:16,145 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 04:21:16,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:21:16,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 04:21:16,146 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:21:16,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 04:21:16,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 04:21:16,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 04:21:16,157 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-12-02 04:21:16,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:16,169 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-12-02 04:21:16,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 04:21:16,169 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-12-02 04:21:16,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:16,174 INFO L225 Difference]: With dead ends: 31 [2018-12-02 04:21:16,174 INFO L226 Difference]: Without dead ends: 12 [2018-12-02 04:21:16,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 04:21:16,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-02 04:21:16,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-02 04:21:16,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-02 04:21:16,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-12-02 04:21:16,196 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2018-12-02 04:21:16,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:16,196 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-12-02 04:21:16,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 04:21:16,196 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-12-02 04:21:16,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 04:21:16,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:16,196 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:16,197 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:16,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:16,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1703094711, now seen corresponding path program 1 times [2018-12-02 04:21:16,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:16,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:16,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:16,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:16,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:16,217 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 04:21:16,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:21:16,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:21:16,217 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:21:16,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:21:16,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:21:16,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:21:16,218 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2018-12-02 04:21:16,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:16,230 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2018-12-02 04:21:16,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:21:16,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 04:21:16,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:16,231 INFO L225 Difference]: With dead ends: 21 [2018-12-02 04:21:16,231 INFO L226 Difference]: Without dead ends: 14 [2018-12-02 04:21:16,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 04:21:16,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-02 04:21:16,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-02 04:21:16,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-02 04:21:16,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-12-02 04:21:16,234 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-12-02 04:21:16,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:16,234 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-12-02 04:21:16,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:21:16,234 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-12-02 04:21:16,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-02 04:21:16,234 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:16,234 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:16,234 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:16,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:16,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1337256884, now seen corresponding path program 1 times [2018-12-02 04:21:16,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:16,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:16,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:16,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:16,235 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:16,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:21:16,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:16,253 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:16,254 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2018-12-02 04:21:16,255 INFO L205 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [26], [29], [31], [37], [38], [39], [41] [2018-12-02 04:21:16,273 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 04:21:16,273 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 04:21:16,361 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 04:21:16,362 INFO L272 AbstractInterpreter]: Visited 12 different actions 28 times. Merged at 3 different actions 9 times. Widened at 1 different actions 1 times. Performed 78 root evaluator evaluations with a maximum evaluation depth of 4. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 2 variables. [2018-12-02 04:21:16,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:16,368 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 04:21:16,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:16,368 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:16,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:16,375 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 04:21:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:16,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:16,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:21:16,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:16,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:21:16,439 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 04:21:16,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2018-12-02 04:21:16,440 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:21:16,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:21:16,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:21:16,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:21:16,440 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 3 states. [2018-12-02 04:21:16,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:16,449 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-12-02 04:21:16,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:21:16,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-02 04:21:16,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:16,450 INFO L225 Difference]: With dead ends: 21 [2018-12-02 04:21:16,450 INFO L226 Difference]: Without dead ends: 16 [2018-12-02 04:21:16,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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 04:21:16,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-02 04:21:16,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-12-02 04:21:16,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-02 04:21:16,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-12-02 04:21:16,452 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-12-02 04:21:16,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:16,452 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-02 04:21:16,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:21:16,452 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-12-02 04:21:16,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 04:21:16,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:16,453 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:16,453 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:16,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:16,453 INFO L82 PathProgramCache]: Analyzing trace with hash 2011681711, now seen corresponding path program 1 times [2018-12-02 04:21:16,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:16,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:16,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:16,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:16,454 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:16,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:16,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:21:16,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:16,476 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:16,476 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-12-02 04:21:16,476 INFO L205 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [18], [26], [29], [31], [37], [38], [39], [41] [2018-12-02 04:21:16,477 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 04:21:16,477 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 04:21:16,507 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 04:21:16,507 INFO L272 AbstractInterpreter]: Visited 13 different actions 45 times. Merged at 4 different actions 13 times. Widened at 1 different actions 1 times. Performed 148 root evaluator evaluations with a maximum evaluation depth of 4. Performed 148 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 5 fixpoints after 2 different actions. Largest state had 2 variables. [2018-12-02 04:21:16,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:16,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 04:21:16,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:16,509 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:16,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:16,515 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 04:21:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:16,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:16,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:21:16,524 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:16,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:21:16,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:16,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-02 04:21:16,559 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:16,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:21:16,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:21:16,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:21:16,560 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 4 states. [2018-12-02 04:21:16,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:16,571 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-12-02 04:21:16,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:21:16,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-02 04:21:16,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:16,572 INFO L225 Difference]: With dead ends: 25 [2018-12-02 04:21:16,572 INFO L226 Difference]: Without dead ends: 17 [2018-12-02 04:21:16,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 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 04:21:16,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-02 04:21:16,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-02 04:21:16,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-02 04:21:16,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-12-02 04:21:16,575 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-12-02 04:21:16,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:16,575 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-12-02 04:21:16,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:21:16,575 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-12-02 04:21:16,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 04:21:16,576 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:16,576 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:16,576 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:16,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:16,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1891741908, now seen corresponding path program 2 times [2018-12-02 04:21:16,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:16,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:16,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:16,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:16,577 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:16,610 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:21:16,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:16,610 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:16,611 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:16,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:16,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:16,611 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:16,617 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 04:21:16,617 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 04:21:16,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-02 04:21:16,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:16,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:16,651 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:21:16,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:16,673 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:21:16,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:16,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-12-02 04:21:16,688 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:16,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 04:21:16,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 04:21:16,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-02 04:21:16,689 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 8 states. [2018-12-02 04:21:16,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:16,712 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2018-12-02 04:21:16,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 04:21:16,713 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-02 04:21:16,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:16,715 INFO L225 Difference]: With dead ends: 32 [2018-12-02 04:21:16,715 INFO L226 Difference]: Without dead ends: 24 [2018-12-02 04:21:16,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-02 04:21:16,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-02 04:21:16,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-12-02 04:21:16,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-02 04:21:16,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-12-02 04:21:16,720 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 16 [2018-12-02 04:21:16,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:16,720 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-12-02 04:21:16,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 04:21:16,720 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-12-02 04:21:16,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 04:21:16,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:16,721 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:16,721 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:16,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:16,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1567930911, now seen corresponding path program 3 times [2018-12-02 04:21:16,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:16,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:16,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:21:16,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:16,723 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:16,760 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 04:21:16,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:16,761 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:16,761 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:16,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:16,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:16,761 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:16,767 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 04:21:16,767 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 04:21:16,773 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 04:21:16,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:16,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:16,776 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 04:21:16,777 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:16,818 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 04:21:16,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:16,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-12-02 04:21:16,833 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:16,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 04:21:16,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 04:21:16,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-02 04:21:16,833 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 6 states. [2018-12-02 04:21:16,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:16,847 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2018-12-02 04:21:16,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 04:21:16,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-12-02 04:21:16,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:16,847 INFO L225 Difference]: With dead ends: 37 [2018-12-02 04:21:16,848 INFO L226 Difference]: Without dead ends: 25 [2018-12-02 04:21:16,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 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 04:21:16,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-02 04:21:16,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-02 04:21:16,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-02 04:21:16,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-12-02 04:21:16,850 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 22 [2018-12-02 04:21:16,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:16,850 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-12-02 04:21:16,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 04:21:16,850 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-12-02 04:21:16,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 04:21:16,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:16,851 INFO L402 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:16,851 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:16,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:16,851 INFO L82 PathProgramCache]: Analyzing trace with hash 92956828, now seen corresponding path program 4 times [2018-12-02 04:21:16,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:16,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:16,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:21:16,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:16,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:16,906 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 04:21:16,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:16,906 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:16,906 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:16,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:16,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:16,906 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:16,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:16,915 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 04:21:16,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:16,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:16,928 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 04:21:16,928 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:16,965 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 04:21:16,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:16,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-12-02 04:21:16,979 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:16,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 04:21:16,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 04:21:16,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-02 04:21:16,980 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 7 states. [2018-12-02 04:21:16,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:16,995 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-12-02 04:21:16,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 04:21:16,996 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-12-02 04:21:16,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:16,996 INFO L225 Difference]: With dead ends: 39 [2018-12-02 04:21:16,996 INFO L226 Difference]: Without dead ends: 27 [2018-12-02 04:21:16,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 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 04:21:16,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-02 04:21:16,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-02 04:21:16,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-02 04:21:16,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-12-02 04:21:16,999 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 24 [2018-12-02 04:21:16,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:16,999 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-12-02 04:21:16,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 04:21:16,999 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-12-02 04:21:17,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 04:21:17,000 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:17,000 INFO L402 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:17,000 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:17,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:17,000 INFO L82 PathProgramCache]: Analyzing trace with hash -17929255, now seen corresponding path program 5 times [2018-12-02 04:21:17,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:17,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:17,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:17,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:17,001 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:17,032 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 04:21:17,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:17,032 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:17,032 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:17,032 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:17,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:17,032 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:17,040 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 04:21:17,040 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 04:21:17,049 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-02 04:21:17,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:17,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:17,087 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-02 04:21:17,087 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:17,134 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-02 04:21:17,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:17,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2018-12-02 04:21:17,149 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:17,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 04:21:17,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 04:21:17,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-02 04:21:17,150 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 12 states. [2018-12-02 04:21:17,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:17,184 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2018-12-02 04:21:17,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 04:21:17,184 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-12-02 04:21:17,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:17,185 INFO L225 Difference]: With dead ends: 44 [2018-12-02 04:21:17,185 INFO L226 Difference]: Without dead ends: 32 [2018-12-02 04:21:17,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 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 04:21:17,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-02 04:21:17,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-12-02 04:21:17,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-02 04:21:17,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-12-02 04:21:17,188 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 26 [2018-12-02 04:21:17,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:17,188 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-12-02 04:21:17,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 04:21:17,188 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-12-02 04:21:17,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 04:21:17,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:17,189 INFO L402 BasicCegarLoop]: trace histogram [10, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:17,189 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:17,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:17,189 INFO L82 PathProgramCache]: Analyzing trace with hash 331873105, now seen corresponding path program 6 times [2018-12-02 04:21:17,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:17,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:17,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:21:17,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:17,190 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:17,236 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 04:21:17,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:17,236 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:17,236 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:17,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:17,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:17,236 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:17,243 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 04:21:17,243 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 04:21:17,251 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 04:21:17,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:17,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:17,259 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 04:21:17,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:17,333 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 04:21:17,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:17,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-12-02 04:21:17,347 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:17,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 04:21:17,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 04:21:17,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-02 04:21:17,348 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 9 states. [2018-12-02 04:21:17,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:17,369 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2018-12-02 04:21:17,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 04:21:17,370 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-12-02 04:21:17,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:17,370 INFO L225 Difference]: With dead ends: 47 [2018-12-02 04:21:17,370 INFO L226 Difference]: Without dead ends: 33 [2018-12-02 04:21:17,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 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 04:21:17,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-02 04:21:17,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-02 04:21:17,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 04:21:17,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-12-02 04:21:17,373 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 30 [2018-12-02 04:21:17,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:17,373 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-12-02 04:21:17,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 04:21:17,373 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-12-02 04:21:17,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 04:21:17,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:17,373 INFO L402 BasicCegarLoop]: trace histogram [11, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:17,373 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:17,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:17,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1078338354, now seen corresponding path program 7 times [2018-12-02 04:21:17,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:17,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:17,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:21:17,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:17,374 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:17,410 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 04:21:17,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:17,410 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:17,410 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:17,410 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:17,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:17,410 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:17,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:17,416 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 04:21:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:17,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:17,430 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 04:21:17,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:17,507 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 04:21:17,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:17,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2018-12-02 04:21:17,521 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:17,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 04:21:17,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 04:21:17,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-02 04:21:17,522 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 10 states. [2018-12-02 04:21:17,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:17,537 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-12-02 04:21:17,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 04:21:17,538 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-12-02 04:21:17,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:17,538 INFO L225 Difference]: With dead ends: 49 [2018-12-02 04:21:17,538 INFO L226 Difference]: Without dead ends: 35 [2018-12-02 04:21:17,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 57 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 04:21:17,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-02 04:21:17,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-02 04:21:17,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-02 04:21:17,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-12-02 04:21:17,542 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 32 [2018-12-02 04:21:17,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:17,542 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-12-02 04:21:17,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 04:21:17,542 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-12-02 04:21:17,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 04:21:17,543 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:17,543 INFO L402 BasicCegarLoop]: trace histogram [12, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:17,543 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:17,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:17,543 INFO L82 PathProgramCache]: Analyzing trace with hash 918115083, now seen corresponding path program 8 times [2018-12-02 04:21:17,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:17,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:17,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:17,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:17,544 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:17,600 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 63 proven. 72 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 04:21:17,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:17,600 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:17,600 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:17,600 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:17,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:17,601 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:17,607 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 04:21:17,607 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 04:21:17,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-02 04:21:17,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:17,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:17,683 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-12-02 04:21:17,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:17,740 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-12-02 04:21:17,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:17,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 21 [2018-12-02 04:21:17,754 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:17,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 04:21:17,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 04:21:17,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-02 04:21:17,754 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 16 states. [2018-12-02 04:21:17,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:17,787 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2018-12-02 04:21:17,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 04:21:17,787 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2018-12-02 04:21:17,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:17,788 INFO L225 Difference]: With dead ends: 54 [2018-12-02 04:21:17,788 INFO L226 Difference]: Without dead ends: 40 [2018-12-02 04:21:17,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-02 04:21:17,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-02 04:21:17,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-12-02 04:21:17,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-02 04:21:17,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-12-02 04:21:17,792 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 34 [2018-12-02 04:21:17,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:17,792 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-12-02 04:21:17,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 04:21:17,793 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-12-02 04:21:17,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 04:21:17,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:17,793 INFO L402 BasicCegarLoop]: trace histogram [14, 9, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:17,793 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:17,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:17,794 INFO L82 PathProgramCache]: Analyzing trace with hash 287297795, now seen corresponding path program 9 times [2018-12-02 04:21:17,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:17,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:17,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:21:17,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:17,795 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:17,854 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 04:21:17,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:17,854 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:17,854 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:17,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:17,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:17,854 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:17,860 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 04:21:17,860 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 04:21:17,867 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 04:21:17,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:17,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:17,872 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 04:21:17,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:17,974 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 04:21:17,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:17,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-12-02 04:21:17,988 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:17,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 04:21:17,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 04:21:17,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-02 04:21:17,989 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 12 states. [2018-12-02 04:21:18,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:18,013 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2018-12-02 04:21:18,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 04:21:18,013 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-12-02 04:21:18,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:18,014 INFO L225 Difference]: With dead ends: 57 [2018-12-02 04:21:18,014 INFO L226 Difference]: Without dead ends: 41 [2018-12-02 04:21:18,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 67 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 04:21:18,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-02 04:21:18,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-02 04:21:18,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-02 04:21:18,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-12-02 04:21:18,016 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 38 [2018-12-02 04:21:18,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:18,016 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-12-02 04:21:18,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 04:21:18,017 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-12-02 04:21:18,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 04:21:18,017 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:18,017 INFO L402 BasicCegarLoop]: trace histogram [15, 10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:18,017 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:18,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:18,017 INFO L82 PathProgramCache]: Analyzing trace with hash -955587200, now seen corresponding path program 10 times [2018-12-02 04:21:18,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:18,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:18,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:21:18,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:18,018 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:18,084 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 04:21:18,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:18,084 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:18,084 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:18,084 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:18,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:18,084 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:18,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:18,093 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 04:21:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:18,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:18,106 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 04:21:18,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:18,219 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 04:21:18,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:18,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-12-02 04:21:18,234 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:18,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 04:21:18,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 04:21:18,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-02 04:21:18,235 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 13 states. [2018-12-02 04:21:18,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:18,260 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-12-02 04:21:18,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 04:21:18,260 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-12-02 04:21:18,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:18,261 INFO L225 Difference]: With dead ends: 59 [2018-12-02 04:21:18,261 INFO L226 Difference]: Without dead ends: 43 [2018-12-02 04:21:18,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 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 04:21:18,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-02 04:21:18,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-02 04:21:18,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 04:21:18,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-12-02 04:21:18,264 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 40 [2018-12-02 04:21:18,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:18,264 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-12-02 04:21:18,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 04:21:18,264 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-12-02 04:21:18,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-02 04:21:18,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:18,265 INFO L402 BasicCegarLoop]: trace histogram [16, 11, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:18,265 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:18,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:18,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1367159107, now seen corresponding path program 11 times [2018-12-02 04:21:18,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:18,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:18,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:18,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:18,265 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:18,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:18,335 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 108 proven. 132 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 04:21:18,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:18,335 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:18,336 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:18,336 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:18,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:18,336 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:18,341 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 04:21:18,341 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 04:21:18,350 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-02 04:21:18,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:18,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:18,412 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 121 proven. 25 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-12-02 04:21:18,412 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:18,477 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 121 proven. 25 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-12-02 04:21:18,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:18,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 26 [2018-12-02 04:21:18,492 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:18,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-02 04:21:18,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 04:21:18,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-02 04:21:18,493 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 20 states. [2018-12-02 04:21:18,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:18,543 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2018-12-02 04:21:18,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 04:21:18,543 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2018-12-02 04:21:18,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:18,544 INFO L225 Difference]: With dead ends: 64 [2018-12-02 04:21:18,544 INFO L226 Difference]: Without dead ends: 48 [2018-12-02 04:21:18,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 73 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 04:21:18,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-02 04:21:18,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-12-02 04:21:18,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-02 04:21:18,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-12-02 04:21:18,547 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 42 [2018-12-02 04:21:18,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:18,547 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-12-02 04:21:18,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-02 04:21:18,547 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-12-02 04:21:18,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 04:21:18,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:18,548 INFO L402 BasicCegarLoop]: trace histogram [18, 12, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:18,548 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:18,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:18,548 INFO L82 PathProgramCache]: Analyzing trace with hash -2055201995, now seen corresponding path program 12 times [2018-12-02 04:21:18,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:18,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:18,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:21:18,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:18,549 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:18,628 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 04:21:18,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:18,629 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:18,629 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:18,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:18,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:18,629 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:18,637 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 04:21:18,637 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 04:21:18,647 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 04:21:18,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:18,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:18,655 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 04:21:18,655 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:18,802 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 04:21:18,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:18,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2018-12-02 04:21:18,817 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:18,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 04:21:18,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 04:21:18,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-02 04:21:18,818 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 15 states. [2018-12-02 04:21:18,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:18,845 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2018-12-02 04:21:18,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 04:21:18,846 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-12-02 04:21:18,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:18,846 INFO L225 Difference]: With dead ends: 67 [2018-12-02 04:21:18,846 INFO L226 Difference]: Without dead ends: 49 [2018-12-02 04:21:18,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-02 04:21:18,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-02 04:21:18,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-02 04:21:18,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-02 04:21:18,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-12-02 04:21:18,849 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 46 [2018-12-02 04:21:18,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:18,850 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-12-02 04:21:18,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 04:21:18,850 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-12-02 04:21:18,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 04:21:18,850 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:18,850 INFO L402 BasicCegarLoop]: trace histogram [19, 13, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:18,850 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:18,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:18,850 INFO L82 PathProgramCache]: Analyzing trace with hash -561945934, now seen corresponding path program 13 times [2018-12-02 04:21:18,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:18,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:18,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:21:18,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:18,851 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:18,939 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 04:21:18,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:18,939 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:18,939 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:18,939 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:18,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:18,939 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:18,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:18,945 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 04:21:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:18,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:18,960 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 04:21:18,960 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:19,141 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 04:21:19,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:19,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2018-12-02 04:21:19,156 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:19,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 04:21:19,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 04:21:19,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-02 04:21:19,156 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 16 states. [2018-12-02 04:21:19,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:19,182 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2018-12-02 04:21:19,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 04:21:19,182 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 48 [2018-12-02 04:21:19,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:19,183 INFO L225 Difference]: With dead ends: 69 [2018-12-02 04:21:19,183 INFO L226 Difference]: Without dead ends: 51 [2018-12-02 04:21:19,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-02 04:21:19,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-02 04:21:19,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-02 04:21:19,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-02 04:21:19,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-12-02 04:21:19,185 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 48 [2018-12-02 04:21:19,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:19,186 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-12-02 04:21:19,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 04:21:19,186 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-12-02 04:21:19,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 04:21:19,186 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:19,186 INFO L402 BasicCegarLoop]: trace histogram [20, 14, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:19,186 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:19,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:19,186 INFO L82 PathProgramCache]: Analyzing trace with hash -61948177, now seen corresponding path program 14 times [2018-12-02 04:21:19,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:19,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:19,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:19,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:19,187 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:19,279 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 165 proven. 210 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 04:21:19,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:19,279 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:19,279 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:19,279 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:19,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:19,280 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:19,289 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 04:21:19,289 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 04:21:19,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-02 04:21:19,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:19,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:19,394 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 182 proven. 36 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-12-02 04:21:19,394 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:19,478 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 182 proven. 36 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-12-02 04:21:19,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:19,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9, 9] total 31 [2018-12-02 04:21:19,503 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:19,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-02 04:21:19,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-02 04:21:19,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-12-02 04:21:19,504 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 24 states. [2018-12-02 04:21:19,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:19,553 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2018-12-02 04:21:19,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-02 04:21:19,553 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2018-12-02 04:21:19,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:19,554 INFO L225 Difference]: With dead ends: 74 [2018-12-02 04:21:19,554 INFO L226 Difference]: Without dead ends: 56 [2018-12-02 04:21:19,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-12-02 04:21:19,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-02 04:21:19,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-12-02 04:21:19,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-02 04:21:19,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-12-02 04:21:19,557 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 50 [2018-12-02 04:21:19,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:19,557 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-12-02 04:21:19,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-02 04:21:19,557 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-12-02 04:21:19,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 04:21:19,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:19,557 INFO L402 BasicCegarLoop]: trace histogram [22, 15, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:19,557 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:19,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:19,557 INFO L82 PathProgramCache]: Analyzing trace with hash -395003417, now seen corresponding path program 15 times [2018-12-02 04:21:19,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:19,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:19,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:21:19,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:19,558 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:19,661 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-02 04:21:19,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:19,661 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:19,661 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:19,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:19,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:19,661 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:19,668 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 04:21:19,668 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 04:21:19,677 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 04:21:19,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:19,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:19,684 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-02 04:21:19,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:19,890 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-02 04:21:19,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:19,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2018-12-02 04:21:19,904 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:19,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 04:21:19,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 04:21:19,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-02 04:21:19,905 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 18 states. [2018-12-02 04:21:19,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:19,935 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2018-12-02 04:21:19,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 04:21:19,935 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2018-12-02 04:21:19,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:19,935 INFO L225 Difference]: With dead ends: 77 [2018-12-02 04:21:19,935 INFO L226 Difference]: Without dead ends: 57 [2018-12-02 04:21:19,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-02 04:21:19,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-02 04:21:19,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-02 04:21:19,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-02 04:21:19,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-12-02 04:21:19,938 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 54 [2018-12-02 04:21:19,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:19,938 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-12-02 04:21:19,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 04:21:19,938 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-12-02 04:21:19,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 04:21:19,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:19,938 INFO L402 BasicCegarLoop]: trace histogram [23, 16, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:19,939 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:19,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:19,939 INFO L82 PathProgramCache]: Analyzing trace with hash 279524452, now seen corresponding path program 16 times [2018-12-02 04:21:19,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:19,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:19,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:21:19,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:19,939 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:20,047 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-02 04:21:20,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:20,047 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:20,047 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:20,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:20,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:20,047 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:20,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:20,053 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 04:21:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:20,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:20,065 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-02 04:21:20,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:20,335 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-02 04:21:20,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:20,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2018-12-02 04:21:20,350 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:20,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 04:21:20,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 04:21:20,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-02 04:21:20,351 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 19 states. [2018-12-02 04:21:20,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:20,382 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2018-12-02 04:21:20,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 04:21:20,382 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2018-12-02 04:21:20,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:20,383 INFO L225 Difference]: With dead ends: 79 [2018-12-02 04:21:20,383 INFO L226 Difference]: Without dead ends: 59 [2018-12-02 04:21:20,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-02 04:21:20,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-02 04:21:20,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-02 04:21:20,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-02 04:21:20,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-12-02 04:21:20,386 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 56 [2018-12-02 04:21:20,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:20,386 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-12-02 04:21:20,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 04:21:20,386 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-12-02 04:21:20,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 04:21:20,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:20,386 INFO L402 BasicCegarLoop]: trace histogram [24, 17, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:20,387 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:20,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:20,387 INFO L82 PathProgramCache]: Analyzing trace with hash -39255135, now seen corresponding path program 17 times [2018-12-02 04:21:20,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:20,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:20,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:20,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:20,388 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:20,526 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 234 proven. 306 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-02 04:21:20,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:20,526 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:20,527 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:20,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:20,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:20,527 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:20,533 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 04:21:20,534 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 04:21:20,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-02 04:21:20,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:20,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:20,636 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 255 proven. 49 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-12-02 04:21:20,636 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:20,755 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 255 proven. 49 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-12-02 04:21:20,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:20,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 10] total 36 [2018-12-02 04:21:20,770 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:20,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-02 04:21:20,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-02 04:21:20,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-02 04:21:20,771 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 28 states. [2018-12-02 04:21:20,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:20,825 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2018-12-02 04:21:20,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-02 04:21:20,825 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 58 [2018-12-02 04:21:20,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:20,825 INFO L225 Difference]: With dead ends: 84 [2018-12-02 04:21:20,826 INFO L226 Difference]: Without dead ends: 64 [2018-12-02 04:21:20,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-02 04:21:20,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-02 04:21:20,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-12-02 04:21:20,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-02 04:21:20,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2018-12-02 04:21:20,829 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 58 [2018-12-02 04:21:20,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:20,829 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2018-12-02 04:21:20,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-02 04:21:20,829 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2018-12-02 04:21:20,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 04:21:20,830 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:20,830 INFO L402 BasicCegarLoop]: trace histogram [26, 18, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:20,830 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:20,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:20,830 INFO L82 PathProgramCache]: Analyzing trace with hash 923897113, now seen corresponding path program 18 times [2018-12-02 04:21:20,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:20,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:20,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:21:20,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:20,831 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:20,944 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-02 04:21:20,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:20,945 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:20,945 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:20,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:20,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:20,945 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:20,952 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 04:21:20,952 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 04:21:20,962 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 04:21:20,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:20,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:20,968 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-02 04:21:20,968 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:21,242 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-02 04:21:21,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:21,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2018-12-02 04:21:21,257 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:21,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 04:21:21,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 04:21:21,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-02 04:21:21,258 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 21 states. [2018-12-02 04:21:21,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:21,303 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2018-12-02 04:21:21,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-02 04:21:21,303 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2018-12-02 04:21:21,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:21,303 INFO L225 Difference]: With dead ends: 87 [2018-12-02 04:21:21,303 INFO L226 Difference]: Without dead ends: 65 [2018-12-02 04:21:21,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-02 04:21:21,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-02 04:21:21,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-02 04:21:21,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-02 04:21:21,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2018-12-02 04:21:21,306 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 62 [2018-12-02 04:21:21,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:21,306 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2018-12-02 04:21:21,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 04:21:21,306 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2018-12-02 04:21:21,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 04:21:21,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:21,306 INFO L402 BasicCegarLoop]: trace histogram [27, 19, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:21,306 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:21,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:21,307 INFO L82 PathProgramCache]: Analyzing trace with hash -308921706, now seen corresponding path program 19 times [2018-12-02 04:21:21,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:21,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:21,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:21:21,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:21,307 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:21,456 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-02 04:21:21,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:21,456 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:21,456 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:21,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:21,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:21,456 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:21,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:21,464 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 04:21:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:21,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:21,479 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-02 04:21:21,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:21,768 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-02 04:21:21,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:21,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2018-12-02 04:21:21,792 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:21,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-02 04:21:21,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-02 04:21:21,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-02 04:21:21,793 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand 22 states. [2018-12-02 04:21:21,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:21,824 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2018-12-02 04:21:21,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 04:21:21,824 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 64 [2018-12-02 04:21:21,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:21,825 INFO L225 Difference]: With dead ends: 89 [2018-12-02 04:21:21,825 INFO L226 Difference]: Without dead ends: 67 [2018-12-02 04:21:21,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-02 04:21:21,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-02 04:21:21,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-02 04:21:21,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-02 04:21:21,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2018-12-02 04:21:21,827 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 64 [2018-12-02 04:21:21,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:21,827 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2018-12-02 04:21:21,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-02 04:21:21,828 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2018-12-02 04:21:21,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 04:21:21,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:21,828 INFO L402 BasicCegarLoop]: trace histogram [28, 20, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:21,828 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:21,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:21,828 INFO L82 PathProgramCache]: Analyzing trace with hash 363166931, now seen corresponding path program 20 times [2018-12-02 04:21:21,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:21,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:21,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:21,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:21,829 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:21,967 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 315 proven. 420 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-02 04:21:21,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:21,968 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:21,968 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:21,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:21,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:21,968 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:21,976 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 04:21:21,976 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 04:21:21,989 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-02 04:21:21,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:21,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:22,106 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 340 proven. 64 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-12-02 04:21:22,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:22,250 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 340 proven. 64 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-12-02 04:21:22,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:22,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 11, 11] total 41 [2018-12-02 04:21:22,264 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:22,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-02 04:21:22,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-02 04:21:22,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-12-02 04:21:22,265 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand 32 states. [2018-12-02 04:21:22,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:22,334 INFO L93 Difference]: Finished difference Result 94 states and 114 transitions. [2018-12-02 04:21:22,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-02 04:21:22,334 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 66 [2018-12-02 04:21:22,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:22,334 INFO L225 Difference]: With dead ends: 94 [2018-12-02 04:21:22,335 INFO L226 Difference]: Without dead ends: 72 [2018-12-02 04:21:22,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-12-02 04:21:22,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-02 04:21:22,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-12-02 04:21:22,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-02 04:21:22,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2018-12-02 04:21:22,337 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 66 [2018-12-02 04:21:22,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:22,337 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2018-12-02 04:21:22,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-02 04:21:22,337 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2018-12-02 04:21:22,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 04:21:22,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:22,337 INFO L402 BasicCegarLoop]: trace histogram [30, 21, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:22,337 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:22,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:22,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1309510453, now seen corresponding path program 21 times [2018-12-02 04:21:22,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:22,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:22,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:21:22,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:22,338 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:22,472 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-02 04:21:22,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:22,473 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:22,473 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:22,473 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:22,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:22,473 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:22,481 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 04:21:22,481 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 04:21:22,491 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 04:21:22,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:22,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:22,498 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-02 04:21:22,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:22,871 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-02 04:21:22,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:22,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 46 [2018-12-02 04:21:22,886 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:22,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-02 04:21:22,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-02 04:21:22,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-02 04:21:22,887 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand 24 states. [2018-12-02 04:21:22,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:22,924 INFO L93 Difference]: Finished difference Result 97 states and 116 transitions. [2018-12-02 04:21:22,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-02 04:21:22,924 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 70 [2018-12-02 04:21:22,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:22,925 INFO L225 Difference]: With dead ends: 97 [2018-12-02 04:21:22,925 INFO L226 Difference]: Without dead ends: 73 [2018-12-02 04:21:22,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-02 04:21:22,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-02 04:21:22,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-02 04:21:22,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-02 04:21:22,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2018-12-02 04:21:22,927 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 70 [2018-12-02 04:21:22,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:22,927 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2018-12-02 04:21:22,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-02 04:21:22,928 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2018-12-02 04:21:22,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 04:21:22,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:22,928 INFO L402 BasicCegarLoop]: trace histogram [31, 22, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:22,928 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:22,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:22,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1222923592, now seen corresponding path program 22 times [2018-12-02 04:21:22,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:22,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:22,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:21:22,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:22,929 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:23,087 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-02 04:21:23,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:23,087 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:23,087 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:23,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:23,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:23,087 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:23,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:23,096 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 04:21:23,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:23,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:23,117 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-02 04:21:23,117 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-02 04:21:23,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:23,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2018-12-02 04:21:23,522 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:23,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-02 04:21:23,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-02 04:21:23,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-02 04:21:23,522 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand 25 states. [2018-12-02 04:21:23,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:23,551 INFO L93 Difference]: Finished difference Result 99 states and 118 transitions. [2018-12-02 04:21:23,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-02 04:21:23,551 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 72 [2018-12-02 04:21:23,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:23,551 INFO L225 Difference]: With dead ends: 99 [2018-12-02 04:21:23,551 INFO L226 Difference]: Without dead ends: 75 [2018-12-02 04:21:23,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-02 04:21:23,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-02 04:21:23,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-02 04:21:23,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-02 04:21:23,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2018-12-02 04:21:23,555 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 72 [2018-12-02 04:21:23,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:23,555 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2018-12-02 04:21:23,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-02 04:21:23,555 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2018-12-02 04:21:23,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 04:21:23,556 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:23,556 INFO L402 BasicCegarLoop]: trace histogram [32, 23, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:23,556 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:23,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:23,556 INFO L82 PathProgramCache]: Analyzing trace with hash -354415995, now seen corresponding path program 23 times [2018-12-02 04:21:23,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:23,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:23,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:23,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:23,557 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:23,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 408 proven. 552 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-02 04:21:23,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:23,734 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:23,734 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:23,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:23,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:23,734 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:23,740 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 04:21:23,740 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 04:21:23,754 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-02 04:21:23,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:23,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:23,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 437 proven. 81 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-12-02 04:21:23,896 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:24,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 437 proven. 81 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-12-02 04:21:24,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:24,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 12, 12] total 46 [2018-12-02 04:21:24,082 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:24,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-02 04:21:24,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-02 04:21:24,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-02 04:21:24,083 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand 36 states. [2018-12-02 04:21:24,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:24,152 INFO L93 Difference]: Finished difference Result 104 states and 126 transitions. [2018-12-02 04:21:24,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-02 04:21:24,152 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 74 [2018-12-02 04:21:24,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:24,153 INFO L225 Difference]: With dead ends: 104 [2018-12-02 04:21:24,153 INFO L226 Difference]: Without dead ends: 80 [2018-12-02 04:21:24,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-02 04:21:24,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-02 04:21:24,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2018-12-02 04:21:24,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-02 04:21:24,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2018-12-02 04:21:24,156 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 74 [2018-12-02 04:21:24,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:24,156 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2018-12-02 04:21:24,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-02 04:21:24,157 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2018-12-02 04:21:24,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 04:21:24,157 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:24,157 INFO L402 BasicCegarLoop]: trace histogram [34, 24, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:24,157 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:24,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:24,158 INFO L82 PathProgramCache]: Analyzing trace with hash 456872189, now seen corresponding path program 24 times [2018-12-02 04:21:24,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:24,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:24,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:21:24,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:24,158 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:24,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-02 04:21:24,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:24,339 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:24,340 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:24,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:24,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:24,340 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:24,346 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 04:21:24,347 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 04:21:24,357 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 04:21:24,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:24,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:24,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-02 04:21:24,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:24,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-02 04:21:24,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:24,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 52 [2018-12-02 04:21:24,817 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:24,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-02 04:21:24,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-02 04:21:24,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:24,818 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 27 states. [2018-12-02 04:21:24,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:24,848 INFO L93 Difference]: Finished difference Result 107 states and 128 transitions. [2018-12-02 04:21:24,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-02 04:21:24,848 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 78 [2018-12-02 04:21:24,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:24,849 INFO L225 Difference]: With dead ends: 107 [2018-12-02 04:21:24,849 INFO L226 Difference]: Without dead ends: 81 [2018-12-02 04:21:24,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:24,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-02 04:21:24,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-02 04:21:24,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-02 04:21:24,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2018-12-02 04:21:24,851 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 78 [2018-12-02 04:21:24,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:24,851 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2018-12-02 04:21:24,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-02 04:21:24,851 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-12-02 04:21:24,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 04:21:24,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:24,852 INFO L402 BasicCegarLoop]: trace histogram [35, 25, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:24,852 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:24,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:24,852 INFO L82 PathProgramCache]: Analyzing trace with hash 2008507514, now seen corresponding path program 25 times [2018-12-02 04:21:24,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:24,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:24,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:21:24,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:24,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:25,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-02 04:21:25,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:25,047 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:25,047 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:25,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:25,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:25,047 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:25,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:25,053 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 04:21:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:25,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:25,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-02 04:21:25,070 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:25,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-02 04:21:25,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:25,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 52 [2018-12-02 04:21:25,524 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:25,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-02 04:21:25,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-02 04:21:25,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:25,524 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 28 states. [2018-12-02 04:21:25,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:25,568 INFO L93 Difference]: Finished difference Result 109 states and 130 transitions. [2018-12-02 04:21:25,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-02 04:21:25,568 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 80 [2018-12-02 04:21:25,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:25,568 INFO L225 Difference]: With dead ends: 109 [2018-12-02 04:21:25,568 INFO L226 Difference]: Without dead ends: 83 [2018-12-02 04:21:25,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:25,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-02 04:21:25,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-02 04:21:25,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-02 04:21:25,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2018-12-02 04:21:25,571 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 80 [2018-12-02 04:21:25,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:25,571 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2018-12-02 04:21:25,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-02 04:21:25,572 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2018-12-02 04:21:25,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 04:21:25,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:25,572 INFO L402 BasicCegarLoop]: trace histogram [36, 26, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:25,572 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:25,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:25,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1518564169, now seen corresponding path program 26 times [2018-12-02 04:21:25,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:25,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:25,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:25,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:25,573 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:25,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:25,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 513 proven. 702 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-02 04:21:25,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:25,765 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:25,766 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:25,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 04:21:25,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:25,766 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:25,772 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 04:21:25,772 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 04:21:25,788 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-02 04:21:25,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:25,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:25,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 546 proven. 100 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-12-02 04:21:25,964 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:26,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 546 proven. 100 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-12-02 04:21:26,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:26,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 13, 13] total 51 [2018-12-02 04:21:26,221 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:26,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-02 04:21:26,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-02 04:21:26,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-12-02 04:21:26,222 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 40 states. [2018-12-02 04:21:26,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:26,300 INFO L93 Difference]: Finished difference Result 114 states and 138 transitions. [2018-12-02 04:21:26,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-02 04:21:26,301 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 82 [2018-12-02 04:21:26,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:26,301 INFO L225 Difference]: With dead ends: 114 [2018-12-02 04:21:26,301 INFO L226 Difference]: Without dead ends: 88 [2018-12-02 04:21:26,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-12-02 04:21:26,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-02 04:21:26,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-12-02 04:21:26,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-02 04:21:26,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2018-12-02 04:21:26,304 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 82 [2018-12-02 04:21:26,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:26,304 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2018-12-02 04:21:26,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-02 04:21:26,304 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2018-12-02 04:21:26,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-02 04:21:26,305 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:26,305 INFO L402 BasicCegarLoop]: trace histogram [38, 27, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:26,305 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:26,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:26,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1956118959, now seen corresponding path program 27 times [2018-12-02 04:21:26,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:26,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:26,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:21:26,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:26,306 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:26,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-02 04:21:26,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:26,513 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:26,513 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:26,513 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:26,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:26,513 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:26,522 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 04:21:26,522 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 04:21:26,535 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 04:21:26,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:26,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:26,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-02 04:21:26,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:27,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-02 04:21:27,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:27,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 52 [2018-12-02 04:21:27,037 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:27,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-02 04:21:27,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-02 04:21:27,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:27,038 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand 30 states. [2018-12-02 04:21:27,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:27,084 INFO L93 Difference]: Finished difference Result 117 states and 140 transitions. [2018-12-02 04:21:27,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-02 04:21:27,084 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 86 [2018-12-02 04:21:27,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:27,084 INFO L225 Difference]: With dead ends: 117 [2018-12-02 04:21:27,085 INFO L226 Difference]: Without dead ends: 89 [2018-12-02 04:21:27,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 145 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:27,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-02 04:21:27,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-02 04:21:27,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-02 04:21:27,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2018-12-02 04:21:27,089 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 86 [2018-12-02 04:21:27,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:27,089 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2018-12-02 04:21:27,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-02 04:21:27,089 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2018-12-02 04:21:27,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-02 04:21:27,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:27,089 INFO L402 BasicCegarLoop]: trace histogram [39, 28, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:27,089 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:27,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:27,090 INFO L82 PathProgramCache]: Analyzing trace with hash 247154732, now seen corresponding path program 28 times [2018-12-02 04:21:27,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:27,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:27,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:21:27,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:27,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:27,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-02 04:21:27,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:27,298 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:27,299 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:27,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:27,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:27,299 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:27,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:27,306 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 04:21:27,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:27,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:27,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-02 04:21:27,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:27,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-02 04:21:27,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:27,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 52 [2018-12-02 04:21:27,799 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:27,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-02 04:21:27,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-02 04:21:27,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:27,799 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand 31 states. [2018-12-02 04:21:27,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:27,855 INFO L93 Difference]: Finished difference Result 119 states and 142 transitions. [2018-12-02 04:21:27,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-02 04:21:27,856 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 88 [2018-12-02 04:21:27,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:27,856 INFO L225 Difference]: With dead ends: 119 [2018-12-02 04:21:27,856 INFO L226 Difference]: Without dead ends: 91 [2018-12-02 04:21:27,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 148 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:27,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-02 04:21:27,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-02 04:21:27,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-02 04:21:27,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2018-12-02 04:21:27,859 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 88 [2018-12-02 04:21:27,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:27,859 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2018-12-02 04:21:27,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-02 04:21:27,859 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2018-12-02 04:21:27,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-02 04:21:27,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:27,859 INFO L402 BasicCegarLoop]: trace histogram [40, 29, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:27,859 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:27,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:27,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1389960343, now seen corresponding path program 29 times [2018-12-02 04:21:27,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:27,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:27,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:27,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:27,860 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:28,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 630 proven. 870 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-02 04:21:28,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:28,093 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:28,093 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:28,093 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:28,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:28,093 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:28,100 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 04:21:28,101 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 04:21:28,117 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-02 04:21:28,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:28,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:28,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 667 proven. 121 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-12-02 04:21:28,323 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:28,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 667 proven. 121 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-12-02 04:21:28,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:28,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 14, 14] total 56 [2018-12-02 04:21:28,587 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:28,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-02 04:21:28,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-02 04:21:28,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-02 04:21:28,587 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 44 states. [2018-12-02 04:21:28,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:28,678 INFO L93 Difference]: Finished difference Result 124 states and 150 transitions. [2018-12-02 04:21:28,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-02 04:21:28,678 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 90 [2018-12-02 04:21:28,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:28,679 INFO L225 Difference]: With dead ends: 124 [2018-12-02 04:21:28,679 INFO L226 Difference]: Without dead ends: 96 [2018-12-02 04:21:28,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-02 04:21:28,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-02 04:21:28,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-12-02 04:21:28,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-02 04:21:28,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2018-12-02 04:21:28,683 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 90 [2018-12-02 04:21:28,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:28,683 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2018-12-02 04:21:28,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-02 04:21:28,683 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-12-02 04:21:28,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 04:21:28,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:28,684 INFO L402 BasicCegarLoop]: trace histogram [42, 30, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:28,684 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:28,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:28,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1027368673, now seen corresponding path program 30 times [2018-12-02 04:21:28,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:28,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:28,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:21:28,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:28,685 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:28,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-02 04:21:28,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:28,968 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:28,968 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:28,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:28,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:28,968 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:28,974 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 04:21:28,974 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 04:21:28,986 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 04:21:28,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:28,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:28,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-02 04:21:28,995 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:29,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-02 04:21:29,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:29,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 52 [2018-12-02 04:21:29,515 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:29,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-02 04:21:29,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-02 04:21:29,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:29,516 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 33 states. [2018-12-02 04:21:29,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:29,570 INFO L93 Difference]: Finished difference Result 127 states and 152 transitions. [2018-12-02 04:21:29,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-02 04:21:29,570 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 94 [2018-12-02 04:21:29,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:29,571 INFO L225 Difference]: With dead ends: 127 [2018-12-02 04:21:29,571 INFO L226 Difference]: Without dead ends: 97 [2018-12-02 04:21:29,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 158 SyntacticMatches, 12 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:29,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-02 04:21:29,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-02 04:21:29,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-02 04:21:29,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2018-12-02 04:21:29,574 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 94 [2018-12-02 04:21:29,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:29,574 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2018-12-02 04:21:29,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-02 04:21:29,574 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2018-12-02 04:21:29,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 04:21:29,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:29,574 INFO L402 BasicCegarLoop]: trace histogram [43, 31, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:29,575 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:29,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:29,575 INFO L82 PathProgramCache]: Analyzing trace with hash 539222110, now seen corresponding path program 31 times [2018-12-02 04:21:29,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:29,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:29,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:21:29,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:29,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:29,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:29,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-02 04:21:29,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:29,840 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:29,840 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:29,840 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:29,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:29,840 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:29,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:29,848 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 04:21:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:29,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:29,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-02 04:21:29,868 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:30,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-02 04:21:30,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:30,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 52 [2018-12-02 04:21:30,389 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:30,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-02 04:21:30,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-02 04:21:30,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:30,389 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 34 states. [2018-12-02 04:21:30,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:30,445 INFO L93 Difference]: Finished difference Result 129 states and 154 transitions. [2018-12-02 04:21:30,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-02 04:21:30,445 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 96 [2018-12-02 04:21:30,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:30,446 INFO L225 Difference]: With dead ends: 129 [2018-12-02 04:21:30,446 INFO L226 Difference]: Without dead ends: 99 [2018-12-02 04:21:30,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 161 SyntacticMatches, 14 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:30,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-02 04:21:30,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-02 04:21:30,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-02 04:21:30,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2018-12-02 04:21:30,448 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 96 [2018-12-02 04:21:30,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:30,448 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2018-12-02 04:21:30,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-02 04:21:30,449 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2018-12-02 04:21:30,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 04:21:30,449 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:30,449 INFO L402 BasicCegarLoop]: trace histogram [44, 32, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:30,449 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:30,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:30,449 INFO L82 PathProgramCache]: Analyzing trace with hash -418189669, now seen corresponding path program 32 times [2018-12-02 04:21:30,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:30,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:30,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:30,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:30,450 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:30,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 759 proven. 1056 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-02 04:21:30,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:30,728 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:30,728 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:30,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:30,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:30,728 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:30,736 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 04:21:30,736 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 04:21:30,754 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-02 04:21:30,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:30,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:30,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 800 proven. 144 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-12-02 04:21:30,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:31,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 800 proven. 144 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-12-02 04:21:31,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:31,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 15, 15] total 61 [2018-12-02 04:21:31,309 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:31,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-02 04:21:31,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-02 04:21:31,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-12-02 04:21:31,310 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 48 states. [2018-12-02 04:21:31,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:31,416 INFO L93 Difference]: Finished difference Result 134 states and 162 transitions. [2018-12-02 04:21:31,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-02 04:21:31,416 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 98 [2018-12-02 04:21:31,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:31,417 INFO L225 Difference]: With dead ends: 134 [2018-12-02 04:21:31,417 INFO L226 Difference]: Without dead ends: 104 [2018-12-02 04:21:31,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-12-02 04:21:31,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-02 04:21:31,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2018-12-02 04:21:31,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-02 04:21:31,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2018-12-02 04:21:31,419 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 98 [2018-12-02 04:21:31,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:31,419 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2018-12-02 04:21:31,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-02 04:21:31,420 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2018-12-02 04:21:31,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 04:21:31,420 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:31,420 INFO L402 BasicCegarLoop]: trace histogram [46, 33, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:31,420 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:31,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:31,420 INFO L82 PathProgramCache]: Analyzing trace with hash 803496083, now seen corresponding path program 33 times [2018-12-02 04:21:31,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:31,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:31,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:21:31,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:31,421 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:31,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-02 04:21:31,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:31,713 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:31,713 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:31,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:31,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:31,713 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:31,722 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 04:21:31,722 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 04:21:31,734 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 04:21:31,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:31,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:31,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-02 04:21:31,743 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:32,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-02 04:21:32,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:32,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 52 [2018-12-02 04:21:32,269 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:32,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-02 04:21:32,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-02 04:21:32,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:32,270 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand 36 states. [2018-12-02 04:21:32,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:32,337 INFO L93 Difference]: Finished difference Result 137 states and 164 transitions. [2018-12-02 04:21:32,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-02 04:21:32,337 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 102 [2018-12-02 04:21:32,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:32,337 INFO L225 Difference]: With dead ends: 137 [2018-12-02 04:21:32,337 INFO L226 Difference]: Without dead ends: 105 [2018-12-02 04:21:32,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 171 SyntacticMatches, 18 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:32,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-02 04:21:32,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-02 04:21:32,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-02 04:21:32,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2018-12-02 04:21:32,340 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 102 [2018-12-02 04:21:32,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:32,340 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2018-12-02 04:21:32,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-02 04:21:32,340 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2018-12-02 04:21:32,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-02 04:21:32,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:32,341 INFO L402 BasicCegarLoop]: trace histogram [47, 34, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:32,341 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:32,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:32,341 INFO L82 PathProgramCache]: Analyzing trace with hash -106099440, now seen corresponding path program 34 times [2018-12-02 04:21:32,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:32,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:32,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:21:32,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:32,341 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:32,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-02 04:21:32,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:32,662 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:32,662 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:32,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:32,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:32,662 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:32,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:32,667 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 04:21:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:32,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:32,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-02 04:21:32,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:33,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-02 04:21:33,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:33,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 52 [2018-12-02 04:21:33,258 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:33,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-02 04:21:33,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-02 04:21:33,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:33,259 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand 37 states. [2018-12-02 04:21:33,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:33,330 INFO L93 Difference]: Finished difference Result 139 states and 166 transitions. [2018-12-02 04:21:33,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-02 04:21:33,330 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 104 [2018-12-02 04:21:33,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:33,331 INFO L225 Difference]: With dead ends: 139 [2018-12-02 04:21:33,331 INFO L226 Difference]: Without dead ends: 107 [2018-12-02 04:21:33,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 174 SyntacticMatches, 20 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:33,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-02 04:21:33,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-02 04:21:33,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-02 04:21:33,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2018-12-02 04:21:33,333 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 104 [2018-12-02 04:21:33,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:33,334 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2018-12-02 04:21:33,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-02 04:21:33,334 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2018-12-02 04:21:33,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-02 04:21:33,334 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:33,334 INFO L402 BasicCegarLoop]: trace histogram [48, 35, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:33,334 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:33,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:33,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1945931341, now seen corresponding path program 35 times [2018-12-02 04:21:33,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:33,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:33,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:33,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:33,336 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:33,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:33,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 900 proven. 1260 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-02 04:21:33,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:33,661 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:33,661 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:33,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:33,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:33,661 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:33,667 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 04:21:33,667 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 04:21:33,686 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-02 04:21:33,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:33,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:33,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 945 proven. 169 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-12-02 04:21:33,959 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:34,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 945 proven. 169 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-12-02 04:21:34,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:34,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 16, 16] total 66 [2018-12-02 04:21:34,336 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:34,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-02 04:21:34,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-02 04:21:34,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-02 04:21:34,336 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand 52 states. [2018-12-02 04:21:34,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:34,438 INFO L93 Difference]: Finished difference Result 144 states and 174 transitions. [2018-12-02 04:21:34,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-02 04:21:34,439 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 106 [2018-12-02 04:21:34,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:34,439 INFO L225 Difference]: With dead ends: 144 [2018-12-02 04:21:34,439 INFO L226 Difference]: Without dead ends: 112 [2018-12-02 04:21:34,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-02 04:21:34,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-02 04:21:34,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2018-12-02 04:21:34,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-02 04:21:34,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2018-12-02 04:21:34,444 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 106 [2018-12-02 04:21:34,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:34,445 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2018-12-02 04:21:34,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-02 04:21:34,445 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2018-12-02 04:21:34,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-02 04:21:34,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:34,445 INFO L402 BasicCegarLoop]: trace histogram [50, 36, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:34,446 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:34,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:34,446 INFO L82 PathProgramCache]: Analyzing trace with hash -2133602619, now seen corresponding path program 36 times [2018-12-02 04:21:34,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:34,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:34,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:21:34,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:34,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:34,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-02 04:21:34,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:34,796 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:34,796 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:34,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:34,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:34,796 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:34,803 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 04:21:34,804 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 04:21:34,818 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 04:21:34,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:34,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:34,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-02 04:21:34,828 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:35,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-02 04:21:35,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:35,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 52 [2018-12-02 04:21:35,371 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:35,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-02 04:21:35,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-02 04:21:35,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:35,372 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand 39 states. [2018-12-02 04:21:35,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:35,444 INFO L93 Difference]: Finished difference Result 147 states and 176 transitions. [2018-12-02 04:21:35,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-02 04:21:35,445 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 110 [2018-12-02 04:21:35,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:35,445 INFO L225 Difference]: With dead ends: 147 [2018-12-02 04:21:35,445 INFO L226 Difference]: Without dead ends: 113 [2018-12-02 04:21:35,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 184 SyntacticMatches, 24 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:35,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-02 04:21:35,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-12-02 04:21:35,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-02 04:21:35,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2018-12-02 04:21:35,450 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 110 [2018-12-02 04:21:35,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:35,450 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2018-12-02 04:21:35,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-02 04:21:35,450 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2018-12-02 04:21:35,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-02 04:21:35,451 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:35,451 INFO L402 BasicCegarLoop]: trace histogram [51, 37, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:35,451 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:35,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:35,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1654304322, now seen corresponding path program 37 times [2018-12-02 04:21:35,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:35,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:35,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:21:35,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:35,452 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:35,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-02 04:21:35,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:35,829 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:35,829 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:35,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:35,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:35,829 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:35,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:35,834 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 04:21:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:35,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:35,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-02 04:21:35,863 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:36,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-02 04:21:36,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:36,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 52 [2018-12-02 04:21:36,449 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:36,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-02 04:21:36,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-02 04:21:36,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:36,450 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 40 states. [2018-12-02 04:21:36,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:36,508 INFO L93 Difference]: Finished difference Result 149 states and 178 transitions. [2018-12-02 04:21:36,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-02 04:21:36,508 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 112 [2018-12-02 04:21:36,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:36,509 INFO L225 Difference]: With dead ends: 149 [2018-12-02 04:21:36,509 INFO L226 Difference]: Without dead ends: 115 [2018-12-02 04:21:36,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 187 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:36,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-02 04:21:36,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-02 04:21:36,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-02 04:21:36,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2018-12-02 04:21:36,512 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 112 [2018-12-02 04:21:36,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:36,512 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2018-12-02 04:21:36,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-02 04:21:36,512 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2018-12-02 04:21:36,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-02 04:21:36,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:36,512 INFO L402 BasicCegarLoop]: trace histogram [52, 38, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:36,512 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:36,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:36,512 INFO L82 PathProgramCache]: Analyzing trace with hash -299392385, now seen corresponding path program 38 times [2018-12-02 04:21:36,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:36,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:36,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:36,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:36,513 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:36,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:36,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1053 proven. 1482 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-02 04:21:36,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:36,910 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:36,911 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:36,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:36,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:36,911 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:36,916 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 04:21:36,916 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 04:21:36,962 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-02 04:21:36,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:36,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:37,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1102 proven. 196 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-12-02 04:21:37,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:37,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1102 proven. 196 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-12-02 04:21:37,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:37,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 17, 17] total 71 [2018-12-02 04:21:37,719 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:37,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-02 04:21:37,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-02 04:21:37,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-12-02 04:21:37,720 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand 56 states. [2018-12-02 04:21:37,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:37,858 INFO L93 Difference]: Finished difference Result 154 states and 186 transitions. [2018-12-02 04:21:37,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-02 04:21:37,859 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 114 [2018-12-02 04:21:37,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:37,859 INFO L225 Difference]: With dead ends: 154 [2018-12-02 04:21:37,859 INFO L226 Difference]: Without dead ends: 120 [2018-12-02 04:21:37,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-12-02 04:21:37,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-02 04:21:37,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2018-12-02 04:21:37,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-02 04:21:37,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 134 transitions. [2018-12-02 04:21:37,864 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 134 transitions. Word has length 114 [2018-12-02 04:21:37,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:37,864 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 134 transitions. [2018-12-02 04:21:37,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-02 04:21:37,864 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2018-12-02 04:21:37,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-02 04:21:37,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:37,865 INFO L402 BasicCegarLoop]: trace histogram [54, 39, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:37,865 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:37,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:37,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1680436873, now seen corresponding path program 39 times [2018-12-02 04:21:37,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:37,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:37,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:21:37,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:37,866 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:38,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-02 04:21:38,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:38,271 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:38,271 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:38,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:38,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:38,272 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:38,277 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 04:21:38,277 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 04:21:38,292 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 04:21:38,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:38,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:38,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-02 04:21:38,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:38,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-02 04:21:38,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:38,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 52 [2018-12-02 04:21:38,877 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:38,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-02 04:21:38,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-02 04:21:38,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:38,878 INFO L87 Difference]: Start difference. First operand 119 states and 134 transitions. Second operand 42 states. [2018-12-02 04:21:38,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:38,952 INFO L93 Difference]: Finished difference Result 157 states and 188 transitions. [2018-12-02 04:21:38,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-02 04:21:38,952 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 118 [2018-12-02 04:21:38,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:38,952 INFO L225 Difference]: With dead ends: 157 [2018-12-02 04:21:38,952 INFO L226 Difference]: Without dead ends: 121 [2018-12-02 04:21:38,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 197 SyntacticMatches, 30 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:38,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-02 04:21:38,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-12-02 04:21:38,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-02 04:21:38,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 136 transitions. [2018-12-02 04:21:38,955 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 136 transitions. Word has length 118 [2018-12-02 04:21:38,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:38,955 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 136 transitions. [2018-12-02 04:21:38,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-02 04:21:38,955 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 136 transitions. [2018-12-02 04:21:38,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-02 04:21:38,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:38,956 INFO L402 BasicCegarLoop]: trace histogram [55, 40, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:38,956 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:38,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:38,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1505272820, now seen corresponding path program 40 times [2018-12-02 04:21:38,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:38,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:38,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:21:38,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:38,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:39,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-02 04:21:39,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:39,370 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:39,370 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:39,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:39,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:39,370 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:39,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:39,378 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 04:21:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:39,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:39,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-02 04:21:39,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:40,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-02 04:21:40,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:40,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 52 [2018-12-02 04:21:40,017 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:40,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-02 04:21:40,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-02 04:21:40,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:40,018 INFO L87 Difference]: Start difference. First operand 121 states and 136 transitions. Second operand 43 states. [2018-12-02 04:21:40,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:40,072 INFO L93 Difference]: Finished difference Result 159 states and 190 transitions. [2018-12-02 04:21:40,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-02 04:21:40,073 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 120 [2018-12-02 04:21:40,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:40,073 INFO L225 Difference]: With dead ends: 159 [2018-12-02 04:21:40,073 INFO L226 Difference]: Without dead ends: 123 [2018-12-02 04:21:40,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 200 SyntacticMatches, 32 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:40,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-02 04:21:40,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-12-02 04:21:40,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-02 04:21:40,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 138 transitions. [2018-12-02 04:21:40,077 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 138 transitions. Word has length 120 [2018-12-02 04:21:40,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:40,077 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 138 transitions. [2018-12-02 04:21:40,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-02 04:21:40,077 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 138 transitions. [2018-12-02 04:21:40,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-02 04:21:40,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:40,078 INFO L402 BasicCegarLoop]: trace histogram [56, 41, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:40,078 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:40,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:40,078 INFO L82 PathProgramCache]: Analyzing trace with hash 660605745, now seen corresponding path program 41 times [2018-12-02 04:21:40,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:40,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:40,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:40,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:40,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:40,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1218 proven. 1722 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-02 04:21:40,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:40,505 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:40,505 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:40,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:40,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:40,505 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/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 04:21:40,511 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 04:21:40,511 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 04:21:40,536 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-02 04:21:40,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:40,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:40,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1271 proven. 225 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-12-02 04:21:40,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:41,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1271 proven. 225 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-12-02 04:21:41,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:41,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 18, 18] total 76 [2018-12-02 04:21:41,398 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:41,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-02 04:21:41,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-02 04:21:41,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-02 04:21:41,399 INFO L87 Difference]: Start difference. First operand 123 states and 138 transitions. Second operand 60 states. [2018-12-02 04:21:41,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:41,514 INFO L93 Difference]: Finished difference Result 164 states and 198 transitions. [2018-12-02 04:21:41,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-02 04:21:41,514 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 122 [2018-12-02 04:21:41,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:41,514 INFO L225 Difference]: With dead ends: 164 [2018-12-02 04:21:41,514 INFO L226 Difference]: Without dead ends: 128 [2018-12-02 04:21:41,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-02 04:21:41,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-02 04:21:41,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2018-12-02 04:21:41,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-02 04:21:41,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 143 transitions. [2018-12-02 04:21:41,517 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 143 transitions. Word has length 122 [2018-12-02 04:21:41,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:41,517 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 143 transitions. [2018-12-02 04:21:41,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-02 04:21:41,517 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 143 transitions. [2018-12-02 04:21:41,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-02 04:21:41,518 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:41,518 INFO L402 BasicCegarLoop]: trace histogram [58, 42, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:41,518 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:41,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:41,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1648396457, now seen corresponding path program 42 times [2018-12-02 04:21:41,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:41,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:41,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:21:41,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:41,519 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:41,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-02 04:21:41,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:41,967 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:41,968 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:41,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:41,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:41,968 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/bin-2019/utaipan/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 04:21:41,974 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 04:21:41,974 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 04:21:41,989 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 04:21:41,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:41,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:42,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-02 04:21:42,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:42,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-02 04:21:42,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:42,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 52 [2018-12-02 04:21:42,574 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:42,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-02 04:21:42,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-02 04:21:42,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:42,575 INFO L87 Difference]: Start difference. First operand 127 states and 143 transitions. Second operand 45 states. [2018-12-02 04:21:42,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:42,642 INFO L93 Difference]: Finished difference Result 167 states and 200 transitions. [2018-12-02 04:21:42,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-02 04:21:42,642 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 126 [2018-12-02 04:21:42,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:42,643 INFO L225 Difference]: With dead ends: 167 [2018-12-02 04:21:42,643 INFO L226 Difference]: Without dead ends: 129 [2018-12-02 04:21:42,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 210 SyntacticMatches, 36 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:42,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-02 04:21:42,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-12-02 04:21:42,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-02 04:21:42,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 145 transitions. [2018-12-02 04:21:42,645 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 145 transitions. Word has length 126 [2018-12-02 04:21:42,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:42,645 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 145 transitions. [2018-12-02 04:21:42,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-02 04:21:42,646 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 145 transitions. [2018-12-02 04:21:42,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-02 04:21:42,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:42,646 INFO L402 BasicCegarLoop]: trace histogram [59, 43, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:42,646 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:42,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:42,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1398459942, now seen corresponding path program 43 times [2018-12-02 04:21:42,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:42,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:42,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:21:42,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:42,647 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:42,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:43,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-02 04:21:43,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:43,088 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:43,088 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:43,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:43,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:43,088 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/bin-2019/utaipan/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 04:21:43,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:43,095 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 04:21:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:43,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:43,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-02 04:21:43,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:43,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-02 04:21:43,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:43,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 52 [2018-12-02 04:21:43,749 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:43,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-02 04:21:43,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-02 04:21:43,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:43,750 INFO L87 Difference]: Start difference. First operand 129 states and 145 transitions. Second operand 46 states. [2018-12-02 04:21:43,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:43,805 INFO L93 Difference]: Finished difference Result 169 states and 202 transitions. [2018-12-02 04:21:43,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-02 04:21:43,805 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 128 [2018-12-02 04:21:43,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:43,805 INFO L225 Difference]: With dead ends: 169 [2018-12-02 04:21:43,806 INFO L226 Difference]: Without dead ends: 131 [2018-12-02 04:21:43,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 213 SyntacticMatches, 38 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:43,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-02 04:21:43,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-12-02 04:21:43,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-02 04:21:43,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 147 transitions. [2018-12-02 04:21:43,808 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 147 transitions. Word has length 128 [2018-12-02 04:21:43,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:43,808 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 147 transitions. [2018-12-02 04:21:43,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-02 04:21:43,808 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 147 transitions. [2018-12-02 04:21:43,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-02 04:21:43,808 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:43,809 INFO L402 BasicCegarLoop]: trace histogram [60, 44, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:43,809 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:43,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:43,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1727637603, now seen corresponding path program 44 times [2018-12-02 04:21:43,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:43,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:43,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:43,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:43,809 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:44,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1395 proven. 1980 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-02 04:21:44,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:44,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:44,285 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:44,285 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:44,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:44,285 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/bin-2019/utaipan/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 04:21:44,294 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 04:21:44,294 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 04:21:44,330 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-02 04:21:44,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:44,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:44,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1452 proven. 256 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2018-12-02 04:21:44,754 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:45,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1452 proven. 256 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2018-12-02 04:21:45,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:45,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 19, 19] total 81 [2018-12-02 04:21:45,306 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:45,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-02 04:21:45,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-02 04:21:45,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-12-02 04:21:45,307 INFO L87 Difference]: Start difference. First operand 131 states and 147 transitions. Second operand 64 states. [2018-12-02 04:21:45,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:45,487 INFO L93 Difference]: Finished difference Result 174 states and 210 transitions. [2018-12-02 04:21:45,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-02 04:21:45,488 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 130 [2018-12-02 04:21:45,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:45,488 INFO L225 Difference]: With dead ends: 174 [2018-12-02 04:21:45,488 INFO L226 Difference]: Without dead ends: 136 [2018-12-02 04:21:45,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-12-02 04:21:45,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-02 04:21:45,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2018-12-02 04:21:45,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-02 04:21:45,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 152 transitions. [2018-12-02 04:21:45,491 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 152 transitions. Word has length 130 [2018-12-02 04:21:45,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:45,491 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 152 transitions. [2018-12-02 04:21:45,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-02 04:21:45,491 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 152 transitions. [2018-12-02 04:21:45,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-02 04:21:45,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:45,492 INFO L402 BasicCegarLoop]: trace histogram [62, 45, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:45,492 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:45,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:45,492 INFO L82 PathProgramCache]: Analyzing trace with hash -387083173, now seen corresponding path program 45 times [2018-12-02 04:21:45,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:45,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:45,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:21:45,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:45,493 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:45,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-02 04:21:45,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:45,995 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:45,995 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:45,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:45,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:45,995 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/bin-2019/utaipan/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 04:21:46,001 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 04:21:46,001 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 04:21:46,017 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 04:21:46,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:46,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:46,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-02 04:21:46,029 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:46,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-02 04:21:46,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:46,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 52 [2018-12-02 04:21:46,621 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:46,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-02 04:21:46,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-02 04:21:46,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:46,622 INFO L87 Difference]: Start difference. First operand 135 states and 152 transitions. Second operand 48 states. [2018-12-02 04:21:46,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:46,700 INFO L93 Difference]: Finished difference Result 177 states and 212 transitions. [2018-12-02 04:21:46,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-02 04:21:46,700 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 134 [2018-12-02 04:21:46,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:46,701 INFO L225 Difference]: With dead ends: 177 [2018-12-02 04:21:46,701 INFO L226 Difference]: Without dead ends: 137 [2018-12-02 04:21:46,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 223 SyntacticMatches, 42 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:46,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-02 04:21:46,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-12-02 04:21:46,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-02 04:21:46,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 154 transitions. [2018-12-02 04:21:46,705 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 154 transitions. Word has length 134 [2018-12-02 04:21:46,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:46,705 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 154 transitions. [2018-12-02 04:21:46,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-02 04:21:46,705 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 154 transitions. [2018-12-02 04:21:46,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-02 04:21:46,706 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:46,706 INFO L402 BasicCegarLoop]: trace histogram [63, 46, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:46,706 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:46,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:46,706 INFO L82 PathProgramCache]: Analyzing trace with hash -144896808, now seen corresponding path program 46 times [2018-12-02 04:21:46,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:46,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:46,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:21:46,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:46,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:47,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-02 04:21:47,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:47,246 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:47,246 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:47,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:47,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:47,246 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/bin-2019/utaipan/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 04:21:47,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:47,253 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 04:21:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:47,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:47,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-02 04:21:47,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:47,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-02 04:21:47,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:47,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 52 [2018-12-02 04:21:47,869 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:47,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-02 04:21:47,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-02 04:21:47,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:47,870 INFO L87 Difference]: Start difference. First operand 137 states and 154 transitions. Second operand 49 states. [2018-12-02 04:21:47,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:47,931 INFO L93 Difference]: Finished difference Result 179 states and 214 transitions. [2018-12-02 04:21:47,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-02 04:21:47,931 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 136 [2018-12-02 04:21:47,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:47,932 INFO L225 Difference]: With dead ends: 179 [2018-12-02 04:21:47,932 INFO L226 Difference]: Without dead ends: 139 [2018-12-02 04:21:47,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 226 SyntacticMatches, 44 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:47,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-02 04:21:47,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-12-02 04:21:47,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-02 04:21:47,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 156 transitions. [2018-12-02 04:21:47,934 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 156 transitions. Word has length 136 [2018-12-02 04:21:47,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:47,935 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 156 transitions. [2018-12-02 04:21:47,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-02 04:21:47,935 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 156 transitions. [2018-12-02 04:21:47,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-02 04:21:47,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:47,935 INFO L402 BasicCegarLoop]: trace histogram [64, 47, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:47,935 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:47,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:47,935 INFO L82 PathProgramCache]: Analyzing trace with hash 667965973, now seen corresponding path program 47 times [2018-12-02 04:21:47,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:47,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:47,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:47,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:47,936 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:48,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1584 proven. 2256 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-02 04:21:48,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:48,497 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:48,497 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:48,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:48,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:48,497 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/bin-2019/utaipan/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 04:21:48,503 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 04:21:48,503 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 04:21:48,528 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-02 04:21:48,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:48,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:48,977 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1645 proven. 289 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2018-12-02 04:21:48,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:49,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1645 proven. 289 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2018-12-02 04:21:49,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:49,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 20, 20] total 86 [2018-12-02 04:21:49,577 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:49,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-02 04:21:49,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-02 04:21:49,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-02 04:21:49,578 INFO L87 Difference]: Start difference. First operand 139 states and 156 transitions. Second operand 68 states. [2018-12-02 04:21:49,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:49,717 INFO L93 Difference]: Finished difference Result 184 states and 222 transitions. [2018-12-02 04:21:49,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-02 04:21:49,717 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 138 [2018-12-02 04:21:49,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:49,718 INFO L225 Difference]: With dead ends: 184 [2018-12-02 04:21:49,718 INFO L226 Difference]: Without dead ends: 144 [2018-12-02 04:21:49,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-02 04:21:49,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-12-02 04:21:49,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2018-12-02 04:21:49,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-02 04:21:49,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 161 transitions. [2018-12-02 04:21:49,720 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 161 transitions. Word has length 138 [2018-12-02 04:21:49,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:49,721 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 161 transitions. [2018-12-02 04:21:49,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-02 04:21:49,721 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 161 transitions. [2018-12-02 04:21:49,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-02 04:21:49,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:49,721 INFO L402 BasicCegarLoop]: trace histogram [66, 48, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:49,721 INFO L423 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:49,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:49,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1237216115, now seen corresponding path program 48 times [2018-12-02 04:21:49,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:49,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:49,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:21:49,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:49,722 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:50,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-02 04:21:50,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:50,274 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:50,274 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:50,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 04:21:50,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:50,274 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/bin-2019/utaipan/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 04:21:50,279 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 04:21:50,280 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 04:21:50,297 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 04:21:50,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:50,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:50,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-02 04:21:50,311 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:50,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-02 04:21:50,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:50,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 52 [2018-12-02 04:21:50,876 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:50,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-02 04:21:50,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-02 04:21:50,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:50,877 INFO L87 Difference]: Start difference. First operand 143 states and 161 transitions. Second operand 51 states. [2018-12-02 04:21:50,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:50,972 INFO L93 Difference]: Finished difference Result 187 states and 224 transitions. [2018-12-02 04:21:50,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-02 04:21:50,972 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 142 [2018-12-02 04:21:50,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:50,972 INFO L225 Difference]: With dead ends: 187 [2018-12-02 04:21:50,972 INFO L226 Difference]: Without dead ends: 145 [2018-12-02 04:21:50,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 236 SyntacticMatches, 48 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:50,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-02 04:21:50,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-12-02 04:21:50,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-02 04:21:50,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 163 transitions. [2018-12-02 04:21:50,975 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 163 transitions. Word has length 142 [2018-12-02 04:21:50,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:50,975 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 163 transitions. [2018-12-02 04:21:50,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-02 04:21:50,976 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 163 transitions. [2018-12-02 04:21:50,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-02 04:21:50,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:50,976 INFO L402 BasicCegarLoop]: trace histogram [67, 49, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:50,976 INFO L423 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:50,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:50,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1596145674, now seen corresponding path program 49 times [2018-12-02 04:21:50,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:50,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:50,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:21:50,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:50,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:51,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-02 04:21:51,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:51,597 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:51,597 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:51,597 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:51,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:51,597 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/bin-2019/utaipan/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 04:21:51,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:51,605 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 04:21:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:51,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:51,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-02 04:21:51,635 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:52,241 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-02 04:21:52,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:52,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2018-12-02 04:21:52,255 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:52,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-02 04:21:52,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-02 04:21:52,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:52,256 INFO L87 Difference]: Start difference. First operand 145 states and 163 transitions. Second operand 52 states. [2018-12-02 04:21:52,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:52,344 INFO L93 Difference]: Finished difference Result 189 states and 226 transitions. [2018-12-02 04:21:52,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-02 04:21:52,344 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 144 [2018-12-02 04:21:52,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:52,345 INFO L225 Difference]: With dead ends: 189 [2018-12-02 04:21:52,345 INFO L226 Difference]: Without dead ends: 147 [2018-12-02 04:21:52,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 239 SyntacticMatches, 50 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:52,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-02 04:21:52,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-12-02 04:21:52,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-02 04:21:52,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 165 transitions. [2018-12-02 04:21:52,347 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 165 transitions. Word has length 144 [2018-12-02 04:21:52,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:52,348 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 165 transitions. [2018-12-02 04:21:52,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-02 04:21:52,348 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 165 transitions. [2018-12-02 04:21:52,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-02 04:21:52,348 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:52,348 INFO L402 BasicCegarLoop]: trace histogram [68, 50, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:52,348 INFO L423 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:52,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:52,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1447559239, now seen corresponding path program 50 times [2018-12-02 04:21:52,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:52,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:52,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:52,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:52,349 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:52,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:52,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 1968 proven. 400 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-02 04:21:52,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:52,487 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:52,487 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:52,487 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:52,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:52,488 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/bin-2019/utaipan/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 04:21:52,493 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 04:21:52,493 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 04:21:52,521 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-02 04:21:52,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:52,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:52,537 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 1850 proven. 324 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-02 04:21:52,537 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:52,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 1850 proven. 324 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-02 04:21:52,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:52,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 42 [2018-12-02 04:21:52,842 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:52,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-02 04:21:52,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-02 04:21:52,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-02 04:21:52,842 INFO L87 Difference]: Start difference. First operand 147 states and 165 transitions. Second operand 23 states. [2018-12-02 04:21:52,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:52,884 INFO L93 Difference]: Finished difference Result 159 states and 183 transitions. [2018-12-02 04:21:52,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-02 04:21:52,885 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 146 [2018-12-02 04:21:52,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:52,885 INFO L225 Difference]: With dead ends: 159 [2018-12-02 04:21:52,885 INFO L226 Difference]: Without dead ends: 154 [2018-12-02 04:21:52,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-02 04:21:52,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-02 04:21:52,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-12-02 04:21:52,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-12-02 04:21:52,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 174 transitions. [2018-12-02 04:21:52,888 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 174 transitions. Word has length 146 [2018-12-02 04:21:52,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:52,888 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 174 transitions. [2018-12-02 04:21:52,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-02 04:21:52,888 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 174 transitions. [2018-12-02 04:21:52,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-02 04:21:52,888 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:52,888 INFO L402 BasicCegarLoop]: trace histogram [71, 50, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:52,888 INFO L423 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:52,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:52,889 INFO L82 PathProgramCache]: Analyzing trace with hash -866044488, now seen corresponding path program 51 times [2018-12-02 04:21:52,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:52,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:52,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:21:52,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:52,889 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:53,062 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2256 proven. 529 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-02 04:21:53,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:53,062 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:53,062 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:53,062 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:53,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:53,062 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/bin-2019/utaipan/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 04:21:53,068 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 04:21:53,068 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 04:21:53,087 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 04:21:53,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:53,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:53,772 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:21:53,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:54,762 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:21:54,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:54,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 74, 74] total 102 [2018-12-02 04:21:54,777 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:54,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-02 04:21:54,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-02 04:21:54,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-02 04:21:54,778 INFO L87 Difference]: Start difference. First operand 153 states and 174 transitions. Second operand 76 states. [2018-12-02 04:21:54,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:54,975 INFO L93 Difference]: Finished difference Result 165 states and 192 transitions. [2018-12-02 04:21:54,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-02 04:21:54,975 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 152 [2018-12-02 04:21:54,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:54,976 INFO L225 Difference]: With dead ends: 165 [2018-12-02 04:21:54,976 INFO L226 Difference]: Without dead ends: 160 [2018-12-02 04:21:54,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 183 SyntacticMatches, 46 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10537 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-02 04:21:54,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-02 04:21:54,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2018-12-02 04:21:54,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-12-02 04:21:54,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 183 transitions. [2018-12-02 04:21:54,979 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 183 transitions. Word has length 152 [2018-12-02 04:21:54,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:54,980 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 183 transitions. [2018-12-02 04:21:54,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-02 04:21:54,980 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 183 transitions. [2018-12-02 04:21:54,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-02 04:21:54,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:54,980 INFO L402 BasicCegarLoop]: trace histogram [74, 50, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:54,980 INFO L423 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:54,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:54,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1885416855, now seen corresponding path program 52 times [2018-12-02 04:21:54,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:54,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:54,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:21:54,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:54,981 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:55,178 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2544 proven. 676 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-02 04:21:55,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:55,178 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:55,179 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:55,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:55,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:55,179 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/bin-2019/utaipan/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 04:21:55,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:55,184 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 04:21:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:55,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:55,798 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:21:55,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:56,815 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:21:56,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:56,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 77, 77] total 102 [2018-12-02 04:21:56,829 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:56,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-02 04:21:56,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-02 04:21:56,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-02 04:21:56,830 INFO L87 Difference]: Start difference. First operand 159 states and 183 transitions. Second operand 79 states. [2018-12-02 04:21:57,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:57,077 INFO L93 Difference]: Finished difference Result 171 states and 201 transitions. [2018-12-02 04:21:57,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-02 04:21:57,078 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 158 [2018-12-02 04:21:57,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:57,078 INFO L225 Difference]: With dead ends: 171 [2018-12-02 04:21:57,078 INFO L226 Difference]: Without dead ends: 166 [2018-12-02 04:21:57,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 192 SyntacticMatches, 52 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11272 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-02 04:21:57,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-02 04:21:57,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-12-02 04:21:57,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-02 04:21:57,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 192 transitions. [2018-12-02 04:21:57,081 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 192 transitions. Word has length 158 [2018-12-02 04:21:57,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:57,081 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 192 transitions. [2018-12-02 04:21:57,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-02 04:21:57,082 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 192 transitions. [2018-12-02 04:21:57,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-02 04:21:57,082 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:57,082 INFO L402 BasicCegarLoop]: trace histogram [77, 50, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:57,083 INFO L423 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:57,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:57,083 INFO L82 PathProgramCache]: Analyzing trace with hash 275146330, now seen corresponding path program 53 times [2018-12-02 04:21:57,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:57,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:57,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:21:57,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:57,084 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:57,328 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2832 proven. 841 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-02 04:21:57,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:57,329 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:57,329 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:57,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:57,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:57,329 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/bin-2019/utaipan/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 04:21:57,338 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 04:21:57,338 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 04:21:57,383 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2018-12-02 04:21:57,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:57,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:57,395 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2750 proven. 729 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-02 04:21:57,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:57,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2750 proven. 729 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-02 04:21:57,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:57,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 30] total 52 [2018-12-02 04:21:57,892 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:57,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-02 04:21:57,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-02 04:21:57,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:57,892 INFO L87 Difference]: Start difference. First operand 165 states and 192 transitions. Second operand 32 states. [2018-12-02 04:21:57,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:21:57,966 INFO L93 Difference]: Finished difference Result 177 states and 210 transitions. [2018-12-02 04:21:57,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-02 04:21:57,966 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 164 [2018-12-02 04:21:57,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:21:57,967 INFO L225 Difference]: With dead ends: 177 [2018-12-02 04:21:57,967 INFO L226 Difference]: Without dead ends: 172 [2018-12-02 04:21:57,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 301 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:21:57,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-12-02 04:21:57,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2018-12-02 04:21:57,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-02 04:21:57,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 201 transitions. [2018-12-02 04:21:57,970 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 201 transitions. Word has length 164 [2018-12-02 04:21:57,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:21:57,970 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 201 transitions. [2018-12-02 04:21:57,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-02 04:21:57,970 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 201 transitions. [2018-12-02 04:21:57,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-02 04:21:57,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:21:57,970 INFO L402 BasicCegarLoop]: trace histogram [80, 50, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:21:57,971 INFO L423 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:21:57,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:21:57,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1598979701, now seen corresponding path program 54 times [2018-12-02 04:21:57,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:21:57,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:57,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:21:57,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:21:57,971 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:21:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:21:58,265 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3120 proven. 1024 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-02 04:21:58,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:58,265 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:21:58,265 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:21:58,265 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:21:58,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:21:58,265 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/bin-2019/utaipan/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 04:21:58,271 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 04:21:58,271 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 04:21:58,294 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 04:21:58,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:21:58,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:21:58,911 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:21:58,911 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:21:59,968 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:21:59,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:21:59,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 83, 83] total 102 [2018-12-02 04:21:59,983 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:21:59,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-02 04:21:59,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-02 04:21:59,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-02 04:21:59,984 INFO L87 Difference]: Start difference. First operand 171 states and 201 transitions. Second operand 85 states. [2018-12-02 04:22:00,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:22:00,253 INFO L93 Difference]: Finished difference Result 183 states and 219 transitions. [2018-12-02 04:22:00,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-02 04:22:00,253 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 170 [2018-12-02 04:22:00,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:22:00,253 INFO L225 Difference]: With dead ends: 183 [2018-12-02 04:22:00,253 INFO L226 Difference]: Without dead ends: 178 [2018-12-02 04:22:00,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 210 SyntacticMatches, 64 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12742 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-02 04:22:00,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-02 04:22:00,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-12-02 04:22:00,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-02 04:22:00,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 210 transitions. [2018-12-02 04:22:00,256 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 210 transitions. Word has length 170 [2018-12-02 04:22:00,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:22:00,256 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 210 transitions. [2018-12-02 04:22:00,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-02 04:22:00,256 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 210 transitions. [2018-12-02 04:22:00,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-02 04:22:00,257 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:22:00,257 INFO L402 BasicCegarLoop]: trace histogram [83, 50, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:22:00,257 INFO L423 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:22:00,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:22:00,257 INFO L82 PathProgramCache]: Analyzing trace with hash -183651332, now seen corresponding path program 55 times [2018-12-02 04:22:00,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:22:00,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:22:00,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:22:00,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:22:00,258 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:22:00,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:22:00,582 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 3408 proven. 1225 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-02 04:22:00,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:22:00,582 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:22:00,582 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:22:00,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:22:00,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:22:00,582 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/bin-2019/utaipan/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 04:22:00,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:22:00,589 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 04:22:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:22:00,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:22:01,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:22:01,224 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:22:02,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:22:02,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:22:02,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 86, 86] total 102 [2018-12-02 04:22:02,345 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:22:02,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-02 04:22:02,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-02 04:22:02,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-02 04:22:02,346 INFO L87 Difference]: Start difference. First operand 177 states and 210 transitions. Second operand 88 states. [2018-12-02 04:22:02,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:22:02,630 INFO L93 Difference]: Finished difference Result 189 states and 228 transitions. [2018-12-02 04:22:02,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-02 04:22:02,630 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 176 [2018-12-02 04:22:02,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:22:02,631 INFO L225 Difference]: With dead ends: 189 [2018-12-02 04:22:02,631 INFO L226 Difference]: Without dead ends: 184 [2018-12-02 04:22:02,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 219 SyntacticMatches, 70 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13477 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-02 04:22:02,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-12-02 04:22:02,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2018-12-02 04:22:02,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-12-02 04:22:02,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 219 transitions. [2018-12-02 04:22:02,635 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 219 transitions. Word has length 176 [2018-12-02 04:22:02,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:22:02,635 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 219 transitions. [2018-12-02 04:22:02,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-02 04:22:02,635 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 219 transitions. [2018-12-02 04:22:02,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-02 04:22:02,636 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:22:02,636 INFO L402 BasicCegarLoop]: trace histogram [86, 50, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:22:02,636 INFO L423 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:22:02,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:22:02,637 INFO L82 PathProgramCache]: Analyzing trace with hash -442724947, now seen corresponding path program 56 times [2018-12-02 04:22:02,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:22:02,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:22:02,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:22:02,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:22:02,637 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:22:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:22:03,035 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3696 proven. 1444 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-02 04:22:03,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:22:03,035 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:22:03,035 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:22:03,035 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:22:03,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:22:03,035 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/bin-2019/utaipan/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 04:22:03,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 04:22:03,041 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 04:22:03,108 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 74 check-sat command(s) [2018-12-02 04:22:03,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:22:03,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:22:03,124 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3650 proven. 1296 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-02 04:22:03,124 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:22:03,673 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3650 proven. 1296 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-02 04:22:03,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:22:03,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 39, 39] total 52 [2018-12-02 04:22:03,688 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:22:03,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-02 04:22:03,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-02 04:22:03,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:22:03,688 INFO L87 Difference]: Start difference. First operand 183 states and 219 transitions. Second operand 41 states. [2018-12-02 04:22:03,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:22:03,802 INFO L93 Difference]: Finished difference Result 195 states and 237 transitions. [2018-12-02 04:22:03,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-02 04:22:03,802 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 182 [2018-12-02 04:22:03,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:22:03,802 INFO L225 Difference]: With dead ends: 195 [2018-12-02 04:22:03,803 INFO L226 Difference]: Without dead ends: 190 [2018-12-02 04:22:03,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 328 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:22:03,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-02 04:22:03,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2018-12-02 04:22:03,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-02 04:22:03,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 228 transitions. [2018-12-02 04:22:03,805 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 228 transitions. Word has length 182 [2018-12-02 04:22:03,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:22:03,806 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 228 transitions. [2018-12-02 04:22:03,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-02 04:22:03,806 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 228 transitions. [2018-12-02 04:22:03,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-02 04:22:03,806 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:22:03,806 INFO L402 BasicCegarLoop]: trace histogram [89, 50, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:22:03,806 INFO L423 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:22:03,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:22:03,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1863556766, now seen corresponding path program 57 times [2018-12-02 04:22:03,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:22:03,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:22:03,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:22:03,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:22:03,807 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:22:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:22:04,255 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 3984 proven. 1681 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-02 04:22:04,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:22:04,256 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:22:04,256 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:22:04,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:22:04,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:22:04,256 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/bin-2019/utaipan/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 04:22:04,265 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 04:22:04,265 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 04:22:04,291 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 04:22:04,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:22:04,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:22:04,926 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:22:04,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:22:06,092 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:22:06,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:22:06,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 92, 92] total 102 [2018-12-02 04:22:06,106 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:22:06,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-02 04:22:06,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-02 04:22:06,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-02 04:22:06,107 INFO L87 Difference]: Start difference. First operand 189 states and 228 transitions. Second operand 94 states. [2018-12-02 04:22:06,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:22:06,565 INFO L93 Difference]: Finished difference Result 201 states and 246 transitions. [2018-12-02 04:22:06,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-02 04:22:06,566 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 188 [2018-12-02 04:22:06,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:22:06,566 INFO L225 Difference]: With dead ends: 201 [2018-12-02 04:22:06,566 INFO L226 Difference]: Without dead ends: 196 [2018-12-02 04:22:06,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 237 SyntacticMatches, 82 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14947 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-02 04:22:06,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-02 04:22:06,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2018-12-02 04:22:06,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-12-02 04:22:06,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 237 transitions. [2018-12-02 04:22:06,571 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 237 transitions. Word has length 188 [2018-12-02 04:22:06,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:22:06,571 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 237 transitions. [2018-12-02 04:22:06,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-02 04:22:06,572 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 237 transitions. [2018-12-02 04:22:06,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-02 04:22:06,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:22:06,572 INFO L402 BasicCegarLoop]: trace histogram [92, 50, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:22:06,573 INFO L423 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:22:06,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:22:06,573 INFO L82 PathProgramCache]: Analyzing trace with hash -205752625, now seen corresponding path program 58 times [2018-12-02 04:22:06,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:22:06,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:22:06,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:22:06,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:22:06,574 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:22:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:22:07,083 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 4272 proven. 1936 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-02 04:22:07,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:22:07,083 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:22:07,083 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:22:07,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:22:07,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:22:07,083 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/bin-2019/utaipan/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 04:22:07,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:22:07,089 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 04:22:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:22:07,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:22:07,748 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:22:07,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:22:08,918 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:22:08,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:22:08,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 95, 95] total 102 [2018-12-02 04:22:08,932 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:22:08,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-02 04:22:08,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-02 04:22:08,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-02 04:22:08,933 INFO L87 Difference]: Start difference. First operand 195 states and 237 transitions. Second operand 97 states. [2018-12-02 04:22:09,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:22:09,370 INFO L93 Difference]: Finished difference Result 207 states and 255 transitions. [2018-12-02 04:22:09,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-02 04:22:09,370 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 194 [2018-12-02 04:22:09,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:22:09,370 INFO L225 Difference]: With dead ends: 207 [2018-12-02 04:22:09,371 INFO L226 Difference]: Without dead ends: 202 [2018-12-02 04:22:09,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 246 SyntacticMatches, 88 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15682 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-02 04:22:09,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-12-02 04:22:09,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2018-12-02 04:22:09,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-12-02 04:22:09,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 246 transitions. [2018-12-02 04:22:09,374 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 246 transitions. Word has length 194 [2018-12-02 04:22:09,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:22:09,374 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 246 transitions. [2018-12-02 04:22:09,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-02 04:22:09,374 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 246 transitions. [2018-12-02 04:22:09,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-12-02 04:22:09,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:22:09,375 INFO L402 BasicCegarLoop]: trace histogram [95, 50, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:22:09,375 INFO L423 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:22:09,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:22:09,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1133205952, now seen corresponding path program 59 times [2018-12-02 04:22:09,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:22:09,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:22:09,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:22:09,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:22:09,376 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:22:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:22:09,949 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4560 proven. 2209 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-02 04:22:09,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:22:09,949 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:22:09,949 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:22:09,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:22:09,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:22:09,949 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/bin-2019/utaipan/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 04:22:09,955 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 04:22:09,955 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 04:22:10,049 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 92 check-sat command(s) [2018-12-02 04:22:10,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:22:10,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:22:10,072 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4550 proven. 2025 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-02 04:22:10,072 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:22:10,663 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4550 proven. 2025 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-02 04:22:10,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:22:10,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 48, 48] total 52 [2018-12-02 04:22:10,678 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:22:10,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-02 04:22:10,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-02 04:22:10,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:22:10,678 INFO L87 Difference]: Start difference. First operand 201 states and 246 transitions. Second operand 50 states. [2018-12-02 04:22:10,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:22:10,827 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2018-12-02 04:22:10,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-02 04:22:10,828 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 200 [2018-12-02 04:22:10,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:22:10,828 INFO L225 Difference]: With dead ends: 213 [2018-12-02 04:22:10,828 INFO L226 Difference]: Without dead ends: 208 [2018-12-02 04:22:10,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 355 SyntacticMatches, 44 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:22:10,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-12-02 04:22:10,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 207. [2018-12-02 04:22:10,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-12-02 04:22:10,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 255 transitions. [2018-12-02 04:22:10,832 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 255 transitions. Word has length 200 [2018-12-02 04:22:10,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:22:10,832 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 255 transitions. [2018-12-02 04:22:10,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-02 04:22:10,832 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 255 transitions. [2018-12-02 04:22:10,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-02 04:22:10,832 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:22:10,832 INFO L402 BasicCegarLoop]: trace histogram [98, 50, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:22:10,833 INFO L423 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:22:10,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:22:10,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1179796239, now seen corresponding path program 60 times [2018-12-02 04:22:10,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:22:10,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:22:10,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:22:10,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:22:10,833 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:22:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:22:11,423 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 4850 proven. 2304 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-02 04:22:11,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:22:11,424 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:22:11,424 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:22:11,424 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:22:11,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:22:11,424 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/bin-2019/utaipan/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 04:22:11,432 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 04:22:11,432 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 04:22:11,459 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 04:22:11,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:22:11,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:22:12,066 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:22:12,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:22:13,262 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:22:13,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:22:13,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 101, 101] total 102 [2018-12-02 04:22:13,276 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:22:13,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-02 04:22:13,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-02 04:22:13,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-02 04:22:13,277 INFO L87 Difference]: Start difference. First operand 207 states and 255 transitions. Second operand 101 states. [2018-12-02 04:22:13,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:22:13,823 INFO L93 Difference]: Finished difference Result 215 states and 265 transitions. [2018-12-02 04:22:13,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-02 04:22:13,824 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 206 [2018-12-02 04:22:13,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:22:13,824 INFO L225 Difference]: With dead ends: 215 [2018-12-02 04:22:13,825 INFO L226 Difference]: Without dead ends: 210 [2018-12-02 04:22:13,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 264 SyntacticMatches, 98 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16953 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-02 04:22:13,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-12-02 04:22:13,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2018-12-02 04:22:13,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-12-02 04:22:13,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 258 transitions. [2018-12-02 04:22:13,829 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 258 transitions. Word has length 206 [2018-12-02 04:22:13,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:22:13,829 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 258 transitions. [2018-12-02 04:22:13,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-02 04:22:13,829 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 258 transitions. [2018-12-02 04:22:13,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-12-02 04:22:13,830 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:22:13,830 INFO L402 BasicCegarLoop]: trace histogram [99, 50, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:22:13,830 INFO L423 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:22:13,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:22:13,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1190218156, now seen corresponding path program 61 times [2018-12-02 04:22:13,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:22:13,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:22:13,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:22:13,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:22:13,831 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:22:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:22:14,469 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 4950 proven. 2401 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-02 04:22:14,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:22:14,469 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:22:14,469 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:22:14,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:22:14,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:22:14,469 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/bin-2019/utaipan/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 04:22:14,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:22:14,475 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 04:22:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:22:14,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:22:15,130 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:22:15,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:22:16,301 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:22:16,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:22:16,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 102, 102] total 102 [2018-12-02 04:22:16,315 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:22:16,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-02 04:22:16,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-02 04:22:16,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-02 04:22:16,316 INFO L87 Difference]: Start difference. First operand 209 states and 258 transitions. Second operand 102 states. [2018-12-02 04:22:16,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:22:16,778 INFO L93 Difference]: Finished difference Result 216 states and 266 transitions. [2018-12-02 04:22:16,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-02 04:22:16,778 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 208 [2018-12-02 04:22:16,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:22:16,779 INFO L225 Difference]: With dead ends: 216 [2018-12-02 04:22:16,779 INFO L226 Difference]: Without dead ends: 211 [2018-12-02 04:22:16,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 267 SyntacticMatches, 100 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17200 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-02 04:22:16,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-02 04:22:16,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-12-02 04:22:16,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-12-02 04:22:16,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 261 transitions. [2018-12-02 04:22:16,784 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 261 transitions. Word has length 208 [2018-12-02 04:22:16,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:22:16,784 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 261 transitions. [2018-12-02 04:22:16,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-02 04:22:16,784 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 261 transitions. [2018-12-02 04:22:16,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-02 04:22:16,785 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:22:16,785 INFO L402 BasicCegarLoop]: trace histogram [100, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:22:16,785 INFO L423 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:22:16,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:22:16,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1853582425, now seen corresponding path program 62 times [2018-12-02 04:22:16,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:22:16,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:22:16,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:22:16,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:22:16,786 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:22:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:22:17,729 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-02 04:22:17,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:22:17,729 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:22:17,729 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:22:17,729 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:22:17,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:22:17,729 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/bin-2019/utaipan/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 04:22:17,735 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 04:22:17,735 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 04:22:17,847 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 100 check-sat command(s) [2018-12-02 04:22:17,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:22:17,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:22:17,968 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-02 04:22:17,968 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:22:18,137 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-02 04:22:18,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:22:18,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 57 [2018-12-02 04:22:18,152 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:22:18,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-02 04:22:18,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-02 04:22:18,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3079, Unknown=0, NotChecked=0, Total=3192 [2018-12-02 04:22:18,152 INFO L87 Difference]: Start difference. First operand 211 states and 261 transitions. Second operand 55 states. [2018-12-02 04:22:18,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:22:18,950 INFO L93 Difference]: Finished difference Result 2867 states and 4242 transitions. [2018-12-02 04:22:18,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-02 04:22:18,950 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 210 [2018-12-02 04:22:18,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:22:18,954 INFO L225 Difference]: With dead ends: 2867 [2018-12-02 04:22:18,954 INFO L226 Difference]: Without dead ends: 2862 [2018-12-02 04:22:18,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 414 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=119, Invalid=3187, Unknown=0, NotChecked=0, Total=3306 [2018-12-02 04:22:18,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2018-12-02 04:22:18,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 213. [2018-12-02 04:22:18,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-02 04:22:18,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 264 transitions. [2018-12-02 04:22:18,987 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 264 transitions. Word has length 210 [2018-12-02 04:22:18,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:22:18,987 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 264 transitions. [2018-12-02 04:22:18,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-02 04:22:18,987 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 264 transitions. [2018-12-02 04:22:18,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-02 04:22:18,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:22:18,988 INFO L402 BasicCegarLoop]: trace histogram [101, 51, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:22:18,988 INFO L423 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:22:18,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:22:18,988 INFO L82 PathProgramCache]: Analyzing trace with hash -2073212190, now seen corresponding path program 63 times [2018-12-02 04:22:18,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:22:18,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:22:18,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:22:18,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:22:18,989 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:22:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:22:19,671 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 7651 proven. 0 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-02 04:22:19,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:22:19,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2018-12-02 04:22:19,671 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:22:19,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-02 04:22:19,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-02 04:22:19,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:22:19,672 INFO L87 Difference]: Start difference. First operand 213 states and 264 transitions. Second operand 52 states. [2018-12-02 04:22:19,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:22:19,833 INFO L93 Difference]: Finished difference Result 312 states and 412 transitions. [2018-12-02 04:22:19,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-02 04:22:19,833 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 212 [2018-12-02 04:22:19,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:22:19,833 INFO L225 Difference]: With dead ends: 312 [2018-12-02 04:22:19,834 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 04:22:19,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 04:22:19,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 04:22:19,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 04:22:19,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 04:22:19,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 04:22:19,834 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 212 [2018-12-02 04:22:19,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:22:19,834 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 04:22:19,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-02 04:22:19,835 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 04:22:19,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 04:22:19,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 04:22:20,183 WARN L180 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 1832 DAG size of output: 407 [2018-12-02 04:22:21,007 WARN L180 SmtUtils]: Spent 810.00 ms on a formula simplification. DAG size of input: 407 DAG size of output: 357 [2018-12-02 04:22:21,010 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-02 04:22:21,010 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 04:22:21,010 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 04:22:21,010 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 04:22:21,010 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 04:22:21,010 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 04:22:21,011 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 23) the Hoare annotation is: true [2018-12-02 04:22:21,011 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 23) no Hoare annotation was computed. [2018-12-02 04:22:21,011 INFO L448 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-12-02 04:22:21,011 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 19) no Hoare annotation was computed. [2018-12-02 04:22:21,011 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 23) no Hoare annotation was computed. [2018-12-02 04:22:21,011 INFO L444 ceAbstractionStarter]: At program point L14-2(lines 13 20) the Hoare annotation is: (or (and (and (<= main_~x~0 99) (<= 99 main_~y~0) (<= main_~y~0 99)) (<= 99 main_~x~0)) (and (and (<= main_~y~0 92) (<= 92 main_~y~0) (<= main_~x~0 92)) (<= 92 main_~x~0)) (and (<= 65 main_~x~0) (and (<= main_~y~0 65) (<= 65 main_~y~0) (<= main_~x~0 65))) (and (and (<= main_~y~0 100) (< 99 main_~y~0)) (<= 100 main_~x~0)) (and (<= 64 main_~x~0) (and (<= main_~x~0 64) (<= 64 main_~y~0) (<= main_~y~0 64))) (and (<= 76 main_~x~0) (and (<= main_~y~0 76) (<= main_~x~0 76) (<= 76 main_~y~0))) (and (<= 87 main_~x~0) (and (<= main_~x~0 87) (<= main_~y~0 87) (<= 87 main_~y~0))) (and (and (<= main_~y~0 78) (<= 78 main_~y~0) (<= main_~x~0 78)) (<= 78 main_~x~0)) (and (<= 72 main_~x~0) (and (<= main_~y~0 72) (<= main_~x~0 72) (<= 72 main_~y~0))) (and (and (<= main_~y~0 69) (<= 69 main_~y~0) (<= main_~x~0 69)) (<= 69 main_~x~0)) (and (<= 60 main_~x~0) (and (<= main_~x~0 60) (<= main_~y~0 60) (<= 60 main_~y~0))) (and (<= 67 main_~x~0) (and (<= main_~y~0 67) (<= main_~x~0 67) (<= 67 main_~y~0))) (and (and (<= main_~y~0 55) (<= 55 main_~y~0) (<= main_~x~0 55)) (<= 55 main_~x~0)) (and (and (<= 73 main_~y~0) (<= main_~x~0 73) (<= main_~y~0 73)) (<= 73 main_~x~0)) (and (<= 66 main_~x~0) (and (<= main_~y~0 66) (<= 66 main_~y~0) (<= main_~x~0 66))) (and (and (<= main_~x~0 70) (<= main_~y~0 70) (<= 70 main_~y~0)) (<= 70 main_~x~0)) (and (and (<= main_~x~0 95) (<= main_~y~0 95) (<= 95 main_~y~0)) (<= 95 main_~x~0)) (and (and (<= 90 main_~y~0) (<= main_~y~0 90) (<= main_~x~0 90)) (<= 90 main_~x~0)) (and (and (<= main_~y~0 59) (<= main_~x~0 59) (<= 59 main_~y~0)) (<= 59 main_~x~0)) (and (<= 85 main_~x~0) (and (<= 85 main_~y~0) (<= main_~x~0 85) (<= main_~y~0 85))) (and (<= 63 main_~x~0) (and (<= main_~y~0 63) (<= main_~x~0 63) (<= 63 main_~y~0))) (and (and (<= main_~y~0 77) (<= main_~x~0 77) (<= 77 main_~y~0)) (<= 77 main_~x~0)) (and (<= 53 main_~x~0) (and (<= main_~y~0 53) (<= main_~x~0 53) (<= 53 main_~y~0))) (and (and (<= main_~x~0 79) (<= main_~y~0 79) (<= 79 main_~y~0)) (<= 79 main_~x~0)) (and (<= 68 main_~x~0) (and (<= 68 main_~y~0) (<= main_~y~0 68) (<= main_~x~0 68))) (and (<= 51 main_~x~0) (and (<= 51 main_~y~0) (<= main_~x~0 51) (<= main_~y~0 51))) (and (<= 54 main_~x~0) (and (<= main_~x~0 54) (<= 54 main_~y~0) (<= main_~y~0 54))) (and (and (<= 56 main_~y~0) (<= main_~x~0 56) (<= main_~y~0 56)) (<= 56 main_~x~0)) (and (<= 61 main_~x~0) (and (<= main_~y~0 61) (<= 61 main_~y~0) (<= main_~x~0 61))) (and (<= 88 main_~x~0) (and (<= main_~x~0 88) (<= main_~y~0 88) (<= 88 main_~y~0))) (and (<= main_~y~0 50) (<= main_~x~0 50) (<= 50 main_~y~0)) (and (<= 80 main_~x~0) (and (<= main_~x~0 80) (<= 80 main_~y~0) (<= main_~y~0 80))) (and (<= 94 main_~x~0) (and (<= main_~x~0 94) (<= main_~y~0 94) (<= 94 main_~y~0))) (and (<= 89 main_~x~0) (and (<= 89 main_~y~0) (<= main_~y~0 89) (<= main_~x~0 89))) (and (and (<= 86 main_~y~0) (<= main_~x~0 86) (<= main_~y~0 86)) (<= 86 main_~x~0)) (and (<= 58 main_~x~0) (and (<= main_~x~0 58) (<= main_~y~0 58) (<= 58 main_~y~0))) (and (and (<= main_~x~0 91) (<= 91 main_~y~0) (<= main_~y~0 91)) (<= 91 main_~x~0)) (and (and (<= 52 main_~y~0) (<= main_~y~0 52) (<= main_~x~0 52)) (<= 52 main_~x~0)) (and (<= 93 main_~x~0) (and (<= main_~x~0 93) (<= 93 main_~y~0) (<= main_~y~0 93))) (and (<= 74 main_~x~0) (and (<= 74 main_~y~0) (<= main_~y~0 74) (<= main_~x~0 74))) (and (and (<= main_~y~0 71) (<= main_~x~0 71) (<= 71 main_~y~0)) (<= 71 main_~x~0)) (and (<= 57 main_~x~0) (and (<= 57 main_~y~0) (<= main_~x~0 57) (<= main_~y~0 57))) (and (<= 97 main_~x~0) (and (<= 97 main_~y~0) (<= main_~x~0 97) (<= main_~y~0 97))) (and (and (<= main_~x~0 81) (<= 81 main_~y~0) (<= main_~y~0 81)) (<= 81 main_~x~0)) (and (<= 84 main_~x~0) (and (<= main_~y~0 84) (<= 84 main_~y~0) (<= main_~x~0 84))) (and (and (<= 96 main_~y~0) (<= main_~x~0 96) (<= main_~y~0 96)) (<= 96 main_~x~0)) (and (<= 83 main_~x~0) (and (<= main_~y~0 83) (<= 83 main_~y~0) (<= main_~x~0 83))) (and (<= 62 main_~x~0) (and (<= main_~y~0 62) (<= main_~x~0 62) (<= 62 main_~y~0))) (and (and (<= main_~x~0 98) (<= main_~y~0 98) (<= 98 main_~y~0)) (<= 98 main_~x~0)) (and (and (<= 75 main_~y~0) (<= main_~x~0 75) (<= main_~y~0 75)) (<= 75 main_~x~0)) (and (and (<= 82 main_~y~0) (<= main_~y~0 82) (<= main_~x~0 82)) (<= 82 main_~x~0))) [2018-12-02 04:22:21,012 INFO L444 ceAbstractionStarter]: At program point L13-2(lines 13 20) the Hoare annotation is: (and (<= main_~y~0 100) (< 99 main_~y~0)) [2018-12-02 04:22:21,012 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-12-02 04:22:21,012 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-12-02 04:22:21,012 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-12-02 04:22:21,012 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-12-02 04:22:21,012 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-12-02 04:22:21,012 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-12-02 04:22:21,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 04:22:21 BoogieIcfgContainer [2018-12-02 04:22:21,025 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 04:22:21,025 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 04:22:21,025 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 04:22:21,026 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 04:22:21,026 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:21:16" (3/4) ... [2018-12-02 04:22:21,028 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 04:22:21,032 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 04:22:21,032 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 04:22:21,032 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-12-02 04:22:21,034 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-02 04:22:21,035 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-02 04:22:21,035 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 04:22:21,057 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_18a58a35-fdff-45b2-ba43-a652470bbaed/bin-2019/utaipan/witness.graphml [2018-12-02 04:22:21,057 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 04:22:21,057 INFO L168 Benchmark]: Toolchain (without parser) took 65301.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.5 MB). Free memory was 953.5 MB in the beginning and 912.7 MB in the end (delta: 40.8 MB). Peak memory consumption was 214.3 MB. Max. memory is 11.5 GB. [2018-12-02 04:22:21,058 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:22:21,058 INFO L168 Benchmark]: CACSL2BoogieTranslator took 116.79 ms. Allocated memory is still 1.0 GB. Free memory was 953.5 MB in the beginning and 942.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 04:22:21,058 INFO L168 Benchmark]: Boogie Procedure Inliner took 10.74 ms. Allocated memory is still 1.0 GB. Free memory is still 942.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:22:21,058 INFO L168 Benchmark]: Boogie Preprocessor took 11.11 ms. Allocated memory is still 1.0 GB. Free memory is still 942.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:22:21,058 INFO L168 Benchmark]: RCFGBuilder took 132.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 88.6 MB). Free memory was 942.7 MB in the beginning and 1.1 GB in the end (delta: -124.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-12-02 04:22:21,059 INFO L168 Benchmark]: TraceAbstraction took 64996.50 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 84.9 MB). Free memory was 1.1 GB in the beginning and 921.5 MB in the end (delta: 146.2 MB). Peak memory consumption was 440.0 MB. Max. memory is 11.5 GB. [2018-12-02 04:22:21,059 INFO L168 Benchmark]: Witness Printer took 31.56 ms. Allocated memory is still 1.2 GB. Free memory was 921.5 MB in the beginning and 912.7 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. [2018-12-02 04:22:21,060 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 116.79 ms. Allocated memory is still 1.0 GB. Free memory was 953.5 MB in the beginning and 942.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 10.74 ms. Allocated memory is still 1.0 GB. Free memory is still 942.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.11 ms. Allocated memory is still 1.0 GB. Free memory is still 942.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 132.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 88.6 MB). Free memory was 942.7 MB in the beginning and 1.1 GB in the end (delta: -124.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 64996.50 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 84.9 MB). Free memory was 1.1 GB in the beginning and 921.5 MB in the end (delta: 146.2 MB). Peak memory consumption was 440.0 MB. Max. memory is 11.5 GB. * Witness Printer took 31.56 ms. Allocated memory is still 1.2 GB. Free memory was 921.5 MB in the beginning and 912.7 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((x <= 99 && 99 <= y) && y <= 99) && 99 <= x) || (((y <= 92 && 92 <= y) && x <= 92) && 92 <= x)) || (65 <= x && (y <= 65 && 65 <= y) && x <= 65)) || ((y <= 100 && 99 < y) && 100 <= x)) || (64 <= x && (x <= 64 && 64 <= y) && y <= 64)) || (76 <= x && (y <= 76 && x <= 76) && 76 <= y)) || (87 <= x && (x <= 87 && y <= 87) && 87 <= y)) || (((y <= 78 && 78 <= y) && x <= 78) && 78 <= x)) || (72 <= x && (y <= 72 && x <= 72) && 72 <= y)) || (((y <= 69 && 69 <= y) && x <= 69) && 69 <= x)) || (60 <= x && (x <= 60 && y <= 60) && 60 <= y)) || (67 <= x && (y <= 67 && x <= 67) && 67 <= y)) || (((y <= 55 && 55 <= y) && x <= 55) && 55 <= x)) || (((73 <= y && x <= 73) && y <= 73) && 73 <= x)) || (66 <= x && (y <= 66 && 66 <= y) && x <= 66)) || (((x <= 70 && y <= 70) && 70 <= y) && 70 <= x)) || (((x <= 95 && y <= 95) && 95 <= y) && 95 <= x)) || (((90 <= y && y <= 90) && x <= 90) && 90 <= x)) || (((y <= 59 && x <= 59) && 59 <= y) && 59 <= x)) || (85 <= x && (85 <= y && x <= 85) && y <= 85)) || (63 <= x && (y <= 63 && x <= 63) && 63 <= y)) || (((y <= 77 && x <= 77) && 77 <= y) && 77 <= x)) || (53 <= x && (y <= 53 && x <= 53) && 53 <= y)) || (((x <= 79 && y <= 79) && 79 <= y) && 79 <= x)) || (68 <= x && (68 <= y && y <= 68) && x <= 68)) || (51 <= x && (51 <= y && x <= 51) && y <= 51)) || (54 <= x && (x <= 54 && 54 <= y) && y <= 54)) || (((56 <= y && x <= 56) && y <= 56) && 56 <= x)) || (61 <= x && (y <= 61 && 61 <= y) && x <= 61)) || (88 <= x && (x <= 88 && y <= 88) && 88 <= y)) || ((y <= 50 && x <= 50) && 50 <= y)) || (80 <= x && (x <= 80 && 80 <= y) && y <= 80)) || (94 <= x && (x <= 94 && y <= 94) && 94 <= y)) || (89 <= x && (89 <= y && y <= 89) && x <= 89)) || (((86 <= y && x <= 86) && y <= 86) && 86 <= x)) || (58 <= x && (x <= 58 && y <= 58) && 58 <= y)) || (((x <= 91 && 91 <= y) && y <= 91) && 91 <= x)) || (((52 <= y && y <= 52) && x <= 52) && 52 <= x)) || (93 <= x && (x <= 93 && 93 <= y) && y <= 93)) || (74 <= x && (74 <= y && y <= 74) && x <= 74)) || (((y <= 71 && x <= 71) && 71 <= y) && 71 <= x)) || (57 <= x && (57 <= y && x <= 57) && y <= 57)) || (97 <= x && (97 <= y && x <= 97) && y <= 97)) || (((x <= 81 && 81 <= y) && y <= 81) && 81 <= x)) || (84 <= x && (y <= 84 && 84 <= y) && x <= 84)) || (((96 <= y && x <= 96) && y <= 96) && 96 <= x)) || (83 <= x && (y <= 83 && 83 <= y) && x <= 83)) || (62 <= x && (y <= 62 && x <= 62) && 62 <= y)) || (((x <= 98 && y <= 98) && 98 <= y) && 98 <= x)) || (((75 <= y && x <= 75) && y <= 75) && 75 <= x)) || (((82 <= y && y <= 82) && x <= 82) && 82 <= x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. SAFE Result, 64.9s OverallTime, 66 OverallIterations, 101 TraceHistogramMax, 7.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 803 SDtfs, 1474 SDslu, 15356 SDs, 0 SdLazy, 9886 SolverSat, 2207 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14458 GetRequests, 10198 SyntacticMatches, 1133 SemanticMatches, 3127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125669 ImplicationChecksByTransitivity, 50.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213occurred in iteration=65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 66 MinimizatonAttempts, 2677 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 72 PreInvPairs, 174 NumberOfFragments, 720 HoareAnnotationTreeSize, 72 FomulaSimplifications, 13400 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 7 FomulaSimplificationsInter, 200 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 52.6s InterpolantComputationTime, 12796 NumberOfCodeBlocks, 12204 NumberOfCodeBlocksAsserted, 822 NumberOfCheckSat, 18886 ConstructedInterpolants, 0 QuantifiedInterpolants, 6095252 SizeOfPredicates, 52 NumberOfNonLiveVariables, 13532 ConjunctsInSsa, 2050 ConjunctsInUnsatCore, 192 InterpolantComputations, 5 PerfectInterpolantSequences, 262906/532273 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...