./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-industry-pattern/nested_true-unreach-call.c --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_8cd2c5b5-505c-4b87-950b-61c731304119/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8cd2c5b5-505c-4b87-950b-61c731304119/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8cd2c5b5-505c-4b87-950b-61c731304119/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8cd2c5b5-505c-4b87-950b-61c731304119/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-industry-pattern/nested_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_8cd2c5b5-505c-4b87-950b-61c731304119/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8cd2c5b5-505c-4b87-950b-61c731304119/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 61b7d6607ccac63dcd99f2b87de00fb6f01869a1 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 09:19:56,282 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 09:19:56,283 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 09:19:56,292 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 09:19:56,292 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 09:19:56,293 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 09:19:56,293 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 09:19:56,295 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 09:19:56,296 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 09:19:56,296 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 09:19:56,297 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 09:19:56,297 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 09:19:56,298 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 09:19:56,299 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 09:19:56,300 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 09:19:56,300 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 09:19:56,301 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 09:19:56,302 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 09:19:56,303 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 09:19:56,304 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 09:19:56,305 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 09:19:56,306 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 09:19:56,307 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 09:19:56,307 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 09:19:56,307 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 09:19:56,308 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 09:19:56,309 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 09:19:56,309 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 09:19:56,309 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 09:19:56,310 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 09:19:56,310 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 09:19:56,311 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 09:19:56,311 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 09:19:56,311 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 09:19:56,312 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 09:19:56,312 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 09:19:56,313 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8cd2c5b5-505c-4b87-950b-61c731304119/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 09:19:56,323 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 09:19:56,323 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 09:19:56,324 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 09:19:56,324 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 09:19:56,324 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 09:19:56,324 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 09:19:56,324 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 09:19:56,325 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 09:19:56,325 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 09:19:56,325 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 09:19:56,325 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 09:19:56,325 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 09:19:56,325 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 09:19:56,326 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 09:19:56,326 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 09:19:56,326 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 09:19:56,326 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 09:19:56,327 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 09:19:56,327 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 09:19:56,327 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 09:19:56,327 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 09:19:56,327 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 09:19:56,327 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 09:19:56,327 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 09:19:56,328 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 09:19:56,328 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 09:19:56,328 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 09:19:56,328 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 09:19:56,328 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 09:19:56,328 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 09:19:56,329 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 09:19:56,329 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 09:19:56,329 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 09:19:56,329 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 09:19:56,329 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 09:19:56,329 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 09:19:56,329 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_8cd2c5b5-505c-4b87-950b-61c731304119/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 -> 61b7d6607ccac63dcd99f2b87de00fb6f01869a1 [2018-12-02 09:19:56,352 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 09:19:56,360 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 09:19:56,362 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 09:19:56,363 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 09:19:56,363 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 09:19:56,364 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8cd2c5b5-505c-4b87-950b-61c731304119/bin-2019/utaipan/../../sv-benchmarks/c/loop-industry-pattern/nested_true-unreach-call.c [2018-12-02 09:19:56,401 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8cd2c5b5-505c-4b87-950b-61c731304119/bin-2019/utaipan/data/0a9afaf6b/bc9c5a1a503540e6bb797c97cd88668f/FLAG1e1bbb48a [2018-12-02 09:19:56,822 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 09:19:56,823 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8cd2c5b5-505c-4b87-950b-61c731304119/sv-benchmarks/c/loop-industry-pattern/nested_true-unreach-call.c [2018-12-02 09:19:56,826 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8cd2c5b5-505c-4b87-950b-61c731304119/bin-2019/utaipan/data/0a9afaf6b/bc9c5a1a503540e6bb797c97cd88668f/FLAG1e1bbb48a [2018-12-02 09:19:56,836 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8cd2c5b5-505c-4b87-950b-61c731304119/bin-2019/utaipan/data/0a9afaf6b/bc9c5a1a503540e6bb797c97cd88668f [2018-12-02 09:19:56,838 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 09:19:56,839 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 09:19:56,839 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 09:19:56,839 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 09:19:56,842 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 09:19:56,842 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:19:56" (1/1) ... [2018-12-02 09:19:56,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@643265e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:56, skipping insertion in model container [2018-12-02 09:19:56,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:19:56" (1/1) ... [2018-12-02 09:19:56,848 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 09:19:56,858 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 09:19:56,956 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 09:19:56,958 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 09:19:56,970 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 09:19:56,979 INFO L195 MainTranslator]: Completed translation [2018-12-02 09:19:56,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:56 WrapperNode [2018-12-02 09:19:56,979 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 09:19:56,980 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 09:19:56,980 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 09:19:56,980 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 09:19:56,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:56" (1/1) ... [2018-12-02 09:19:56,988 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:56" (1/1) ... [2018-12-02 09:19:56,992 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 09:19:56,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 09:19:56,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 09:19:56,992 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 09:19:56,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:56" (1/1) ... [2018-12-02 09:19:56,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:56" (1/1) ... [2018-12-02 09:19:56,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:56" (1/1) ... [2018-12-02 09:19:56,998 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:56" (1/1) ... [2018-12-02 09:19:57,001 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:56" (1/1) ... [2018-12-02 09:19:57,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:56" (1/1) ... [2018-12-02 09:19:57,035 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:56" (1/1) ... [2018-12-02 09:19:57,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 09:19:57,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 09:19:57,037 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 09:19:57,037 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 09:19:57,038 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cd2c5b5-505c-4b87-950b-61c731304119/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 09:19:57,069 INFO L130 BoogieDeclarations]: Found specification of procedure nondet [2018-12-02 09:19:57,069 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet [2018-12-02 09:19:57,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 09:19:57,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 09:19:57,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 09:19:57,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 09:19:57,070 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 09:19:57,070 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 09:19:57,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-02 09:19:57,070 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-02 09:19:57,160 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 09:19:57,160 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 09:19:57,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:19:57 BoogieIcfgContainer [2018-12-02 09:19:57,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 09:19:57,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 09:19:57,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 09:19:57,163 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 09:19:57,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:19:56" (1/3) ... [2018-12-02 09:19:57,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15553b88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:19:57, skipping insertion in model container [2018-12-02 09:19:57,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:19:56" (2/3) ... [2018-12-02 09:19:57,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15553b88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:19:57, skipping insertion in model container [2018-12-02 09:19:57,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:19:57" (3/3) ... [2018-12-02 09:19:57,165 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_true-unreach-call.c [2018-12-02 09:19:57,171 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 09:19:57,179 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 09:19:57,187 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 09:19:57,204 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 09:19:57,204 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 09:19:57,204 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 09:19:57,204 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 09:19:57,204 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 09:19:57,205 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 09:19:57,205 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 09:19:57,205 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 09:19:57,214 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-12-02 09:19:57,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 09:19:57,217 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:19:57,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:19:57,218 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:19:57,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:19:57,222 INFO L82 PathProgramCache]: Analyzing trace with hash -576830929, now seen corresponding path program 1 times [2018-12-02 09:19:57,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:19:57,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:19:57,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:19:57,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:19:57,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:19:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:19:57,289 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 09:19:57,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:19:57,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 09:19:57,290 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:19:57,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 09:19:57,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 09:19:57,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 09:19:57,302 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-12-02 09:19:57,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:19:57,313 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2018-12-02 09:19:57,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 09:19:57,314 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-12-02 09:19:57,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:19:57,319 INFO L225 Difference]: With dead ends: 40 [2018-12-02 09:19:57,319 INFO L226 Difference]: Without dead ends: 23 [2018-12-02 09:19:57,321 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 09:19:57,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-02 09:19:57,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-02 09:19:57,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-02 09:19:57,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-12-02 09:19:57,341 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 18 [2018-12-02 09:19:57,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:19:57,341 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-12-02 09:19:57,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 09:19:57,341 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-12-02 09:19:57,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 09:19:57,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:19:57,342 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:19:57,342 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:19:57,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:19:57,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1749436828, now seen corresponding path program 1 times [2018-12-02 09:19:57,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:19:57,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:19:57,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:19:57,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:19:57,343 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:19:57,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:19:57,376 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 09:19:57,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:19:57,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 09:19:57,376 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:19:57,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 09:19:57,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 09:19:57,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:19:57,378 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 3 states. [2018-12-02 09:19:57,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:19:57,407 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2018-12-02 09:19:57,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 09:19:57,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-02 09:19:57,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:19:57,409 INFO L225 Difference]: With dead ends: 40 [2018-12-02 09:19:57,409 INFO L226 Difference]: Without dead ends: 27 [2018-12-02 09:19:57,409 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 09:19:57,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-02 09:19:57,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2018-12-02 09:19:57,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-02 09:19:57,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-12-02 09:19:57,412 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 18 [2018-12-02 09:19:57,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:19:57,413 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-12-02 09:19:57,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 09:19:57,413 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-12-02 09:19:57,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 09:19:57,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:19:57,413 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:19:57,413 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:19:57,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:19:57,414 INFO L82 PathProgramCache]: Analyzing trace with hash -479721733, now seen corresponding path program 1 times [2018-12-02 09:19:57,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:19:57,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:19:57,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:19:57,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:19:57,414 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:19:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:19:57,441 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 09:19:57,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:19:57,442 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:19:57,442 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-02 09:19:57,444 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [17], [23], [25], [28], [32], [38], [44], [53], [56], [58], [64], [65], [66], [68], [69], [70] [2018-12-02 09:19:57,464 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 09:19:57,464 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 09:19:57,536 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 09:19:57,537 INFO L272 AbstractInterpreter]: Visited 15 different actions 18 times. Merged at 2 different actions 2 times. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 3. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2018-12-02 09:19:57,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:19:57,542 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 09:19:57,577 INFO L227 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 73.85% of their original sizes. [2018-12-02 09:19:57,577 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 09:19:57,596 INFO L418 sIntCurrentIteration]: We unified 20 AI predicates to 20 [2018-12-02 09:19:57,596 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 09:19:57,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 09:19:57,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2018-12-02 09:19:57,597 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:19:57,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 09:19:57,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 09:19:57,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:19:57,598 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 6 states. [2018-12-02 09:19:57,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:19:57,687 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2018-12-02 09:19:57,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 09:19:57,687 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-12-02 09:19:57,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:19:57,689 INFO L225 Difference]: With dead ends: 48 [2018-12-02 09:19:57,689 INFO L226 Difference]: Without dead ends: 34 [2018-12-02 09:19:57,689 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:19:57,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-02 09:19:57,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2018-12-02 09:19:57,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-02 09:19:57,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-12-02 09:19:57,693 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 21 [2018-12-02 09:19:57,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:19:57,694 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-12-02 09:19:57,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 09:19:57,694 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-12-02 09:19:57,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 09:19:57,694 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:19:57,694 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:19:57,695 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:19:57,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:19:57,695 INFO L82 PathProgramCache]: Analyzing trace with hash 200336637, now seen corresponding path program 1 times [2018-12-02 09:19:57,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:19:57,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:19:57,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:19:57,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:19:57,696 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:19:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:19:57,712 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 09:19:57,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:19:57,712 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:19:57,712 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-02 09:19:57,712 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [17], [23], [25], [30], [32], [38], [44], [53], [56], [58], [64], [65], [66], [68], [69], [70] [2018-12-02 09:19:57,713 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 09:19:57,713 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 09:19:57,728 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 09:19:57,728 INFO L272 AbstractInterpreter]: Visited 16 different actions 24 times. Merged at 3 different actions 6 times. Never widened. Performed 67 root evaluator evaluations with a maximum evaluation depth of 3. Performed 67 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2018-12-02 09:19:57,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:19:57,730 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 09:19:57,744 INFO L227 lantSequenceWeakener]: Weakened 14 states. On average, predicates are now at 70% of their original sizes. [2018-12-02 09:19:57,744 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 09:19:57,757 INFO L418 sIntCurrentIteration]: We unified 20 AI predicates to 20 [2018-12-02 09:19:57,757 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 09:19:57,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 09:19:57,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2018-12-02 09:19:57,757 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:19:57,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:19:57,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:19:57,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:19:57,758 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 5 states. [2018-12-02 09:19:57,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:19:57,808 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2018-12-02 09:19:57,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:19:57,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-12-02 09:19:57,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:19:57,809 INFO L225 Difference]: With dead ends: 52 [2018-12-02 09:19:57,809 INFO L226 Difference]: Without dead ends: 38 [2018-12-02 09:19:57,809 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:19:57,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-02 09:19:57,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2018-12-02 09:19:57,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-02 09:19:57,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2018-12-02 09:19:57,815 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 21 [2018-12-02 09:19:57,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:19:57,815 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-12-02 09:19:57,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:19:57,815 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2018-12-02 09:19:57,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 09:19:57,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:19:57,816 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:19:57,816 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:19:57,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:19:57,816 INFO L82 PathProgramCache]: Analyzing trace with hash 257594939, now seen corresponding path program 1 times [2018-12-02 09:19:57,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:19:57,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:19:57,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:19:57,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:19:57,817 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:19:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:19:57,834 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 09:19:57,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:19:57,834 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:19:57,834 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-02 09:19:57,834 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [17], [23], [25], [30], [32], [40], [44], [53], [56], [58], [64], [65], [66], [68], [69], [70] [2018-12-02 09:19:57,835 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 09:19:57,835 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 09:19:57,851 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 09:19:57,851 INFO L272 AbstractInterpreter]: Visited 17 different actions 25 times. Merged at 3 different actions 6 times. Never widened. Performed 71 root evaluator evaluations with a maximum evaluation depth of 4. Performed 71 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2018-12-02 09:19:57,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:19:57,854 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 09:19:57,868 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 66.67% of their original sizes. [2018-12-02 09:19:57,868 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 09:19:57,888 INFO L418 sIntCurrentIteration]: We unified 20 AI predicates to 20 [2018-12-02 09:19:57,888 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 09:19:57,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 09:19:57,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2018-12-02 09:19:57,888 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:19:57,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 09:19:57,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 09:19:57,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:19:57,889 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand 6 states. [2018-12-02 09:19:57,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:19:57,950 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2018-12-02 09:19:57,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 09:19:57,950 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-12-02 09:19:57,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:19:57,951 INFO L225 Difference]: With dead ends: 55 [2018-12-02 09:19:57,951 INFO L226 Difference]: Without dead ends: 41 [2018-12-02 09:19:57,951 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:19:57,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-02 09:19:57,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2018-12-02 09:19:57,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-02 09:19:57,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2018-12-02 09:19:57,956 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 21 [2018-12-02 09:19:57,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:19:57,957 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2018-12-02 09:19:57,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 09:19:57,957 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2018-12-02 09:19:57,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 09:19:57,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:19:57,957 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:19:57,957 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:19:57,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:19:57,957 INFO L82 PathProgramCache]: Analyzing trace with hash 259441981, now seen corresponding path program 1 times [2018-12-02 09:19:57,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:19:57,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:19:57,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:19:57,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:19:57,958 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:19:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:19:57,974 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 09:19:57,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:19:57,974 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:19:57,974 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-02 09:19:57,974 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [17], [23], [25], [30], [32], [40], [46], [53], [56], [58], [64], [65], [66], [68], [69], [70] [2018-12-02 09:19:57,975 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 09:19:57,975 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 09:19:57,988 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 09:19:57,988 INFO L272 AbstractInterpreter]: Visited 21 different actions 29 times. Merged at 3 different actions 6 times. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 6. Performed 80 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2018-12-02 09:19:57,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:19:57,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 09:19:57,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:19:57,990 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cd2c5b5-505c-4b87-950b-61c731304119/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 09:19:57,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:19:57,997 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 09:19:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:19:58,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:19:58,030 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 09:19:58,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:19:58,048 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 09:19:58,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 09:19:58,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-02 09:19:58,063 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 09:19:58,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 09:19:58,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 09:19:58,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:19:58,064 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 4 states. [2018-12-02 09:19:58,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:19:58,083 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2018-12-02 09:19:58,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 09:19:58,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-12-02 09:19:58,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:19:58,083 INFO L225 Difference]: With dead ends: 64 [2018-12-02 09:19:58,084 INFO L226 Difference]: Without dead ends: 48 [2018-12-02 09:19:58,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 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 09:19:58,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-02 09:19:58,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2018-12-02 09:19:58,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-02 09:19:58,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2018-12-02 09:19:58,087 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 21 [2018-12-02 09:19:58,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:19:58,088 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2018-12-02 09:19:58,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 09:19:58,088 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2018-12-02 09:19:58,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 09:19:58,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:19:58,088 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:19:58,088 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:19:58,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:19:58,089 INFO L82 PathProgramCache]: Analyzing trace with hash 505755910, now seen corresponding path program 1 times [2018-12-02 09:19:58,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:19:58,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:19:58,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:19:58,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:19:58,089 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:19:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:19:58,104 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 09:19:58,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:19:58,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 09:19:58,105 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:19:58,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 09:19:58,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 09:19:58,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:19:58,105 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand 3 states. [2018-12-02 09:19:58,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:19:58,121 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2018-12-02 09:19:58,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 09:19:58,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-02 09:19:58,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:19:58,121 INFO L225 Difference]: With dead ends: 60 [2018-12-02 09:19:58,122 INFO L226 Difference]: Without dead ends: 43 [2018-12-02 09:19:58,122 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 09:19:58,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-02 09:19:58,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2018-12-02 09:19:58,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-02 09:19:58,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2018-12-02 09:19:58,125 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 24 [2018-12-02 09:19:58,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:19:58,125 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2018-12-02 09:19:58,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 09:19:58,125 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2018-12-02 09:19:58,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 09:19:58,126 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:19:58,126 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:19:58,126 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:19:58,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:19:58,126 INFO L82 PathProgramCache]: Analyzing trace with hash 507602952, now seen corresponding path program 1 times [2018-12-02 09:19:58,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:19:58,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:19:58,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:19:58,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:19:58,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:19:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:19:58,146 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:19:58,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:19:58,146 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:19:58,146 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-02 09:19:58,147 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [17], [23], [25], [28], [30], [32], [38], [46], [53], [56], [58], [64], [65], [66], [68], [69], [70] [2018-12-02 09:19:58,147 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 09:19:58,147 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 09:19:58,160 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 09:19:58,161 INFO L272 AbstractInterpreter]: Visited 22 different actions 32 times. Merged at 3 different actions 6 times. Never widened. Performed 94 root evaluator evaluations with a maximum evaluation depth of 6. Performed 94 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 4 fixpoints after 3 different actions. Largest state had 8 variables. [2018-12-02 09:19:58,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:19:58,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 09:19:58,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:19:58,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cd2c5b5-505c-4b87-950b-61c731304119/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 09:19:58,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:19:58,169 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 09:19:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:19:58,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:19:58,182 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:19:58,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:19:58,209 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:19:58,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 09:19:58,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-12-02 09:19:58,225 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 09:19:58,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:19:58,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:19:58,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-02 09:19:58,226 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand 5 states. [2018-12-02 09:19:58,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:19:58,259 INFO L93 Difference]: Finished difference Result 76 states and 98 transitions. [2018-12-02 09:19:58,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:19:58,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-12-02 09:19:58,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:19:58,260 INFO L225 Difference]: With dead ends: 76 [2018-12-02 09:19:58,261 INFO L226 Difference]: Without dead ends: 57 [2018-12-02 09:19:58,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-02 09:19:58,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-02 09:19:58,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2018-12-02 09:19:58,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-02 09:19:58,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2018-12-02 09:19:58,266 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 24 [2018-12-02 09:19:58,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:19:58,266 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2018-12-02 09:19:58,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:19:58,267 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2018-12-02 09:19:58,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 09:19:58,267 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:19:58,267 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:19:58,268 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:19:58,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:19:58,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1782535329, now seen corresponding path program 2 times [2018-12-02 09:19:58,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:19:58,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:19:58,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:19:58,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:19:58,269 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:19:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:19:58,297 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:19:58,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:19:58,297 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:19:58,298 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 09:19:58,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 09:19:58,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:19:58,298 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cd2c5b5-505c-4b87-950b-61c731304119/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 09:19:58,306 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 09:19:58,306 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 09:19:58,316 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-02 09:19:58,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 09:19:58,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:19:58,341 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 09:19:58,341 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:19:58,360 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 09:19:58,376 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 09:19:58,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [6] total 8 [2018-12-02 09:19:58,376 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:19:58,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 09:19:58,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 09:19:58,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 09:19:58,377 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand 4 states. [2018-12-02 09:19:58,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:19:58,427 INFO L93 Difference]: Finished difference Result 87 states and 112 transitions. [2018-12-02 09:19:58,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:19:58,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-12-02 09:19:58,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:19:58,428 INFO L225 Difference]: With dead ends: 87 [2018-12-02 09:19:58,428 INFO L226 Difference]: Without dead ends: 66 [2018-12-02 09:19:58,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-02 09:19:58,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-02 09:19:58,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 52. [2018-12-02 09:19:58,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-02 09:19:58,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2018-12-02 09:19:58,432 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 27 [2018-12-02 09:19:58,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:19:58,433 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2018-12-02 09:19:58,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 09:19:58,433 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2018-12-02 09:19:58,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 09:19:58,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:19:58,433 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:19:58,433 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:19:58,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:19:58,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1727124069, now seen corresponding path program 1 times [2018-12-02 09:19:58,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:19:58,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:19:58,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 09:19:58,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:19:58,434 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:19:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:19:58,458 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:19:58,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:19:58,458 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:19:58,458 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-12-02 09:19:58,458 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [17], [23], [25], [28], [30], [32], [40], [44], [53], [56], [58], [64], [65], [66], [68], [69], [70] [2018-12-02 09:19:58,459 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 09:19:58,459 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 09:19:58,471 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 09:19:58,472 INFO L272 AbstractInterpreter]: Visited 22 different actions 34 times. Merged at 4 different actions 8 times. Never widened. Performed 103 root evaluator evaluations with a maximum evaluation depth of 6. Performed 103 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 4 fixpoints after 2 different actions. Largest state had 8 variables. [2018-12-02 09:19:58,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:19:58,473 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 09:19:58,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:19:58,473 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cd2c5b5-505c-4b87-950b-61c731304119/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 09:19:58,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:19:58,479 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 09:19:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:19:58,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:19:58,502 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 09:19:58,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:19:58,516 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 09:19:58,530 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 09:19:58,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [6] total 8 [2018-12-02 09:19:58,531 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:19:58,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 09:19:58,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 09:19:58,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-02 09:19:58,531 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand 4 states. [2018-12-02 09:19:58,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:19:58,554 INFO L93 Difference]: Finished difference Result 92 states and 118 transitions. [2018-12-02 09:19:58,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 09:19:58,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-12-02 09:19:58,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:19:58,555 INFO L225 Difference]: With dead ends: 92 [2018-12-02 09:19:58,555 INFO L226 Difference]: Without dead ends: 65 [2018-12-02 09:19:58,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-02 09:19:58,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-02 09:19:58,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2018-12-02 09:19:58,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-02 09:19:58,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2018-12-02 09:19:58,559 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 27 [2018-12-02 09:19:58,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:19:58,559 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2018-12-02 09:19:58,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 09:19:58,559 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2018-12-02 09:19:58,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 09:19:58,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:19:58,559 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:19:58,560 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:19:58,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:19:58,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1467111589, now seen corresponding path program 1 times [2018-12-02 09:19:58,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:19:58,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:19:58,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:19:58,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:19:58,561 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:19:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:19:58,578 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:19:58,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:19:58,579 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:19:58,579 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-12-02 09:19:58,579 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [17], [23], [25], [28], [30], [32], [40], [46], [53], [56], [58], [64], [65], [66], [68], [69], [70] [2018-12-02 09:19:58,580 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 09:19:58,580 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 09:19:58,593 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 09:19:58,593 INFO L272 AbstractInterpreter]: Visited 22 different actions 36 times. Merged at 3 different actions 8 times. Never widened. Performed 110 root evaluator evaluations with a maximum evaluation depth of 6. Performed 110 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 5 fixpoints after 2 different actions. Largest state had 8 variables. [2018-12-02 09:19:58,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:19:58,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 09:19:58,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:19:58,595 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cd2c5b5-505c-4b87-950b-61c731304119/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 09:19:58,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:19:58,601 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 09:19:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:19:58,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:19:58,619 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:19:58,619 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:19:58,681 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:19:58,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 09:19:58,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-12-02 09:19:58,695 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 09:19:58,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 09:19:58,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 09:19:58,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-02 09:19:58,696 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand 6 states. [2018-12-02 09:19:58,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:19:58,729 INFO L93 Difference]: Finished difference Result 105 states and 133 transitions. [2018-12-02 09:19:58,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 09:19:58,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-12-02 09:19:58,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:19:58,729 INFO L225 Difference]: With dead ends: 105 [2018-12-02 09:19:58,729 INFO L226 Difference]: Without dead ends: 72 [2018-12-02 09:19:58,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 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 09:19:58,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-02 09:19:58,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2018-12-02 09:19:58,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-02 09:19:58,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2018-12-02 09:19:58,733 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 27 [2018-12-02 09:19:58,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:19:58,733 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2018-12-02 09:19:58,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 09:19:58,733 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2018-12-02 09:19:58,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 09:19:58,734 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:19:58,734 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:19:58,734 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:19:58,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:19:58,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1593959718, now seen corresponding path program 2 times [2018-12-02 09:19:58,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:19:58,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:19:58,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:19:58,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:19:58,735 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:19:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:19:58,764 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:19:58,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:19:58,764 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:19:58,764 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 09:19:58,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 09:19:58,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:19:58,764 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cd2c5b5-505c-4b87-950b-61c731304119/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 09:19:58,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 09:19:58,770 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 09:19:58,777 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 09:19:58,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 09:19:58,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:19:58,829 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 09:19:58,830 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:19:58,887 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 09:19:58,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 09:19:58,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7, 8] total 20 [2018-12-02 09:19:58,901 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:19:58,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 09:19:58,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 09:19:58,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-12-02 09:19:58,902 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand 9 states. [2018-12-02 09:19:58,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:19:58,945 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2018-12-02 09:19:58,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 09:19:58,945 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-12-02 09:19:58,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:19:58,946 INFO L225 Difference]: With dead ends: 87 [2018-12-02 09:19:58,946 INFO L226 Difference]: Without dead ends: 85 [2018-12-02 09:19:58,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-12-02 09:19:58,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-02 09:19:58,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-12-02 09:19:58,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-02 09:19:58,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 101 transitions. [2018-12-02 09:19:58,952 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 101 transitions. Word has length 30 [2018-12-02 09:19:58,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:19:58,952 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 101 transitions. [2018-12-02 09:19:58,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 09:19:58,953 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2018-12-02 09:19:58,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 09:19:58,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:19:58,953 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:19:58,953 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:19:58,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:19:58,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1137501660, now seen corresponding path program 3 times [2018-12-02 09:19:58,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:19:58,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:19:58,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 09:19:58,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:19:58,954 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:19:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:19:58,977 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:19:58,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:19:58,978 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:19:58,978 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 09:19:58,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 09:19:58,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:19:58,978 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cd2c5b5-505c-4b87-950b-61c731304119/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 09:19:58,984 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 09:19:58,985 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 09:19:58,992 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 09:19:58,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 09:19:58,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:19:58,995 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:19:58,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:19:59,035 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:19:59,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 09:19:59,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-12-02 09:19:59,050 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 09:19:59,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 09:19:59,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 09:19:59,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-02 09:19:59,050 INFO L87 Difference]: Start difference. First operand 84 states and 101 transitions. Second operand 7 states. [2018-12-02 09:19:59,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:19:59,079 INFO L93 Difference]: Finished difference Result 157 states and 194 transitions. [2018-12-02 09:19:59,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 09:19:59,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-12-02 09:19:59,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:19:59,081 INFO L225 Difference]: With dead ends: 157 [2018-12-02 09:19:59,081 INFO L226 Difference]: Without dead ends: 110 [2018-12-02 09:19:59,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 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 09:19:59,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-02 09:19:59,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 96. [2018-12-02 09:19:59,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-02 09:19:59,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 115 transitions. [2018-12-02 09:19:59,086 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 115 transitions. Word has length 30 [2018-12-02 09:19:59,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:19:59,086 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 115 transitions. [2018-12-02 09:19:59,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 09:19:59,086 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 115 transitions. [2018-12-02 09:19:59,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 09:19:59,087 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:19:59,087 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:19:59,087 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:19:59,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:19:59,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1385944259, now seen corresponding path program 4 times [2018-12-02 09:19:59,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:19:59,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:19:59,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 09:19:59,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:19:59,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:19:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:19:59,128 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:19:59,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:19:59,128 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:19:59,128 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 09:19:59,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 09:19:59,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:19:59,128 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cd2c5b5-505c-4b87-950b-61c731304119/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 09:19:59,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:19:59,136 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 09:19:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:19:59,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:19:59,149 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:19:59,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:19:59,195 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:19:59,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 09:19:59,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-12-02 09:19:59,210 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 09:19:59,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 09:19:59,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 09:19:59,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-02 09:19:59,211 INFO L87 Difference]: Start difference. First operand 96 states and 115 transitions. Second operand 8 states. [2018-12-02 09:19:59,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:19:59,243 INFO L93 Difference]: Finished difference Result 175 states and 215 transitions. [2018-12-02 09:19:59,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 09:19:59,243 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-12-02 09:19:59,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:19:59,244 INFO L225 Difference]: With dead ends: 175 [2018-12-02 09:19:59,244 INFO L226 Difference]: Without dead ends: 122 [2018-12-02 09:19:59,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-02 09:19:59,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-02 09:19:59,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 108. [2018-12-02 09:19:59,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-02 09:19:59,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 129 transitions. [2018-12-02 09:19:59,249 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 129 transitions. Word has length 33 [2018-12-02 09:19:59,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:19:59,250 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 129 transitions. [2018-12-02 09:19:59,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 09:19:59,250 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2018-12-02 09:19:59,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 09:19:59,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:19:59,251 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:19:59,251 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:19:59,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:19:59,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1784207236, now seen corresponding path program 5 times [2018-12-02 09:19:59,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:19:59,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:19:59,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:19:59,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:19:59,252 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:19:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:19:59,290 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:19:59,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:19:59,290 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:19:59,290 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 09:19:59,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 09:19:59,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:19:59,290 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cd2c5b5-505c-4b87-950b-61c731304119/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 09:19:59,297 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 09:19:59,297 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 09:19:59,307 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 09:19:59,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 09:19:59,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:19:59,371 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-02 09:19:59,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:19:59,458 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-02 09:19:59,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 09:19:59,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 23 [2018-12-02 09:19:59,473 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:19:59,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 09:19:59,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 09:19:59,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2018-12-02 09:19:59,474 INFO L87 Difference]: Start difference. First operand 108 states and 129 transitions. Second operand 9 states. [2018-12-02 09:19:59,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:19:59,531 INFO L93 Difference]: Finished difference Result 118 states and 139 transitions. [2018-12-02 09:19:59,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 09:19:59,531 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-12-02 09:19:59,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:19:59,532 INFO L225 Difference]: With dead ends: 118 [2018-12-02 09:19:59,532 INFO L226 Difference]: Without dead ends: 116 [2018-12-02 09:19:59,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2018-12-02 09:19:59,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-02 09:19:59,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2018-12-02 09:19:59,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-02 09:19:59,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 129 transitions. [2018-12-02 09:19:59,539 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 129 transitions. Word has length 36 [2018-12-02 09:19:59,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:19:59,539 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 129 transitions. [2018-12-02 09:19:59,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 09:19:59,539 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2018-12-02 09:19:59,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 09:19:59,540 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:19:59,540 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 10, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:19:59,540 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:19:59,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:19:59,541 INFO L82 PathProgramCache]: Analyzing trace with hash -664909344, now seen corresponding path program 1 times [2018-12-02 09:19:59,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:19:59,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:19:59,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 09:19:59,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:19:59,542 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:19:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:19:59,585 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 124 proven. 51 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-12-02 09:19:59,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:19:59,585 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:19:59,585 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-12-02 09:19:59,585 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [17], [23], [25], [28], [30], [32], [40], [46], [53], [56], [58], [61], [63], [64], [65], [66], [68], [69], [70], [71] [2018-12-02 09:19:59,586 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 09:19:59,586 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 09:19:59,609 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 09:19:59,609 INFO L272 AbstractInterpreter]: Visited 25 different actions 56 times. Merged at 9 different actions 17 times. Widened at 1 different actions 1 times. Performed 188 root evaluator evaluations with a maximum evaluation depth of 6. Performed 188 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 9 fixpoints after 5 different actions. Largest state had 8 variables. [2018-12-02 09:19:59,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:19:59,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 09:19:59,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:19:59,617 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cd2c5b5-505c-4b87-950b-61c731304119/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 09:19:59,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:19:59,624 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 09:19:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:19:59,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:19:59,640 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 122 proven. 51 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-12-02 09:19:59,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:19:59,707 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 124 proven. 51 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-12-02 09:19:59,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 09:19:59,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-12-02 09:19:59,722 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 09:19:59,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 09:19:59,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 09:19:59,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-02 09:19:59,723 INFO L87 Difference]: Start difference. First operand 108 states and 129 transitions. Second operand 9 states. [2018-12-02 09:19:59,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:19:59,760 INFO L93 Difference]: Finished difference Result 193 states and 236 transitions. [2018-12-02 09:19:59,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 09:19:59,760 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2018-12-02 09:19:59,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:19:59,761 INFO L225 Difference]: With dead ends: 193 [2018-12-02 09:19:59,761 INFO L226 Difference]: Without dead ends: 134 [2018-12-02 09:19:59,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 120 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 09:19:59,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-02 09:19:59,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 120. [2018-12-02 09:19:59,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-02 09:19:59,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 143 transitions. [2018-12-02 09:19:59,766 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 143 transitions. Word has length 63 [2018-12-02 09:19:59,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:19:59,766 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 143 transitions. [2018-12-02 09:19:59,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 09:19:59,766 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 143 transitions. [2018-12-02 09:19:59,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 09:19:59,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:19:59,766 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 12, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:19:59,766 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:19:59,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:19:59,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1925079978, now seen corresponding path program 2 times [2018-12-02 09:19:59,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:19:59,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:19:59,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:19:59,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:19:59,767 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:19:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:19:59,816 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 165 proven. 70 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-12-02 09:19:59,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:19:59,816 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:19:59,817 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 09:19:59,817 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 09:19:59,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:19:59,817 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cd2c5b5-505c-4b87-950b-61c731304119/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 09:19:59,824 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 09:19:59,824 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 09:19:59,833 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 09:19:59,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 09:19:59,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:19:59,947 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 20 proven. 167 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-02 09:19:59,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:20:00,026 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 167 proven. 20 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-02 09:20:00,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 09:20:00,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 9] total 26 [2018-12-02 09:20:00,041 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 09:20:00,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-02 09:20:00,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 09:20:00,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2018-12-02 09:20:00,042 INFO L87 Difference]: Start difference. First operand 120 states and 143 transitions. Second operand 20 states. [2018-12-02 09:20:00,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:20:00,369 INFO L93 Difference]: Finished difference Result 285 states and 353 transitions. [2018-12-02 09:20:00,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-02 09:20:00,370 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 69 [2018-12-02 09:20:00,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:20:00,371 INFO L225 Difference]: With dead ends: 285 [2018-12-02 09:20:00,371 INFO L226 Difference]: Without dead ends: 220 [2018-12-02 09:20:00,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=374, Invalid=1518, Unknown=0, NotChecked=0, Total=1892 [2018-12-02 09:20:00,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-12-02 09:20:00,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 201. [2018-12-02 09:20:00,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-12-02 09:20:00,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 241 transitions. [2018-12-02 09:20:00,378 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 241 transitions. Word has length 69 [2018-12-02 09:20:00,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:20:00,378 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 241 transitions. [2018-12-02 09:20:00,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-02 09:20:00,378 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 241 transitions. [2018-12-02 09:20:00,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-02 09:20:00,380 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:20:00,380 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 14, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:20:00,380 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:20:00,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:00,380 INFO L82 PathProgramCache]: Analyzing trace with hash -743019998, now seen corresponding path program 1 times [2018-12-02 09:20:00,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:20:00,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:00,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 09:20:00,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:00,381 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:20:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:20:00,434 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 212 proven. 92 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-12-02 09:20:00,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:20:00,434 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:20:00,434 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 76 with the following transitions: [2018-12-02 09:20:00,434 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [17], [23], [25], [28], [30], [32], [38], [40], [46], [53], [56], [58], [61], [63], [64], [65], [66], [68], [69], [70], [71] [2018-12-02 09:20:00,435 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 09:20:00,435 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 09:20:00,466 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 09:20:00,466 INFO L272 AbstractInterpreter]: Visited 26 different actions 100 times. Merged at 10 different actions 32 times. Widened at 1 different actions 2 times. Performed 339 root evaluator evaluations with a maximum evaluation depth of 6. Performed 339 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 13 fixpoints after 5 different actions. Largest state had 8 variables. [2018-12-02 09:20:00,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:00,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 09:20:00,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:20:00,467 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cd2c5b5-505c-4b87-950b-61c731304119/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 09:20:00,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:20:00,474 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 09:20:00,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:20:00,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:20:00,499 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 210 proven. 92 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-12-02 09:20:00,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:20:00,602 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 212 proven. 92 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-12-02 09:20:00,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 09:20:00,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2018-12-02 09:20:00,617 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 09:20:00,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 09:20:00,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 09:20:00,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-02 09:20:00,617 INFO L87 Difference]: Start difference. First operand 201 states and 241 transitions. Second operand 11 states. [2018-12-02 09:20:00,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:20:00,649 INFO L93 Difference]: Finished difference Result 372 states and 452 transitions. [2018-12-02 09:20:00,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 09:20:00,649 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2018-12-02 09:20:00,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:20:00,650 INFO L225 Difference]: With dead ends: 372 [2018-12-02 09:20:00,650 INFO L226 Difference]: Without dead ends: 232 [2018-12-02 09:20:00,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-02 09:20:00,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-12-02 09:20:00,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 213. [2018-12-02 09:20:00,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-02 09:20:00,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 255 transitions. [2018-12-02 09:20:00,658 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 255 transitions. Word has length 75 [2018-12-02 09:20:00,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:20:00,658 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 255 transitions. [2018-12-02 09:20:00,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 09:20:00,658 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 255 transitions. [2018-12-02 09:20:00,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-02 09:20:00,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:20:00,658 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 16, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:20:00,658 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:20:00,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:00,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1889194728, now seen corresponding path program 2 times [2018-12-02 09:20:00,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:20:00,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:00,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:20:00,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:00,660 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:20:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:20:00,725 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 265 proven. 117 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-02 09:20:00,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:20:00,725 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:20:00,725 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 09:20:00,725 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 09:20:00,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:20:00,725 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cd2c5b5-505c-4b87-950b-61c731304119/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 09:20:00,733 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 09:20:00,733 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 09:20:00,741 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 09:20:00,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 09:20:00,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:20:00,817 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 27 proven. 266 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2018-12-02 09:20:00,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:20:00,904 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 4 proven. 54 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2018-12-02 09:20:00,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 09:20:00,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 27 [2018-12-02 09:20:00,919 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 09:20:00,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-02 09:20:00,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 09:20:00,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2018-12-02 09:20:00,920 INFO L87 Difference]: Start difference. First operand 213 states and 255 transitions. Second operand 20 states. [2018-12-02 09:20:01,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:20:01,406 INFO L93 Difference]: Finished difference Result 408 states and 499 transitions. [2018-12-02 09:20:01,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-02 09:20:01,406 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 81 [2018-12-02 09:20:01,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:20:01,407 INFO L225 Difference]: With dead ends: 408 [2018-12-02 09:20:01,407 INFO L226 Difference]: Without dead ends: 262 [2018-12-02 09:20:01,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=695, Invalid=2727, Unknown=0, NotChecked=0, Total=3422 [2018-12-02 09:20:01,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-12-02 09:20:01,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 237. [2018-12-02 09:20:01,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-12-02 09:20:01,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 283 transitions. [2018-12-02 09:20:01,415 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 283 transitions. Word has length 81 [2018-12-02 09:20:01,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:20:01,415 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 283 transitions. [2018-12-02 09:20:01,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-02 09:20:01,415 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 283 transitions. [2018-12-02 09:20:01,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 09:20:01,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:20:01,415 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 18, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:20:01,416 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:20:01,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:01,416 INFO L82 PathProgramCache]: Analyzing trace with hash -2112280670, now seen corresponding path program 3 times [2018-12-02 09:20:01,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:20:01,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:01,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 09:20:01,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:01,417 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:20:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:20:01,505 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 324 proven. 145 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-12-02 09:20:01,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:20:01,505 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:20:01,505 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 09:20:01,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 09:20:01,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:20:01,506 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cd2c5b5-505c-4b87-950b-61c731304119/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 09:20:01,511 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 09:20:01,511 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 09:20:01,520 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 09:20:01,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 09:20:01,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:20:01,603 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 452 proven. 39 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-12-02 09:20:01,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:20:01,691 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 451 proven. 40 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-12-02 09:20:01,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 09:20:01,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 35 [2018-12-02 09:20:01,706 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 09:20:01,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-02 09:20:01,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-02 09:20:01,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=900, Unknown=0, NotChecked=0, Total=1190 [2018-12-02 09:20:01,707 INFO L87 Difference]: Start difference. First operand 237 states and 283 transitions. Second operand 25 states. [2018-12-02 09:20:02,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:20:02,055 INFO L93 Difference]: Finished difference Result 550 states and 672 transitions. [2018-12-02 09:20:02,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-02 09:20:02,055 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 87 [2018-12-02 09:20:02,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:20:02,057 INFO L225 Difference]: With dead ends: 550 [2018-12-02 09:20:02,057 INFO L226 Difference]: Without dead ends: 386 [2018-12-02 09:20:02,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 152 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=842, Invalid=2464, Unknown=0, NotChecked=0, Total=3306 [2018-12-02 09:20:02,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-12-02 09:20:02,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 359. [2018-12-02 09:20:02,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-12-02 09:20:02,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 419 transitions. [2018-12-02 09:20:02,074 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 419 transitions. Word has length 87 [2018-12-02 09:20:02,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:20:02,074 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 419 transitions. [2018-12-02 09:20:02,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-02 09:20:02,075 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 419 transitions. [2018-12-02 09:20:02,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 09:20:02,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:20:02,076 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:20:02,076 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:20:02,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:02,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1247509462, now seen corresponding path program 1 times [2018-12-02 09:20:02,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:20:02,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:02,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 09:20:02,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:02,077 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:20:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:20:02,106 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2018-12-02 09:20:02,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:20:02,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:20:02,107 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:20:02,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:20:02,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:20:02,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:20:02,107 INFO L87 Difference]: Start difference. First operand 359 states and 419 transitions. Second operand 5 states. [2018-12-02 09:20:02,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:20:02,140 INFO L93 Difference]: Finished difference Result 423 states and 495 transitions. [2018-12-02 09:20:02,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:20:02,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-02 09:20:02,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:20:02,142 INFO L225 Difference]: With dead ends: 423 [2018-12-02 09:20:02,142 INFO L226 Difference]: Without dead ends: 369 [2018-12-02 09:20:02,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:20:02,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-12-02 09:20:02,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 351. [2018-12-02 09:20:02,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-12-02 09:20:02,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 407 transitions. [2018-12-02 09:20:02,154 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 407 transitions. Word has length 93 [2018-12-02 09:20:02,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:20:02,154 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 407 transitions. [2018-12-02 09:20:02,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:20:02,154 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 407 transitions. [2018-12-02 09:20:02,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 09:20:02,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:20:02,155 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 20, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:20:02,155 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:20:02,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:02,156 INFO L82 PathProgramCache]: Analyzing trace with hash 22777052, now seen corresponding path program 4 times [2018-12-02 09:20:02,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:20:02,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:02,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:20:02,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:02,156 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:20:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:20:02,241 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 389 proven. 176 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2018-12-02 09:20:02,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:20:02,242 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:20:02,242 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 09:20:02,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 09:20:02,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:20:02,242 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cd2c5b5-505c-4b87-950b-61c731304119/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 09:20:02,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:20:02,249 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 09:20:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:20:02,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:20:02,266 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 387 proven. 176 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-12-02 09:20:02,267 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:20:02,400 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 389 proven. 176 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2018-12-02 09:20:02,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 09:20:02,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2018-12-02 09:20:02,416 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 09:20:02,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 09:20:02,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 09:20:02,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-02 09:20:02,416 INFO L87 Difference]: Start difference. First operand 351 states and 407 transitions. Second operand 14 states. [2018-12-02 09:20:02,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:20:02,466 INFO L93 Difference]: Finished difference Result 682 states and 803 transitions. [2018-12-02 09:20:02,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 09:20:02,467 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 93 [2018-12-02 09:20:02,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:20:02,469 INFO L225 Difference]: With dead ends: 682 [2018-12-02 09:20:02,469 INFO L226 Difference]: Without dead ends: 415 [2018-12-02 09:20:02,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 175 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 09:20:02,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-12-02 09:20:02,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 384. [2018-12-02 09:20:02,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-12-02 09:20:02,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 445 transitions. [2018-12-02 09:20:02,488 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 445 transitions. Word has length 93 [2018-12-02 09:20:02,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:20:02,488 INFO L480 AbstractCegarLoop]: Abstraction has 384 states and 445 transitions. [2018-12-02 09:20:02,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 09:20:02,488 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 445 transitions. [2018-12-02 09:20:02,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 09:20:02,489 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:20:02,489 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 22, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:20:02,489 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:20:02,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:02,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1333160670, now seen corresponding path program 5 times [2018-12-02 09:20:02,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:20:02,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:02,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:20:02,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:02,491 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:20:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:20:02,566 INFO L134 CoverageAnalysis]: Checked inductivity of 883 backedges. 460 proven. 210 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2018-12-02 09:20:02,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:20:02,566 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:20:02,566 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 09:20:02,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 09:20:02,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:20:02,566 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cd2c5b5-505c-4b87-950b-61c731304119/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 09:20:02,573 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 09:20:02,573 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 09:20:02,582 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 09:20:02,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 09:20:02,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:20:02,661 INFO L134 CoverageAnalysis]: Checked inductivity of 883 backedges. 36 proven. 461 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2018-12-02 09:20:02,661 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:20:02,748 INFO L134 CoverageAnalysis]: Checked inductivity of 883 backedges. 5 proven. 71 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-12-02 09:20:02,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 09:20:02,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 8] total 29 [2018-12-02 09:20:02,763 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 09:20:02,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-02 09:20:02,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-02 09:20:02,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-12-02 09:20:02,764 INFO L87 Difference]: Start difference. First operand 384 states and 445 transitions. Second operand 23 states. [2018-12-02 09:20:03,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:20:03,204 INFO L93 Difference]: Finished difference Result 812 states and 958 transitions. [2018-12-02 09:20:03,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-02 09:20:03,204 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 99 [2018-12-02 09:20:03,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:20:03,206 INFO L225 Difference]: With dead ends: 812 [2018-12-02 09:20:03,206 INFO L226 Difference]: Without dead ends: 521 [2018-12-02 09:20:03,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=708, Invalid=2372, Unknown=0, NotChecked=0, Total=3080 [2018-12-02 09:20:03,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2018-12-02 09:20:03,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 467. [2018-12-02 09:20:03,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-12-02 09:20:03,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 541 transitions. [2018-12-02 09:20:03,228 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 541 transitions. Word has length 99 [2018-12-02 09:20:03,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:20:03,229 INFO L480 AbstractCegarLoop]: Abstraction has 467 states and 541 transitions. [2018-12-02 09:20:03,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-02 09:20:03,229 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 541 transitions. [2018-12-02 09:20:03,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-02 09:20:03,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:20:03,230 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 25, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:20:03,230 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:20:03,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:03,230 INFO L82 PathProgramCache]: Analyzing trace with hash 330612167, now seen corresponding path program 1 times [2018-12-02 09:20:03,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:20:03,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:03,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 09:20:03,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:03,231 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:20:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:20:03,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 577 proven. 247 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2018-12-02 09:20:03,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:20:03,312 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:20:03,312 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 109 with the following transitions: [2018-12-02 09:20:03,312 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [17], [23], [25], [28], [30], [32], [38], [46], [53], [56], [58], [61], [63], [64], [65], [66], [68], [69], [70], [71] [2018-12-02 09:20:03,313 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 09:20:03,313 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 09:20:03,330 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 09:20:03,330 INFO L272 AbstractInterpreter]: Visited 25 different actions 59 times. Merged at 9 different actions 20 times. Widened at 1 different actions 1 times. Performed 195 root evaluator evaluations with a maximum evaluation depth of 6. Performed 195 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 9 fixpoints after 5 different actions. Largest state had 8 variables. [2018-12-02 09:20:03,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:03,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 09:20:03,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:20:03,331 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cd2c5b5-505c-4b87-950b-61c731304119/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 09:20:03,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:20:03,338 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 09:20:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:20:03,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:20:03,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 575 proven. 247 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2018-12-02 09:20:03,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:20:03,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 577 proven. 247 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2018-12-02 09:20:03,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 09:20:03,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2018-12-02 09:20:03,574 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 09:20:03,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 09:20:03,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 09:20:03,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-02 09:20:03,575 INFO L87 Difference]: Start difference. First operand 467 states and 541 transitions. Second operand 16 states. [2018-12-02 09:20:03,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:20:03,633 INFO L93 Difference]: Finished difference Result 907 states and 1063 transitions. [2018-12-02 09:20:03,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 09:20:03,633 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2018-12-02 09:20:03,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:20:03,634 INFO L225 Difference]: With dead ends: 907 [2018-12-02 09:20:03,634 INFO L226 Difference]: Without dead ends: 542 [2018-12-02 09:20:03,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 203 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 09:20:03,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-12-02 09:20:03,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 497. [2018-12-02 09:20:03,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-12-02 09:20:03,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 576 transitions. [2018-12-02 09:20:03,647 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 576 transitions. Word has length 108 [2018-12-02 09:20:03,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:20:03,648 INFO L480 AbstractCegarLoop]: Abstraction has 497 states and 576 transitions. [2018-12-02 09:20:03,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 09:20:03,648 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 576 transitions. [2018-12-02 09:20:03,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 09:20:03,648 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:20:03,649 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 26, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:20:03,649 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:20:03,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:03,649 INFO L82 PathProgramCache]: Analyzing trace with hash -47569120, now seen corresponding path program 2 times [2018-12-02 09:20:03,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:20:03,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:03,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:20:03,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:03,649 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:20:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:20:03,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 620 proven. 287 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2018-12-02 09:20:03,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:20:03,764 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:20:03,764 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 09:20:03,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 09:20:03,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:20:03,764 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cd2c5b5-505c-4b87-950b-61c731304119/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 09:20:03,772 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 09:20:03,772 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 09:20:03,782 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-02 09:20:03,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 09:20:03,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:20:03,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 1 proven. 622 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2018-12-02 09:20:03,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:20:03,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 620 proven. 3 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2018-12-02 09:20:03,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 09:20:03,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 8] total 30 [2018-12-02 09:20:03,985 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 09:20:03,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-02 09:20:03,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-02 09:20:03,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=683, Unknown=0, NotChecked=0, Total=870 [2018-12-02 09:20:03,985 INFO L87 Difference]: Start difference. First operand 497 states and 576 transitions. Second operand 25 states. [2018-12-02 09:20:04,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:20:04,474 INFO L93 Difference]: Finished difference Result 963 states and 1132 transitions. [2018-12-02 09:20:04,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-02 09:20:04,475 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 111 [2018-12-02 09:20:04,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:20:04,476 INFO L225 Difference]: With dead ends: 963 [2018-12-02 09:20:04,476 INFO L226 Difference]: Without dead ends: 577 [2018-12-02 09:20:04,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 210 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=794, Invalid=3112, Unknown=0, NotChecked=0, Total=3906 [2018-12-02 09:20:04,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2018-12-02 09:20:04,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 528. [2018-12-02 09:20:04,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-12-02 09:20:04,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 604 transitions. [2018-12-02 09:20:04,505 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 604 transitions. Word has length 111 [2018-12-02 09:20:04,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:20:04,505 INFO L480 AbstractCegarLoop]: Abstraction has 528 states and 604 transitions. [2018-12-02 09:20:04,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-02 09:20:04,505 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 604 transitions. [2018-12-02 09:20:04,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-02 09:20:04,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:20:04,506 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 42, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:20:04,506 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:20:04,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:04,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1656541615, now seen corresponding path program 3 times [2018-12-02 09:20:04,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:20:04,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:04,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 09:20:04,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:04,507 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:20:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:20:04,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3128 backedges. 1418 proven. 330 refuted. 0 times theorem prover too weak. 1380 trivial. 0 not checked. [2018-12-02 09:20:04,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:20:04,606 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:20:04,607 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 09:20:04,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 09:20:04,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:20:04,607 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cd2c5b5-505c-4b87-950b-61c731304119/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 09:20:04,612 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 09:20:04,612 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 09:20:04,630 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 09:20:04,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 09:20:04,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:20:04,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3128 backedges. 1414 proven. 330 refuted. 0 times theorem prover too weak. 1384 trivial. 0 not checked. [2018-12-02 09:20:04,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:20:04,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3128 backedges. 1418 proven. 330 refuted. 0 times theorem prover too weak. 1380 trivial. 0 not checked. [2018-12-02 09:20:04,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 09:20:04,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2018-12-02 09:20:04,856 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 09:20:04,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 09:20:04,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 09:20:04,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-02 09:20:04,857 INFO L87 Difference]: Start difference. First operand 528 states and 604 transitions. Second operand 18 states. [2018-12-02 09:20:04,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:20:04,929 INFO L93 Difference]: Finished difference Result 1000 states and 1157 transitions. [2018-12-02 09:20:04,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 09:20:04,929 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 171 [2018-12-02 09:20:04,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:20:04,931 INFO L225 Difference]: With dead ends: 1000 [2018-12-02 09:20:04,931 INFO L226 Difference]: Without dead ends: 592 [2018-12-02 09:20:04,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 327 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 09:20:04,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-12-02 09:20:04,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 561. [2018-12-02 09:20:04,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2018-12-02 09:20:04,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 642 transitions. [2018-12-02 09:20:04,950 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 642 transitions. Word has length 171 [2018-12-02 09:20:04,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:20:04,950 INFO L480 AbstractCegarLoop]: Abstraction has 561 states and 642 transitions. [2018-12-02 09:20:04,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 09:20:04,951 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 642 transitions. [2018-12-02 09:20:04,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-02 09:20:04,952 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:20:04,952 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 45, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:20:04,952 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:20:04,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:04,952 INFO L82 PathProgramCache]: Analyzing trace with hash -445867610, now seen corresponding path program 4 times [2018-12-02 09:20:04,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:20:04,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:04,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 09:20:04,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:04,953 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:20:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:20:05,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3551 backedges. 1608 proven. 376 refuted. 0 times theorem prover too weak. 1567 trivial. 0 not checked. [2018-12-02 09:20:05,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:20:05,085 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:20:05,086 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 09:20:05,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 09:20:05,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:20:05,086 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cd2c5b5-505c-4b87-950b-61c731304119/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 09:20:05,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:20:05,091 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 09:20:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:20:05,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:20:05,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3551 backedges. 1604 proven. 376 refuted. 0 times theorem prover too weak. 1571 trivial. 0 not checked. [2018-12-02 09:20:05,124 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:20:05,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3551 backedges. 1608 proven. 376 refuted. 0 times theorem prover too weak. 1567 trivial. 0 not checked. [2018-12-02 09:20:05,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 09:20:05,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2018-12-02 09:20:05,374 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 09:20:05,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 09:20:05,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 09:20:05,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-02 09:20:05,374 INFO L87 Difference]: Start difference. First operand 561 states and 642 transitions. Second operand 19 states. [2018-12-02 09:20:05,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:20:05,429 INFO L93 Difference]: Finished difference Result 1057 states and 1223 transitions. [2018-12-02 09:20:05,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 09:20:05,430 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 180 [2018-12-02 09:20:05,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:20:05,431 INFO L225 Difference]: With dead ends: 1057 [2018-12-02 09:20:05,431 INFO L226 Difference]: Without dead ends: 625 [2018-12-02 09:20:05,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 344 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 09:20:05,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-12-02 09:20:05,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 594. [2018-12-02 09:20:05,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2018-12-02 09:20:05,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 680 transitions. [2018-12-02 09:20:05,446 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 680 transitions. Word has length 180 [2018-12-02 09:20:05,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:20:05,446 INFO L480 AbstractCegarLoop]: Abstraction has 594 states and 680 transitions. [2018-12-02 09:20:05,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 09:20:05,446 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 680 transitions. [2018-12-02 09:20:05,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-02 09:20:05,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:20:05,448 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 48, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:20:05,448 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:20:05,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:05,448 INFO L82 PathProgramCache]: Analyzing trace with hash 685288945, now seen corresponding path program 5 times [2018-12-02 09:20:05,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:20:05,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:05,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:20:05,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:05,449 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:20:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:20:05,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4001 backedges. 1810 proven. 425 refuted. 0 times theorem prover too weak. 1766 trivial. 0 not checked. [2018-12-02 09:20:05,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:20:05,566 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:20:05,566 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 09:20:05,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 09:20:05,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:20:05,566 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cd2c5b5-505c-4b87-950b-61c731304119/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 09:20:05,572 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 09:20:05,573 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 09:20:05,584 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 09:20:05,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 09:20:05,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:20:05,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4001 backedges. 1867 proven. 1 refuted. 0 times theorem prover too weak. 2133 trivial. 0 not checked. [2018-12-02 09:20:05,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:20:05,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4001 backedges. 1818 proven. 50 refuted. 0 times theorem prover too weak. 2133 trivial. 0 not checked. [2018-12-02 09:20:05,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 09:20:05,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 9] total 32 [2018-12-02 09:20:05,782 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 09:20:05,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-02 09:20:05,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-02 09:20:05,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=727, Unknown=0, NotChecked=0, Total=992 [2018-12-02 09:20:05,783 INFO L87 Difference]: Start difference. First operand 594 states and 680 transitions. Second operand 28 states. [2018-12-02 09:20:06,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:20:06,095 INFO L93 Difference]: Finished difference Result 1126 states and 1316 transitions. [2018-12-02 09:20:06,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-02 09:20:06,096 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 189 [2018-12-02 09:20:06,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:20:06,096 INFO L225 Difference]: With dead ends: 1126 [2018-12-02 09:20:06,096 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 09:20:06,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 366 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2018-12-02 09:20:06,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 09:20:06,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 09:20:06,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 09:20:06,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 09:20:06,098 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 189 [2018-12-02 09:20:06,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:20:06,098 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 09:20:06,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-02 09:20:06,098 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 09:20:06,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 09:20:06,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 09:20:06,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 09:20:06,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 09:20:06,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 09:20:06,310 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 437 DAG size of output: 176 [2018-12-02 09:20:06,848 WARN L180 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 61 [2018-12-02 09:20:06,859 INFO L448 ceAbstractionStarter]: For program point nondetFINAL(lines 15 19) no Hoare annotation was computed. [2018-12-02 09:20:06,860 INFO L451 ceAbstractionStarter]: At program point nondetENTRY(lines 15 19) the Hoare annotation is: true [2018-12-02 09:20:06,860 INFO L448 ceAbstractionStarter]: For program point nondetEXIT(lines 15 19) no Hoare annotation was computed. [2018-12-02 09:20:06,860 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-02 09:20:06,860 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-12-02 09:20:06,860 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 09:20:06,860 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 09:20:06,860 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 09:20:06,860 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 09:20:06,860 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 09:20:06,860 INFO L444 ceAbstractionStarter]: At program point L33(lines 24 34) the Hoare annotation is: (or (and (= main_~b~0 0) (= main_~c~0 0) (= main_~a~0 0)) (and (= main_~b~0 main_~a~0) (<= 200000 main_~c~0) (<= main_~c~0 200000))) [2018-12-02 09:20:06,860 INFO L444 ceAbstractionStarter]: At program point L31-1(lines 31 32) the Hoare annotation is: (and (= main_~b~0 main_~a~0) (<= 200000 main_~c~0) (<= main_~c~0 200000)) [2018-12-02 09:20:06,860 INFO L448 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-12-02 09:20:06,860 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 21 35) no Hoare annotation was computed. [2018-12-02 09:20:06,860 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 21 35) the Hoare annotation is: true [2018-12-02 09:20:06,860 INFO L448 ceAbstractionStarter]: For program point L28-1(lines 24 34) no Hoare annotation was computed. [2018-12-02 09:20:06,860 INFO L448 ceAbstractionStarter]: For program point L26-2(lines 26 27) no Hoare annotation was computed. [2018-12-02 09:20:06,860 INFO L444 ceAbstractionStarter]: At program point L26-3(lines 26 27) the Hoare annotation is: (let ((.cse9 (<= main_~c~0 1)) (.cse10 (<= 1 main_~c~0)) (.cse4 (<= main_~c~0 3)) (.cse6 (<= 3 main_~c~0)) (.cse13 (<= 8 main_~c~0)) (.cse14 (<= main_~c~0 8)) (.cse1 (<= 7 main_~c~0)) (.cse0 (<= main_~c~0 7)) (.cse15 (<= main_~c~0 5)) (.cse16 (<= 5 main_~c~0)) (.cse19 (<= main_~c~0 6)) (.cse20 (<= 6 main_~c~0)) (.cse17 (<= main_~c~0 4)) (.cse18 (<= 4 main_~c~0)) (.cse11 (<= main_~c~0 200000)) (.cse12 (<= 9 main_~c~0)) (.cse3 (not (= main_~st~0 0))) (.cse7 (<= 2 main_~c~0)) (.cse2 (= main_~b~0 main_~a~0)) (.cse5 (<= (+ ~last~0 1) main_~c~0)) (.cse8 (<= main_~c~0 2))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2 .cse5 .cse6) (and .cse7 .cse2 .cse8 .cse3) (and .cse2 (<= main_~c~0 0) (<= 0 main_~c~0) .cse3) (and .cse9 .cse2 .cse10 .cse3) (and .cse9 .cse2 .cse5 .cse10) (and .cse2 .cse5 .cse11 .cse12) (and .cse4 .cse2 .cse6 .cse3) (and .cse13 .cse2 .cse5 .cse14) (and .cse2 .cse15 .cse3 .cse16) (and .cse13 .cse2 .cse14 .cse3) (and .cse2 .cse17 .cse18 .cse3) (and .cse1 .cse0 .cse2 .cse5) (and .cse19 .cse2 .cse5 .cse20) (and .cse2 .cse15 .cse5 .cse16) (and .cse19 .cse2 .cse3 .cse20) (and .cse2 .cse5 .cse17 .cse18) (and .cse2 .cse11 .cse12 .cse3) (and .cse7 .cse2 .cse5 .cse8))) [2018-12-02 09:20:06,861 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-12-02 09:20:06,861 INFO L448 ceAbstractionStarter]: For program point L26-4(lines 24 34) no Hoare annotation was computed. [2018-12-02 09:20:06,861 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 21 35) no Hoare annotation was computed. [2018-12-02 09:20:06,861 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2018-12-02 09:20:06,861 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2018-12-02 09:20:06,861 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 8 13) no Hoare annotation was computed. [2018-12-02 09:20:06,861 INFO L448 ceAbstractionStarter]: For program point L9(lines 9 11) no Hoare annotation was computed. [2018-12-02 09:20:06,861 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-12-02 09:20:06,861 INFO L448 ceAbstractionStarter]: For program point L9-2(lines 8 13) no Hoare annotation was computed. [2018-12-02 09:20:06,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 09:20:06 BoogieIcfgContainer [2018-12-02 09:20:06,871 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 09:20:06,872 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 09:20:06,872 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 09:20:06,872 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 09:20:06,872 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:19:57" (3/4) ... [2018-12-02 09:20:06,875 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 09:20:06,880 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet [2018-12-02 09:20:06,880 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 09:20:06,880 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 09:20:06,881 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-12-02 09:20:06,883 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-12-02 09:20:06,883 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-02 09:20:06,917 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8cd2c5b5-505c-4b87-950b-61c731304119/bin-2019/utaipan/witness.graphml [2018-12-02 09:20:06,917 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 09:20:06,918 INFO L168 Benchmark]: Toolchain (without parser) took 10079.66 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 293.1 MB). Free memory was 953.6 MB in the beginning and 944.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 302.4 MB. Max. memory is 11.5 GB. [2018-12-02 09:20:06,919 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 973.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 09:20:06,919 INFO L168 Benchmark]: CACSL2BoogieTranslator took 140.10 ms. Allocated memory is still 1.0 GB. Free memory was 953.6 MB in the beginning and 942.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 09:20:06,919 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.48 ms. Allocated memory is still 1.0 GB. Free memory is still 942.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 09:20:06,919 INFO L168 Benchmark]: Boogie Preprocessor took 44.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 942.9 MB in the beginning and 1.1 GB in the end (delta: -148.9 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2018-12-02 09:20:06,920 INFO L168 Benchmark]: RCFGBuilder took 123.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-12-02 09:20:06,920 INFO L168 Benchmark]: TraceAbstraction took 9710.54 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 196.6 MB). Free memory was 1.1 GB in the beginning and 944.3 MB in the end (delta: 133.2 MB). Peak memory consumption was 329.8 MB. Max. memory is 11.5 GB. [2018-12-02 09:20:06,920 INFO L168 Benchmark]: Witness Printer took 45.62 ms. Allocated memory is still 1.3 GB. Free memory is still 944.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 09:20:06,922 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 973.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 140.10 ms. Allocated memory is still 1.0 GB. Free memory was 953.6 MB in the beginning and 942.9 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 12.48 ms. Allocated memory is still 1.0 GB. Free memory is still 942.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 942.9 MB in the beginning and 1.1 GB in the end (delta: -148.9 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 123.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9710.54 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 196.6 MB). Free memory was 1.1 GB in the beginning and 944.3 MB in the end (delta: 133.2 MB). Peak memory consumption was 329.8 MB. Max. memory is 11.5 GB. * Witness Printer took 45.62 ms. Allocated memory is still 1.3 GB. Free memory is still 944.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: 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: 24]: Loop Invariant Derived loop invariant: ((b == 0 && c == 0) && a == 0) || ((b == a && 200000 <= c) && c <= 200000) - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c <= 7 && 7 <= c) && b == a) && !(st == 0)) || (((c <= 3 && b == a) && last + 1 <= c) && 3 <= c)) || (((2 <= c && b == a) && c <= 2) && !(st == 0))) || (((b == a && c <= 0) && 0 <= c) && !(st == 0))) || (((c <= 1 && b == a) && 1 <= c) && !(st == 0))) || (((c <= 1 && b == a) && last + 1 <= c) && 1 <= c)) || (((b == a && last + 1 <= c) && c <= 200000) && 9 <= c)) || (((c <= 3 && b == a) && 3 <= c) && !(st == 0))) || (((8 <= c && b == a) && last + 1 <= c) && c <= 8)) || (((b == a && c <= 5) && !(st == 0)) && 5 <= c)) || (((8 <= c && b == a) && c <= 8) && !(st == 0))) || (((b == a && c <= 4) && 4 <= c) && !(st == 0))) || (((7 <= c && c <= 7) && b == a) && last + 1 <= c)) || (((c <= 6 && b == a) && last + 1 <= c) && 6 <= c)) || (((b == a && c <= 5) && last + 1 <= c) && 5 <= c)) || (((c <= 6 && b == a) && !(st == 0)) && 6 <= c)) || (((b == a && last + 1 <= c) && c <= 4) && 4 <= c)) || (((b == a && c <= 200000) && 9 <= c) && !(st == 0))) || (((2 <= c && b == a) && last + 1 <= c) && c <= 2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 27 locations, 1 error locations. SAFE Result, 9.6s OverallTime, 28 OverallIterations, 51 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 660 SDtfs, 1116 SDslu, 2868 SDs, 0 SdLazy, 3296 SolverSat, 205 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 3609 GetRequests, 3020 SyntacticMatches, 8 SemanticMatches, 581 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3927 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=594occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 10 AbstIntIterations, 3 AbstIntStrong, 0.7661111111111112 AbsIntWeakeningRatio, 0.7166666666666667 AbsIntAvgWeakeningVarsNumRemoved, 0.6 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 472 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 96 PreInvPairs, 320 NumberOfFragments, 313 HoareAnnotationTreeSize, 96 FomulaSimplifications, 7038 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 9 FomulaSimplificationsInter, 2361 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 3378 NumberOfCodeBlocks, 2954 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 4889 ConstructedInterpolants, 0 QuantifiedInterpolants, 1124997 SizeOfPredicates, 61 NumberOfNonLiveVariables, 2452 ConjunctsInSsa, 276 ConjunctsInUnsatCore, 70 InterpolantComputations, 10 PerfectInterpolantSequences, 44072/51287 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...