java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loop-lit/gj2007_true-unreach-call.c.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 20:41:49,518 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 20:41:49,520 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 20:41:49,531 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 20:41:49,532 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 20:41:49,533 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 20:41:49,534 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 20:41:49,536 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 20:41:49,538 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 20:41:49,538 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 20:41:49,539 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 20:41:49,540 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 20:41:49,540 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 20:41:49,541 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 20:41:49,543 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 20:41:49,543 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 20:41:49,544 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 20:41:49,546 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 20:41:49,548 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 20:41:49,550 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 20:41:49,551 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 20:41:49,552 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 20:41:49,554 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 20:41:49,554 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 20:41:49,555 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 20:41:49,556 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 20:41:49,557 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 20:41:49,557 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 20:41:49,558 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 20:41:49,559 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 20:41:49,560 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 20:41:49,560 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 20:41:49,560 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 20:41:49,561 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 20:41:49,562 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 20:41:49,562 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 20:41:49,563 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 20:41:49,578 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 20:41:49,578 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 20:41:49,579 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 20:41:49,579 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 20:41:49,579 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 20:41:49,579 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 20:41:49,580 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 20:41:49,580 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 20:41:49,580 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 20:41:49,580 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 20:41:49,580 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 20:41:49,581 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 20:41:49,581 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 20:41:49,581 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 20:41:49,582 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 20:41:49,582 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 20:41:49,582 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 20:41:49,582 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 20:41:49,582 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 20:41:49,583 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 20:41:49,583 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 20:41:49,583 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 20:41:49,583 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 20:41:49,583 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 20:41:49,583 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 20:41:49,584 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:41:49,584 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 20:41:49,584 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 20:41:49,584 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 20:41:49,584 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 20:41:49,585 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 20:41:49,585 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 20:41:49,585 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 20:41:49,585 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 20:41:49,585 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 20:41:49,627 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 20:41:49,641 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 20:41:49,644 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 20:41:49,646 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 20:41:49,646 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 20:41:49,647 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007_true-unreach-call.c.i.p+lhb-reducer.c [2018-11-12 20:41:49,702 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fbe04bf2/042945d60f0f49afb54b0d284174f407/FLAG2a96d00f0 [2018-11-12 20:41:50,118 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 20:41:50,118 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007_true-unreach-call.c.i.p+lhb-reducer.c [2018-11-12 20:41:50,127 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fbe04bf2/042945d60f0f49afb54b0d284174f407/FLAG2a96d00f0 [2018-11-12 20:41:50,142 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fbe04bf2/042945d60f0f49afb54b0d284174f407 [2018-11-12 20:41:50,152 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 20:41:50,153 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 20:41:50,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 20:41:50,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 20:41:50,158 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 20:41:50,159 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:41:50" (1/1) ... [2018-11-12 20:41:50,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ad3d09e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:41:50, skipping insertion in model container [2018-11-12 20:41:50,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:41:50" (1/1) ... [2018-11-12 20:41:50,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 20:41:50,197 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 20:41:50,399 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:41:50,404 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 20:41:50,433 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:41:50,451 INFO L193 MainTranslator]: Completed translation [2018-11-12 20:41:50,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:41:50 WrapperNode [2018-11-12 20:41:50,452 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 20:41:50,452 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 20:41:50,453 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 20:41:50,453 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 20:41:50,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:41:50" (1/1) ... [2018-11-12 20:41:50,469 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:41:50" (1/1) ... [2018-11-12 20:41:50,475 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 20:41:50,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 20:41:50,476 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 20:41:50,476 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 20:41:50,486 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:41:50" (1/1) ... [2018-11-12 20:41:50,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:41:50" (1/1) ... [2018-11-12 20:41:50,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:41:50" (1/1) ... [2018-11-12 20:41:50,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:41:50" (1/1) ... [2018-11-12 20:41:50,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:41:50" (1/1) ... [2018-11-12 20:41:50,497 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:41:50" (1/1) ... [2018-11-12 20:41:50,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:41:50" (1/1) ... [2018-11-12 20:41:50,501 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 20:41:50,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 20:41:50,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 20:41:50,502 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 20:41:50,502 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:41:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-12 20:41:50,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 20:41:50,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 20:41:50,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 20:41:50,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 20:41:50,643 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 20:41:50,643 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 20:41:51,135 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 20:41:51,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:41:51 BoogieIcfgContainer [2018-11-12 20:41:51,136 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 20:41:51,137 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 20:41:51,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 20:41:51,140 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 20:41:51,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:41:50" (1/3) ... [2018-11-12 20:41:51,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b9e035 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:41:51, skipping insertion in model container [2018-11-12 20:41:51,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:41:50" (2/3) ... [2018-11-12 20:41:51,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b9e035 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:41:51, skipping insertion in model container [2018-11-12 20:41:51,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:41:51" (3/3) ... [2018-11-12 20:41:51,144 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007_true-unreach-call.c.i.p+lhb-reducer.c [2018-11-12 20:41:51,153 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 20:41:51,161 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 20:41:51,174 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 20:41:51,207 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 20:41:51,208 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 20:41:51,208 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 20:41:51,208 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 20:41:51,208 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 20:41:51,208 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 20:41:51,209 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 20:41:51,209 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 20:41:51,228 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-12 20:41:51,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-12 20:41:51,235 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:51,236 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:51,239 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:51,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:51,245 INFO L82 PathProgramCache]: Analyzing trace with hash -535062244, now seen corresponding path program 1 times [2018-11-12 20:41:51,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:51,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:51,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:51,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:51,297 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:51,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:41:51,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:41:51,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 20:41:51,446 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:41:51,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 20:41:51,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 20:41:51,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:41:51,468 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2018-11-12 20:41:52,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:52,011 INFO L93 Difference]: Finished difference Result 74 states and 128 transitions. [2018-11-12 20:41:52,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 20:41:52,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-12 20:41:52,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:52,025 INFO L225 Difference]: With dead ends: 74 [2018-11-12 20:41:52,026 INFO L226 Difference]: Without dead ends: 47 [2018-11-12 20:41:52,029 INFO L604 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-11-12 20:41:52,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-12 20:41:52,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-12 20:41:52,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-12 20:41:52,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2018-11-12 20:41:52,077 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 27 [2018-11-12 20:41:52,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:52,078 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2018-11-12 20:41:52,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 20:41:52,078 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2018-11-12 20:41:52,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-12 20:41:52,079 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:52,080 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:52,080 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:52,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:52,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1447563500, now seen corresponding path program 1 times [2018-11-12 20:41:52,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:52,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:52,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:52,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:52,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:52,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:41:52,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:41:52,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 20:41:52,350 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:41:52,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 20:41:52,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 20:41:52,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-12 20:41:52,353 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand 5 states. [2018-11-12 20:41:52,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:52,618 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2018-11-12 20:41:52,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-12 20:41:52,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-12 20:41:52,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:52,622 INFO L225 Difference]: With dead ends: 62 [2018-11-12 20:41:52,622 INFO L226 Difference]: Without dead ends: 41 [2018-11-12 20:41:52,624 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-12 20:41:52,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-12 20:41:52,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-12 20:41:52,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-12 20:41:52,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-11-12 20:41:52,632 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 27 [2018-11-12 20:41:52,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:52,632 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-12 20:41:52,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 20:41:52,633 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-12 20:41:52,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-12 20:41:52,634 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:52,634 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:52,634 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:52,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:52,635 INFO L82 PathProgramCache]: Analyzing trace with hash -646102720, now seen corresponding path program 1 times [2018-11-12 20:41:52,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:52,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:52,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:52,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:52,637 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:52,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:41:52,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:41:52,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-12 20:41:52,749 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:41:52,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 20:41:52,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 20:41:52,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:41:52,750 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 7 states. [2018-11-12 20:41:53,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:53,118 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-12 20:41:53,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:41:53,119 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-12 20:41:53,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:53,120 INFO L225 Difference]: With dead ends: 52 [2018-11-12 20:41:53,121 INFO L226 Difference]: Without dead ends: 37 [2018-11-12 20:41:53,121 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:41:53,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-12 20:41:53,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-12 20:41:53,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-12 20:41:53,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2018-11-12 20:41:53,135 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 27 [2018-11-12 20:41:53,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:53,137 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-11-12 20:41:53,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 20:41:53,138 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2018-11-12 20:41:53,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-12 20:41:53,139 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:53,139 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:53,139 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:53,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:53,140 INFO L82 PathProgramCache]: Analyzing trace with hash 2117052275, now seen corresponding path program 1 times [2018-11-12 20:41:53,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:53,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:53,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:53,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:53,143 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:53,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:41:53,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:41:53,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-12 20:41:53,432 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:41:53,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 20:41:53,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 20:41:53,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:41:53,434 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 10 states. [2018-11-12 20:41:53,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:53,582 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-12 20:41:53,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-12 20:41:53,582 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-11-12 20:41:53,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:53,584 INFO L225 Difference]: With dead ends: 42 [2018-11-12 20:41:53,584 INFO L226 Difference]: Without dead ends: 31 [2018-11-12 20:41:53,585 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:41:53,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-12 20:41:53,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-12 20:41:53,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-12 20:41:53,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-11-12 20:41:53,591 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 27 [2018-11-12 20:41:53,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:53,592 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-12 20:41:53,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 20:41:53,592 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-12 20:41:53,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-12 20:41:53,593 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:53,593 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:53,593 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:53,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:53,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1286240867, now seen corresponding path program 1 times [2018-11-12 20:41:53,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:53,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:53,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:53,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:53,596 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:53,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:41:53,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:41:53,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 20:41:53,650 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:41:53,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 20:41:53,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 20:41:53,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:41:53,651 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 3 states. [2018-11-12 20:41:53,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:53,736 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-12 20:41:53,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 20:41:53,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-12 20:41:53,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:53,737 INFO L225 Difference]: With dead ends: 34 [2018-11-12 20:41:53,738 INFO L226 Difference]: Without dead ends: 31 [2018-11-12 20:41:53,738 INFO L604 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-11-12 20:41:53,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-12 20:41:53,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-12 20:41:53,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-12 20:41:53,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-12 20:41:53,744 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2018-11-12 20:41:53,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:53,745 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-12 20:41:53,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 20:41:53,745 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-12 20:41:53,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-12 20:41:53,746 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:53,746 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:53,747 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:53,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:53,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1286806896, now seen corresponding path program 1 times [2018-11-12 20:41:53,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:53,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:53,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:53,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:53,749 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:53,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:41:53,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:41:53,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-12 20:41:53,909 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:41:53,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 20:41:53,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 20:41:53,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:41:53,910 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 11 states. [2018-11-12 20:41:54,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:54,074 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-12 20:41:54,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-12 20:41:54,075 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-11-12 20:41:54,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:54,075 INFO L225 Difference]: With dead ends: 36 [2018-11-12 20:41:54,077 INFO L226 Difference]: Without dead ends: 31 [2018-11-12 20:41:54,078 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:41:54,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-12 20:41:54,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-12 20:41:54,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-12 20:41:54,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-11-12 20:41:54,083 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 27 [2018-11-12 20:41:54,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:54,084 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-11-12 20:41:54,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 20:41:54,084 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-12 20:41:54,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-12 20:41:54,085 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:54,085 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:54,086 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:54,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:54,086 INFO L82 PathProgramCache]: Analyzing trace with hash -880646403, now seen corresponding path program 1 times [2018-11-12 20:41:54,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:54,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:54,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:54,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:54,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:54,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:41:54,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:41:54,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-12 20:41:54,291 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:41:54,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 20:41:54,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 20:41:54,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-12 20:41:54,292 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 12 states. [2018-11-12 20:41:54,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:54,489 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-11-12 20:41:54,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-12 20:41:54,490 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-11-12 20:41:54,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:54,491 INFO L225 Difference]: With dead ends: 38 [2018-11-12 20:41:54,492 INFO L226 Difference]: Without dead ends: 33 [2018-11-12 20:41:54,493 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-12 20:41:54,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-12 20:41:54,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-12 20:41:54,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-12 20:41:54,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-12 20:41:54,498 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 29 [2018-11-12 20:41:54,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:54,499 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-12 20:41:54,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 20:41:54,499 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-12 20:41:54,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-12 20:41:54,500 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:54,500 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:54,500 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:54,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:54,501 INFO L82 PathProgramCache]: Analyzing trace with hash -286061766, now seen corresponding path program 1 times [2018-11-12 20:41:54,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:54,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:54,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:54,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:54,502 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:54,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:54,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:41:54,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:54,694 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:54,695 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-11-12 20:41:54,698 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [8], [11], [15], [18], [22], [25], [29], [32], [36], [39], [43], [46], [50], [53], [57], [60], [64], [67], [71], [74], [77], [79], [82], [83], [114], [115], [116] [2018-11-12 20:41:54,738 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:41:54,739 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:41:54,991 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:41:54,992 INFO L272 AbstractInterpreter]: Visited 30 different actions 60 times. Merged at 6 different actions 17 times. Widened at 2 different actions 3 times. Performed 217 root evaluator evaluations with a maximum evaluation depth of 5. Performed 217 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 4 fixpoints after 2 different actions. Largest state had 8 variables. [2018-11-12 20:41:55,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:55,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:41:55,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:55,014 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-12 20:41:55,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:55,029 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:41:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:55,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:55,087 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:41:55,087 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:55,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:41:55,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:55,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-11-12 20:41:55,533 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:55,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-12 20:41:55,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-12 20:41:55,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:41:55,535 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 13 states. [2018-11-12 20:41:55,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:55,675 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-12 20:41:55,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 20:41:55,676 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-11-12 20:41:55,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:55,678 INFO L225 Difference]: With dead ends: 40 [2018-11-12 20:41:55,678 INFO L226 Difference]: Without dead ends: 35 [2018-11-12 20:41:55,679 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:41:55,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-12 20:41:55,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-12 20:41:55,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-12 20:41:55,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-11-12 20:41:55,684 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 31 [2018-11-12 20:41:55,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:55,684 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-11-12 20:41:55,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-12 20:41:55,684 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-11-12 20:41:55,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-12 20:41:55,685 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:55,686 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:55,686 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:55,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:55,686 INFO L82 PathProgramCache]: Analyzing trace with hash -120875977, now seen corresponding path program 2 times [2018-11-12 20:41:55,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:55,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:55,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:55,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:55,688 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:56,016 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:41:56,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:56,016 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:56,016 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:56,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:56,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:56,017 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-12 20:41:56,029 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:41:56,029 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:41:56,061 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-12 20:41:56,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:56,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:56,497 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:41:56,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:57,407 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:41:57,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:57,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 38 [2018-11-12 20:41:57,428 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:57,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-12 20:41:57,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-12 20:41:57,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-12 20:41:57,431 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 26 states. [2018-11-12 20:41:57,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:57,804 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2018-11-12 20:41:57,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-12 20:41:57,804 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 33 [2018-11-12 20:41:57,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:57,806 INFO L225 Difference]: With dead ends: 64 [2018-11-12 20:41:57,807 INFO L226 Difference]: Without dead ends: 59 [2018-11-12 20:41:57,809 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-12 20:41:57,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-12 20:41:57,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-11-12 20:41:57,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-12 20:41:57,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-11-12 20:41:57,816 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 33 [2018-11-12 20:41:57,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:57,817 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-11-12 20:41:57,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-12 20:41:57,817 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-11-12 20:41:57,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-12 20:41:57,818 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:57,819 INFO L375 BasicCegarLoop]: trace histogram [15, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:57,819 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:57,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:57,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1917273006, now seen corresponding path program 3 times [2018-11-12 20:41:57,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:57,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:57,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:57,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:57,821 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:57,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:58,000 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 92 proven. 12 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-12 20:41:58,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:58,001 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:58,001 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:58,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:58,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:58,001 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-12 20:41:58,010 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:41:58,010 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:41:58,043 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:41:58,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:58,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:58,059 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 92 proven. 12 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-12 20:41:58,059 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:58,462 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 92 proven. 12 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-12 20:41:58,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:58,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2018-11-12 20:41:58,484 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:58,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-12 20:41:58,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-12 20:41:58,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-12 20:41:58,485 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 15 states. [2018-11-12 20:41:58,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:58,643 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2018-11-12 20:41:58,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-12 20:41:58,644 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2018-11-12 20:41:58,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:58,645 INFO L225 Difference]: With dead ends: 86 [2018-11-12 20:41:58,645 INFO L226 Difference]: Without dead ends: 60 [2018-11-12 20:41:58,646 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-12 20:41:58,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-12 20:41:58,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-12 20:41:58,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-12 20:41:58,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-11-12 20:41:58,654 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 57 [2018-11-12 20:41:58,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:58,655 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-11-12 20:41:58,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-12 20:41:58,655 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-12 20:41:58,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-12 20:41:58,656 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:58,656 INFO L375 BasicCegarLoop]: trace histogram [16, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:58,656 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:58,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:58,657 INFO L82 PathProgramCache]: Analyzing trace with hash 798282511, now seen corresponding path program 4 times [2018-11-12 20:41:58,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:58,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:58,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:58,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:58,658 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:58,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:58,890 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 115 proven. 20 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-12 20:41:58,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:58,890 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:58,890 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:58,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:58,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:58,891 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-12 20:41:58,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:58,901 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:41:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:58,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:58,996 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 115 proven. 20 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-12 20:41:58,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:59,684 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 115 proven. 20 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-12 20:41:59,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:59,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2018-11-12 20:41:59,705 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:59,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-12 20:41:59,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-12 20:41:59,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-12 20:41:59,706 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 16 states. [2018-11-12 20:41:59,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:59,898 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2018-11-12 20:41:59,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-12 20:41:59,899 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2018-11-12 20:41:59,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:59,900 INFO L225 Difference]: With dead ends: 88 [2018-11-12 20:41:59,900 INFO L226 Difference]: Without dead ends: 62 [2018-11-12 20:41:59,902 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-12 20:41:59,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-12 20:41:59,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-11-12 20:41:59,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-12 20:41:59,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2018-11-12 20:41:59,908 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 59 [2018-11-12 20:41:59,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:59,909 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2018-11-12 20:41:59,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-12 20:41:59,909 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2018-11-12 20:41:59,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-12 20:41:59,910 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:59,910 INFO L375 BasicCegarLoop]: trace histogram [17, 12, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:59,910 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:59,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:59,911 INFO L82 PathProgramCache]: Analyzing trace with hash -892981620, now seen corresponding path program 5 times [2018-11-12 20:41:59,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:59,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:59,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:59,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:59,912 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:59,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:00,126 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 138 proven. 30 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-12 20:42:00,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:00,127 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:00,127 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:00,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:00,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:00,127 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-12 20:42:00,137 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:42:00,137 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:42:00,172 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-11-12 20:42:00,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:00,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:00,188 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 138 proven. 30 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-12 20:42:00,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:00,516 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 138 proven. 30 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-12 20:42:00,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:00,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2018-11-12 20:42:00,538 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:00,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-12 20:42:00,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-12 20:42:00,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-12 20:42:00,539 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 17 states. [2018-11-12 20:42:00,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:00,884 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-11-12 20:42:00,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 20:42:00,885 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2018-11-12 20:42:00,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:00,886 INFO L225 Difference]: With dead ends: 90 [2018-11-12 20:42:00,886 INFO L226 Difference]: Without dead ends: 64 [2018-11-12 20:42:00,887 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-12 20:42:00,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-12 20:42:00,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-12 20:42:00,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-12 20:42:00,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-11-12 20:42:00,898 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 61 [2018-11-12 20:42:00,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:00,899 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-11-12 20:42:00,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-12 20:42:00,905 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-12 20:42:00,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-12 20:42:00,909 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:00,910 INFO L375 BasicCegarLoop]: trace histogram [18, 12, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:00,910 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:00,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:00,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1594793673, now seen corresponding path program 6 times [2018-11-12 20:42:00,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:00,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:00,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:00,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:00,914 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:01,545 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 161 proven. 42 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-12 20:42:01,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:01,546 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:01,546 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:01,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:01,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:01,546 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-12 20:42:01,558 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:01,559 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:01,596 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:01,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:01,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:01,629 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 161 proven. 42 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-12 20:42:01,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:02,166 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 161 proven. 42 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-12 20:42:02,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:02,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2018-11-12 20:42:02,190 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:02,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 20:42:02,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 20:42:02,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-12 20:42:02,191 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 18 states. [2018-11-12 20:42:02,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:02,458 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2018-11-12 20:42:02,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-12 20:42:02,458 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 63 [2018-11-12 20:42:02,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:02,459 INFO L225 Difference]: With dead ends: 92 [2018-11-12 20:42:02,459 INFO L226 Difference]: Without dead ends: 66 [2018-11-12 20:42:02,460 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-12 20:42:02,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-12 20:42:02,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-12 20:42:02,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-12 20:42:02,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2018-11-12 20:42:02,466 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 63 [2018-11-12 20:42:02,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:02,466 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2018-11-12 20:42:02,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 20:42:02,466 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-11-12 20:42:02,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-12 20:42:02,467 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:02,468 INFO L375 BasicCegarLoop]: trace histogram [19, 12, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:02,468 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:02,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:02,468 INFO L82 PathProgramCache]: Analyzing trace with hash 50066374, now seen corresponding path program 7 times [2018-11-12 20:42:02,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:02,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:02,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:02,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:02,469 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:02,798 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 184 proven. 56 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-12 20:42:02,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:02,799 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:02,799 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:02,799 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:02,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:02,799 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-12 20:42:02,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:02,808 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:02,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:02,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 184 proven. 56 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-12 20:42:02,856 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:03,363 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 184 proven. 56 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-12 20:42:03,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:03,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2018-11-12 20:42:03,383 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:03,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 20:42:03,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 20:42:03,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-12 20:42:03,385 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 19 states. [2018-11-12 20:42:03,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:03,957 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2018-11-12 20:42:03,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-12 20:42:03,957 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 65 [2018-11-12 20:42:03,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:03,961 INFO L225 Difference]: With dead ends: 94 [2018-11-12 20:42:03,961 INFO L226 Difference]: Without dead ends: 68 [2018-11-12 20:42:03,962 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-12 20:42:03,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-12 20:42:03,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-12 20:42:03,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-12 20:42:03,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2018-11-12 20:42:03,967 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 65 [2018-11-12 20:42:03,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:03,968 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2018-11-12 20:42:03,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 20:42:03,968 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2018-11-12 20:42:03,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-12 20:42:03,969 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:03,969 INFO L375 BasicCegarLoop]: trace histogram [20, 12, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:03,969 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:03,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:03,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1625816451, now seen corresponding path program 8 times [2018-11-12 20:42:03,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:03,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:03,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:03,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:03,971 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:04,391 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 207 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-12 20:42:04,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:04,392 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:04,392 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:04,392 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:04,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:04,392 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-12 20:42:04,401 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:42:04,402 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:42:04,437 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-11-12 20:42:04,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:04,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:04,451 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 207 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-12 20:42:04,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:05,351 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 207 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-12 20:42:05,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:05,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 38 [2018-11-12 20:42:05,371 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:05,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-12 20:42:05,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-12 20:42:05,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-12 20:42:05,373 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 20 states. [2018-11-12 20:42:05,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:05,522 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2018-11-12 20:42:05,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-12 20:42:05,524 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2018-11-12 20:42:05,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:05,525 INFO L225 Difference]: With dead ends: 96 [2018-11-12 20:42:05,525 INFO L226 Difference]: Without dead ends: 70 [2018-11-12 20:42:05,526 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-12 20:42:05,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-12 20:42:05,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-11-12 20:42:05,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-12 20:42:05,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-11-12 20:42:05,532 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 67 [2018-11-12 20:42:05,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:05,532 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-11-12 20:42:05,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-12 20:42:05,532 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-11-12 20:42:05,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-12 20:42:05,533 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:05,533 INFO L375 BasicCegarLoop]: trace histogram [21, 12, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:05,533 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:05,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:05,534 INFO L82 PathProgramCache]: Analyzing trace with hash -201815040, now seen corresponding path program 9 times [2018-11-12 20:42:05,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:05,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:05,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:05,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:05,535 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:05,885 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 230 proven. 90 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-12 20:42:05,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:05,886 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:05,886 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:05,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:05,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:05,887 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-12 20:42:05,911 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:05,912 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:05,933 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:05,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:05,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:05,950 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 230 proven. 90 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-12 20:42:05,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:06,776 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 230 proven. 90 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-12 20:42:06,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:06,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2018-11-12 20:42:06,798 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:06,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 20:42:06,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 20:42:06,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-12 20:42:06,803 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 21 states. [2018-11-12 20:42:06,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:06,927 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2018-11-12 20:42:06,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 20:42:06,928 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2018-11-12 20:42:06,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:06,929 INFO L225 Difference]: With dead ends: 98 [2018-11-12 20:42:06,929 INFO L226 Difference]: Without dead ends: 72 [2018-11-12 20:42:06,931 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-12 20:42:06,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-12 20:42:06,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-12 20:42:06,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-12 20:42:06,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-11-12 20:42:06,937 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 69 [2018-11-12 20:42:06,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:06,937 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-11-12 20:42:06,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 20:42:06,937 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-11-12 20:42:06,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-12 20:42:06,938 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:06,938 INFO L375 BasicCegarLoop]: trace histogram [22, 12, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:06,939 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:06,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:06,939 INFO L82 PathProgramCache]: Analyzing trace with hash 85946173, now seen corresponding path program 10 times [2018-11-12 20:42:06,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:06,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:06,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:06,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:06,940 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:07,243 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 110 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-12 20:42:07,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:07,243 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:07,243 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:07,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:07,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:07,244 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-12 20:42:07,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:07,255 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:07,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:07,293 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 110 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-12 20:42:07,293 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:08,218 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 110 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-12 20:42:08,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:08,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2018-11-12 20:42:08,239 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:08,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-12 20:42:08,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-12 20:42:08,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-12 20:42:08,241 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 22 states. [2018-11-12 20:42:08,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:08,397 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2018-11-12 20:42:08,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-12 20:42:08,397 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 71 [2018-11-12 20:42:08,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:08,398 INFO L225 Difference]: With dead ends: 100 [2018-11-12 20:42:08,399 INFO L226 Difference]: Without dead ends: 74 [2018-11-12 20:42:08,400 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-12 20:42:08,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-12 20:42:08,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-12 20:42:08,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-12 20:42:08,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2018-11-12 20:42:08,406 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 71 [2018-11-12 20:42:08,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:08,406 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2018-11-12 20:42:08,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-12 20:42:08,407 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2018-11-12 20:42:08,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-12 20:42:08,408 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:08,408 INFO L375 BasicCegarLoop]: trace histogram [23, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:08,408 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:08,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:08,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1746564922, now seen corresponding path program 11 times [2018-11-12 20:42:08,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:08,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:08,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:08,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:08,410 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:08,673 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 132 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-12 20:42:08,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:08,673 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:08,673 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:08,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:08,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:08,674 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-12 20:42:08,685 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:42:08,685 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:42:08,768 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-11-12 20:42:08,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:08,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:08,781 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 132 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-12 20:42:08,781 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:09,376 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 132 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-12 20:42:09,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:09,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 44 [2018-11-12 20:42:09,397 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:09,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-12 20:42:09,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-12 20:42:09,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-12 20:42:09,399 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 23 states. [2018-11-12 20:42:09,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:09,701 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2018-11-12 20:42:09,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 20:42:09,702 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 73 [2018-11-12 20:42:09,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:09,703 INFO L225 Difference]: With dead ends: 102 [2018-11-12 20:42:09,703 INFO L226 Difference]: Without dead ends: 76 [2018-11-12 20:42:09,704 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-12 20:42:09,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-12 20:42:09,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-11-12 20:42:09,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-12 20:42:09,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-11-12 20:42:09,709 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 73 [2018-11-12 20:42:09,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:09,710 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-11-12 20:42:09,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-12 20:42:09,710 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-11-12 20:42:09,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-12 20:42:09,711 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:09,711 INFO L375 BasicCegarLoop]: trace histogram [24, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:09,711 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:09,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:09,711 INFO L82 PathProgramCache]: Analyzing trace with hash -126651401, now seen corresponding path program 12 times [2018-11-12 20:42:09,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:09,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:09,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:09,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:09,713 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:10,034 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 299 proven. 156 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-12 20:42:10,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:10,034 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:10,034 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:10,034 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:10,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:10,034 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-12 20:42:10,043 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:10,043 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:10,079 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:10,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:10,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:10,093 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 299 proven. 156 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-12 20:42:10,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:10,763 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 299 proven. 156 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-12 20:42:10,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:10,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 46 [2018-11-12 20:42:10,783 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:10,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-12 20:42:10,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-12 20:42:10,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-12 20:42:10,785 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 24 states. [2018-11-12 20:42:10,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:10,943 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2018-11-12 20:42:10,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-12 20:42:10,943 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 75 [2018-11-12 20:42:10,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:10,944 INFO L225 Difference]: With dead ends: 104 [2018-11-12 20:42:10,944 INFO L226 Difference]: Without dead ends: 78 [2018-11-12 20:42:10,946 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-12 20:42:10,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-12 20:42:10,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-12 20:42:10,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-12 20:42:10,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-11-12 20:42:10,950 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 75 [2018-11-12 20:42:10,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:10,951 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-11-12 20:42:10,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-12 20:42:10,951 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-11-12 20:42:10,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-12 20:42:10,952 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:10,952 INFO L375 BasicCegarLoop]: trace histogram [25, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:10,952 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:10,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:10,953 INFO L82 PathProgramCache]: Analyzing trace with hash -696240780, now seen corresponding path program 13 times [2018-11-12 20:42:10,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:10,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:10,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:10,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:10,954 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:11,500 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 322 proven. 182 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-12 20:42:11,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:11,500 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:11,501 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:11,511 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:11,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:11,512 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-12 20:42:11,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:11,521 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:11,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:11,561 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 322 proven. 182 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-12 20:42:11,561 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:12,184 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 322 proven. 182 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-12 20:42:12,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:12,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2018-11-12 20:42:12,207 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:12,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-12 20:42:12,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-12 20:42:12,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-12 20:42:12,208 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 25 states. [2018-11-12 20:42:12,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:12,342 INFO L93 Difference]: Finished difference Result 106 states and 108 transitions. [2018-11-12 20:42:12,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-12 20:42:12,342 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2018-11-12 20:42:12,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:12,343 INFO L225 Difference]: With dead ends: 106 [2018-11-12 20:42:12,343 INFO L226 Difference]: Without dead ends: 80 [2018-11-12 20:42:12,344 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-12 20:42:12,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-12 20:42:12,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-11-12 20:42:12,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-12 20:42:12,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2018-11-12 20:42:12,349 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 77 [2018-11-12 20:42:12,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:12,349 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2018-11-12 20:42:12,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-12 20:42:12,349 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2018-11-12 20:42:12,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-12 20:42:12,350 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:12,350 INFO L375 BasicCegarLoop]: trace histogram [26, 14, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:12,350 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:12,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:12,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1684179889, now seen corresponding path program 14 times [2018-11-12 20:42:12,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:12,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:12,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:12,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:12,352 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:12,952 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 345 proven. 210 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-12 20:42:12,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:12,952 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:12,953 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:12,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:12,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:12,953 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-12 20:42:12,962 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:42:12,963 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:42:13,051 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-11-12 20:42:13,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:13,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:13,339 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 350 proven. 144 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-11-12 20:42:13,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:13,786 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 350 proven. 144 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-11-12 20:42:13,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:13,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 15, 15] total 52 [2018-11-12 20:42:13,807 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:13,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-12 20:42:13,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-12 20:42:13,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:42:13,809 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 39 states. [2018-11-12 20:42:14,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:14,028 INFO L93 Difference]: Finished difference Result 111 states and 114 transitions. [2018-11-12 20:42:14,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-12 20:42:14,028 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 79 [2018-11-12 20:42:14,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:14,029 INFO L225 Difference]: With dead ends: 111 [2018-11-12 20:42:14,030 INFO L226 Difference]: Without dead ends: 85 [2018-11-12 20:42:14,032 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:42:14,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-12 20:42:14,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-11-12 20:42:14,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-12 20:42:14,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2018-11-12 20:42:14,036 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 79 [2018-11-12 20:42:14,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:14,037 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-11-12 20:42:14,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-12 20:42:14,037 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-11-12 20:42:14,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-12 20:42:14,038 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:14,038 INFO L375 BasicCegarLoop]: trace histogram [28, 15, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:14,038 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:14,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:14,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1637764232, now seen corresponding path program 15 times [2018-11-12 20:42:14,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:14,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:14,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:14,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:14,039 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:14,420 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 400 proven. 240 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:42:14,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:14,420 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:14,420 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:14,420 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:14,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:14,421 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-12 20:42:14,429 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:14,429 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:14,455 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:14,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:14,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:14,470 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 400 proven. 240 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:42:14,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:15,168 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 400 proven. 240 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:42:15,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:15,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 52 [2018-11-12 20:42:15,188 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:15,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-12 20:42:15,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-12 20:42:15,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:42:15,190 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 27 states. [2018-11-12 20:42:15,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:15,371 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2018-11-12 20:42:15,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-12 20:42:15,374 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 83 [2018-11-12 20:42:15,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:15,375 INFO L225 Difference]: With dead ends: 114 [2018-11-12 20:42:15,375 INFO L226 Difference]: Without dead ends: 86 [2018-11-12 20:42:15,377 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:42:15,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-12 20:42:15,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-12 20:42:15,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-12 20:42:15,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2018-11-12 20:42:15,380 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 83 [2018-11-12 20:42:15,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:15,380 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2018-11-12 20:42:15,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-12 20:42:15,380 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2018-11-12 20:42:15,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-12 20:42:15,381 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:15,381 INFO L375 BasicCegarLoop]: trace histogram [29, 16, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:15,381 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:15,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:15,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1891909893, now seen corresponding path program 16 times [2018-11-12 20:42:15,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:15,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:15,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:15,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:15,382 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:15,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:15,733 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 425 proven. 272 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:42:15,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:15,734 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:15,734 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:15,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:15,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:15,734 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-12 20:42:15,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:15,759 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:15,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:15,800 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 425 proven. 272 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:42:15,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:16,834 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 425 proven. 272 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:42:16,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:16,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 52 [2018-11-12 20:42:16,867 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:16,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-12 20:42:16,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-12 20:42:16,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:42:16,869 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 28 states. [2018-11-12 20:42:17,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:17,105 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2018-11-12 20:42:17,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-12 20:42:17,105 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 85 [2018-11-12 20:42:17,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:17,106 INFO L225 Difference]: With dead ends: 116 [2018-11-12 20:42:17,106 INFO L226 Difference]: Without dead ends: 88 [2018-11-12 20:42:17,108 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 145 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:42:17,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-12 20:42:17,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-11-12 20:42:17,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-12 20:42:17,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2018-11-12 20:42:17,112 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 85 [2018-11-12 20:42:17,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:17,113 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2018-11-12 20:42:17,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-12 20:42:17,113 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2018-11-12 20:42:17,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-12 20:42:17,114 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:17,114 INFO L375 BasicCegarLoop]: trace histogram [30, 17, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:17,114 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:17,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:17,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1312754242, now seen corresponding path program 17 times [2018-11-12 20:42:17,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:17,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:17,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:17,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:17,115 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:17,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:17,566 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 450 proven. 306 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:42:17,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:17,567 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:17,567 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:17,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:17,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:17,567 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-12 20:42:17,579 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:42:17,579 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:42:17,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-11-12 20:42:17,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:17,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:18,238 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 459 proven. 169 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-11-12 20:42:18,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:18,699 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 459 proven. 169 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-11-12 20:42:18,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:18,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 16, 16] total 57 [2018-11-12 20:42:18,721 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:18,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-12 20:42:18,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-12 20:42:18,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-12 20:42:18,722 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 43 states. [2018-11-12 20:42:19,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:19,063 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2018-11-12 20:42:19,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-12 20:42:19,064 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 87 [2018-11-12 20:42:19,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:19,065 INFO L225 Difference]: With dead ends: 121 [2018-11-12 20:42:19,065 INFO L226 Difference]: Without dead ends: 93 [2018-11-12 20:42:19,066 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-12 20:42:19,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-12 20:42:19,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-11-12 20:42:19,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-12 20:42:19,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2018-11-12 20:42:19,072 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 87 [2018-11-12 20:42:19,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:19,072 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2018-11-12 20:42:19,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-12 20:42:19,073 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2018-11-12 20:42:19,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-12 20:42:19,073 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:19,073 INFO L375 BasicCegarLoop]: trace histogram [32, 18, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:19,074 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:19,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:19,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1585208793, now seen corresponding path program 18 times [2018-11-12 20:42:19,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:19,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:19,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:19,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:19,075 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:19,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 513 proven. 342 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-11-12 20:42:19,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:19,660 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:19,660 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:19,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:19,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:19,660 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-12 20:42:19,670 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:19,670 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:19,699 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:19,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:19,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:19,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 513 proven. 342 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-11-12 20:42:19,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:20,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 513 proven. 342 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-11-12 20:42:20,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:20,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 52 [2018-11-12 20:42:20,532 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:20,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-12 20:42:20,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-12 20:42:20,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:42:20,534 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 30 states. [2018-11-12 20:42:20,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:20,714 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2018-11-12 20:42:20,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-12 20:42:20,714 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 91 [2018-11-12 20:42:20,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:20,715 INFO L225 Difference]: With dead ends: 124 [2018-11-12 20:42:20,715 INFO L226 Difference]: Without dead ends: 94 [2018-11-12 20:42:20,716 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 155 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:42:20,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-12 20:42:20,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-11-12 20:42:20,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-12 20:42:20,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2018-11-12 20:42:20,720 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 91 [2018-11-12 20:42:20,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:20,721 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2018-11-12 20:42:20,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-12 20:42:20,721 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2018-11-12 20:42:20,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-12 20:42:20,721 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:20,721 INFO L375 BasicCegarLoop]: trace histogram [33, 19, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:20,722 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:20,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:20,722 INFO L82 PathProgramCache]: Analyzing trace with hash 400065878, now seen corresponding path program 19 times [2018-11-12 20:42:20,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:20,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:20,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:20,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:20,723 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:21,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 540 proven. 380 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-11-12 20:42:21,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:21,406 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:21,406 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:21,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:21,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:21,406 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-12 20:42:21,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:21,415 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:21,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:21,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 540 proven. 380 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-11-12 20:42:21,462 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:22,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 540 proven. 380 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-11-12 20:42:22,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:22,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 52 [2018-11-12 20:42:22,277 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:22,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-12 20:42:22,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-12 20:42:22,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:42:22,279 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 31 states. [2018-11-12 20:42:22,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:22,445 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2018-11-12 20:42:22,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-12 20:42:22,446 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 93 [2018-11-12 20:42:22,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:22,447 INFO L225 Difference]: With dead ends: 126 [2018-11-12 20:42:22,447 INFO L226 Difference]: Without dead ends: 96 [2018-11-12 20:42:22,448 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 158 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:42:22,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-12 20:42:22,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-11-12 20:42:22,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-12 20:42:22,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2018-11-12 20:42:22,453 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 93 [2018-11-12 20:42:22,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:22,453 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2018-11-12 20:42:22,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-12 20:42:22,453 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2018-11-12 20:42:22,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-12 20:42:22,454 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:22,454 INFO L375 BasicCegarLoop]: trace histogram [34, 20, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:22,454 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:22,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:22,454 INFO L82 PathProgramCache]: Analyzing trace with hash -355941997, now seen corresponding path program 20 times [2018-11-12 20:42:22,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:22,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:22,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:22,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:22,455 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:23,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 567 proven. 420 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-11-12 20:42:23,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:23,711 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:23,711 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:23,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:23,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:23,711 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-12 20:42:23,720 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:42:23,720 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:42:23,760 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-11-12 20:42:23,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:23,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:24,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 580 proven. 196 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-11-12 20:42:24,161 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:24,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 580 proven. 196 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-11-12 20:42:24,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:24,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 17, 17] total 62 [2018-11-12 20:42:24,739 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:24,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-12 20:42:24,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-12 20:42:24,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-11-12 20:42:24,740 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 47 states. [2018-11-12 20:42:24,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:24,957 INFO L93 Difference]: Finished difference Result 131 states and 134 transitions. [2018-11-12 20:42:24,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-12 20:42:24,958 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 95 [2018-11-12 20:42:24,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:24,959 INFO L225 Difference]: With dead ends: 131 [2018-11-12 20:42:24,959 INFO L226 Difference]: Without dead ends: 101 [2018-11-12 20:42:24,960 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-11-12 20:42:24,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-12 20:42:24,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-11-12 20:42:24,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-12 20:42:24,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2018-11-12 20:42:24,965 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 95 [2018-11-12 20:42:24,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:24,965 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2018-11-12 20:42:24,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-12 20:42:24,966 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2018-11-12 20:42:24,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-12 20:42:24,966 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:24,966 INFO L375 BasicCegarLoop]: trace histogram [36, 21, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:24,967 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:24,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:24,967 INFO L82 PathProgramCache]: Analyzing trace with hash -2030471190, now seen corresponding path program 21 times [2018-11-12 20:42:24,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:24,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:24,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:24,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:24,968 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:25,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 638 proven. 462 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-11-12 20:42:25,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:25,993 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:25,993 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:25,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:25,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:25,993 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-12 20:42:26,002 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:26,002 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:26,038 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:26,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:26,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:26,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 638 proven. 462 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-11-12 20:42:26,057 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:26,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 638 proven. 462 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-11-12 20:42:26,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:26,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 52 [2018-11-12 20:42:26,859 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:26,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-12 20:42:26,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-12 20:42:26,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:42:26,860 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 33 states. [2018-11-12 20:42:27,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:27,094 INFO L93 Difference]: Finished difference Result 134 states and 136 transitions. [2018-11-12 20:42:27,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-12 20:42:27,095 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 99 [2018-11-12 20:42:27,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:27,096 INFO L225 Difference]: With dead ends: 134 [2018-11-12 20:42:27,096 INFO L226 Difference]: Without dead ends: 102 [2018-11-12 20:42:27,097 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 168 SyntacticMatches, 12 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:42:27,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-12 20:42:27,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-11-12 20:42:27,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-12 20:42:27,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2018-11-12 20:42:27,102 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 99 [2018-11-12 20:42:27,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:27,103 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2018-11-12 20:42:27,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-12 20:42:27,103 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2018-11-12 20:42:27,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-12 20:42:27,104 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:27,104 INFO L375 BasicCegarLoop]: trace histogram [37, 22, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:27,104 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:27,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:27,104 INFO L82 PathProgramCache]: Analyzing trace with hash -156708249, now seen corresponding path program 22 times [2018-11-12 20:42:27,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:27,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:27,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:27,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:27,105 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:27,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:27,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 667 proven. 506 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-11-12 20:42:27,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:27,619 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:27,619 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:27,619 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:27,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:27,619 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:27,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:27,629 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:27,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:27,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 667 proven. 506 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-11-12 20:42:27,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:30,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 667 proven. 506 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-11-12 20:42:30,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:30,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 52 [2018-11-12 20:42:30,086 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:30,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-12 20:42:30,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-12 20:42:30,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:42:30,088 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 34 states. [2018-11-12 20:42:30,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:30,261 INFO L93 Difference]: Finished difference Result 136 states and 138 transitions. [2018-11-12 20:42:30,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-12 20:42:30,269 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 101 [2018-11-12 20:42:30,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:30,270 INFO L225 Difference]: With dead ends: 136 [2018-11-12 20:42:30,270 INFO L226 Difference]: Without dead ends: 104 [2018-11-12 20:42:30,271 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 171 SyntacticMatches, 14 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:42:30,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-12 20:42:30,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-11-12 20:42:30,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-12 20:42:30,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2018-11-12 20:42:30,276 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 101 [2018-11-12 20:42:30,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:30,276 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2018-11-12 20:42:30,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-12 20:42:30,276 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2018-11-12 20:42:30,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-12 20:42:30,277 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:30,277 INFO L375 BasicCegarLoop]: trace histogram [38, 23, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:30,277 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:30,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:30,278 INFO L82 PathProgramCache]: Analyzing trace with hash 938181028, now seen corresponding path program 23 times [2018-11-12 20:42:30,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:30,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:30,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:30,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:30,279 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:30,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 696 proven. 552 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-11-12 20:42:30,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:30,977 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:30,977 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:30,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:30,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:30,978 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:30,986 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:42:30,986 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:42:31,032 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-11-12 20:42:31,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:31,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:31,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 713 proven. 225 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-11-12 20:42:31,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:32,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 713 proven. 225 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-11-12 20:42:32,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:32,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 18, 18] total 67 [2018-11-12 20:42:32,260 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:32,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-12 20:42:32,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-12 20:42:32,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-11-12 20:42:32,261 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 51 states. [2018-11-12 20:42:32,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:32,481 INFO L93 Difference]: Finished difference Result 141 states and 144 transitions. [2018-11-12 20:42:32,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-12 20:42:32,482 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 103 [2018-11-12 20:42:32,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:32,483 INFO L225 Difference]: With dead ends: 141 [2018-11-12 20:42:32,483 INFO L226 Difference]: Without dead ends: 109 [2018-11-12 20:42:32,485 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-11-12 20:42:32,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-12 20:42:32,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2018-11-12 20:42:32,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-12 20:42:32,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2018-11-12 20:42:32,490 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 103 [2018-11-12 20:42:32,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:32,490 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2018-11-12 20:42:32,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-12 20:42:32,490 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2018-11-12 20:42:32,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-12 20:42:32,491 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:32,491 INFO L375 BasicCegarLoop]: trace histogram [40, 24, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:32,491 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:32,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:32,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1615686331, now seen corresponding path program 24 times [2018-11-12 20:42:32,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:32,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:32,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:32,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:32,493 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:33,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 775 proven. 600 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-11-12 20:42:33,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:33,588 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:33,589 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:33,589 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:33,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:33,589 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:33,597 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:33,597 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:33,628 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:33,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:33,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:33,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 775 proven. 600 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-11-12 20:42:33,649 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:34,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 775 proven. 600 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-11-12 20:42:34,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:34,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 52 [2018-11-12 20:42:34,466 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:34,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-12 20:42:34,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-12 20:42:34,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:42:34,467 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 36 states. [2018-11-12 20:42:34,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:34,626 INFO L93 Difference]: Finished difference Result 144 states and 146 transitions. [2018-11-12 20:42:34,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-12 20:42:34,626 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 107 [2018-11-12 20:42:34,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:34,627 INFO L225 Difference]: With dead ends: 144 [2018-11-12 20:42:34,627 INFO L226 Difference]: Without dead ends: 110 [2018-11-12 20:42:34,628 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 181 SyntacticMatches, 18 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:42:34,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-12 20:42:34,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-11-12 20:42:34,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-12 20:42:34,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2018-11-12 20:42:34,634 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 107 [2018-11-12 20:42:34,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:34,635 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2018-11-12 20:42:34,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-12 20:42:34,635 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2018-11-12 20:42:34,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-12 20:42:34,636 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:34,636 INFO L375 BasicCegarLoop]: trace histogram [41, 25, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:34,636 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:34,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:34,636 INFO L82 PathProgramCache]: Analyzing trace with hash 627898424, now seen corresponding path program 25 times [2018-11-12 20:42:34,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:34,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:34,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:34,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:34,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:35,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 806 proven. 650 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-11-12 20:42:35,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:35,202 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:35,202 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:35,203 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:35,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:35,203 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:35,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:35,211 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:35,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:35,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 806 proven. 650 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-11-12 20:42:35,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:36,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 806 proven. 650 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-11-12 20:42:36,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:36,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 52 [2018-11-12 20:42:36,100 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:36,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-12 20:42:36,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-12 20:42:36,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:42:36,101 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 37 states. [2018-11-12 20:42:36,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:36,285 INFO L93 Difference]: Finished difference Result 146 states and 148 transitions. [2018-11-12 20:42:36,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-12 20:42:36,289 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 109 [2018-11-12 20:42:36,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:36,289 INFO L225 Difference]: With dead ends: 146 [2018-11-12 20:42:36,290 INFO L226 Difference]: Without dead ends: 112 [2018-11-12 20:42:36,290 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 184 SyntacticMatches, 20 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:42:36,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-12 20:42:36,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-11-12 20:42:36,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-12 20:42:36,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2018-11-12 20:42:36,295 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 109 [2018-11-12 20:42:36,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:36,295 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2018-11-12 20:42:36,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-12 20:42:36,296 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2018-11-12 20:42:36,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-12 20:42:36,296 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:36,297 INFO L375 BasicCegarLoop]: trace histogram [42, 26, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:36,297 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:36,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:36,297 INFO L82 PathProgramCache]: Analyzing trace with hash 551492213, now seen corresponding path program 26 times [2018-11-12 20:42:36,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:36,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:36,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:36,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:36,298 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:36,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 837 proven. 702 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-11-12 20:42:36,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:36,958 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:36,958 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:36,958 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:36,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:36,958 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:36,968 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:42:36,968 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:42:37,013 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-11-12 20:42:37,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:37,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:37,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 858 proven. 256 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-11-12 20:42:37,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:38,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 858 proven. 256 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-11-12 20:42:38,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:38,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 19, 19] total 72 [2018-11-12 20:42:38,748 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:38,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-12 20:42:38,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-12 20:42:38,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-11-12 20:42:38,750 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 55 states. [2018-11-12 20:42:40,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:40,037 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2018-11-12 20:42:40,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-12 20:42:40,037 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 111 [2018-11-12 20:42:40,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:40,038 INFO L225 Difference]: With dead ends: 151 [2018-11-12 20:42:40,039 INFO L226 Difference]: Without dead ends: 117 [2018-11-12 20:42:40,039 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-11-12 20:42:40,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-12 20:42:40,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2018-11-12 20:42:40,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-12 20:42:40,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 117 transitions. [2018-11-12 20:42:40,045 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 117 transitions. Word has length 111 [2018-11-12 20:42:40,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:40,045 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 117 transitions. [2018-11-12 20:42:40,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-12 20:42:40,045 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 117 transitions. [2018-11-12 20:42:40,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-12 20:42:40,046 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:40,046 INFO L375 BasicCegarLoop]: trace histogram [44, 27, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:40,046 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:40,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:40,047 INFO L82 PathProgramCache]: Analyzing trace with hash 972817996, now seen corresponding path program 27 times [2018-11-12 20:42:40,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:40,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:40,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:40,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:40,048 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:40,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 924 proven. 756 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-12 20:42:40,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:40,801 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:40,801 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:40,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:40,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:40,801 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:40,812 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:40,812 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:40,848 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:40,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:40,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:40,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 924 proven. 756 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-12 20:42:40,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:41,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 924 proven. 756 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-12 20:42:41,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:41,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 52 [2018-11-12 20:42:41,695 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:41,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-12 20:42:41,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-12 20:42:41,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:42:41,696 INFO L87 Difference]: Start difference. First operand 116 states and 117 transitions. Second operand 39 states. [2018-11-12 20:42:41,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:41,998 INFO L93 Difference]: Finished difference Result 154 states and 156 transitions. [2018-11-12 20:42:41,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-12 20:42:41,999 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 115 [2018-11-12 20:42:41,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:42,000 INFO L225 Difference]: With dead ends: 154 [2018-11-12 20:42:42,000 INFO L226 Difference]: Without dead ends: 118 [2018-11-12 20:42:42,000 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 194 SyntacticMatches, 24 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:42:42,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-12 20:42:42,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-11-12 20:42:42,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-12 20:42:42,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2018-11-12 20:42:42,006 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 115 [2018-11-12 20:42:42,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:42,006 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2018-11-12 20:42:42,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-12 20:42:42,007 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2018-11-12 20:42:42,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-12 20:42:42,007 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:42,007 INFO L375 BasicCegarLoop]: trace histogram [45, 28, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:42,008 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:42,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:42,008 INFO L82 PathProgramCache]: Analyzing trace with hash -2035759415, now seen corresponding path program 28 times [2018-11-12 20:42:42,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:42,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:42,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:42,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:42,009 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:42,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 957 proven. 812 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-12 20:42:42,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:42,810 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:42,810 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:42,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:42,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:42,811 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:42,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:42,819 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:42,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:42,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 957 proven. 812 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-12 20:42:42,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:44,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 957 proven. 812 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-12 20:42:44,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:44,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 52 [2018-11-12 20:42:44,089 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:44,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-12 20:42:44,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-12 20:42:44,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:42:44,091 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 40 states. [2018-11-12 20:42:44,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:44,280 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2018-11-12 20:42:44,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-12 20:42:44,280 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 117 [2018-11-12 20:42:44,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:44,282 INFO L225 Difference]: With dead ends: 156 [2018-11-12 20:42:44,282 INFO L226 Difference]: Without dead ends: 120 [2018-11-12 20:42:44,282 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 197 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:42:44,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-12 20:42:44,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-11-12 20:42:44,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-12 20:42:44,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2018-11-12 20:42:44,288 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 117 [2018-11-12 20:42:44,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:44,288 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2018-11-12 20:42:44,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-12 20:42:44,288 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2018-11-12 20:42:44,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-12 20:42:44,289 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:44,289 INFO L375 BasicCegarLoop]: trace histogram [46, 29, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:44,289 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:44,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:44,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1529306118, now seen corresponding path program 29 times [2018-11-12 20:42:44,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:44,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:44,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:44,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:44,291 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:45,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 990 proven. 870 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-12 20:42:45,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:45,167 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:45,168 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:45,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:45,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:45,168 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:45,176 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:42:45,176 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:42:45,225 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-11-12 20:42:45,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:45,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:45,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1015 proven. 289 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-11-12 20:42:45,876 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:46,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1015 proven. 289 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-11-12 20:42:46,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:46,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 20, 20] total 77 [2018-11-12 20:42:46,794 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:46,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-11-12 20:42:46,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-11-12 20:42:46,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-11-12 20:42:46,796 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 59 states. [2018-11-12 20:42:47,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:47,095 INFO L93 Difference]: Finished difference Result 161 states and 164 transitions. [2018-11-12 20:42:47,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-12 20:42:47,095 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 119 [2018-11-12 20:42:47,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:47,097 INFO L225 Difference]: With dead ends: 161 [2018-11-12 20:42:47,097 INFO L226 Difference]: Without dead ends: 125 [2018-11-12 20:42:47,097 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-11-12 20:42:47,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-12 20:42:47,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2018-11-12 20:42:47,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-12 20:42:47,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2018-11-12 20:42:47,104 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 119 [2018-11-12 20:42:47,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:47,105 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2018-11-12 20:42:47,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-11-12 20:42:47,105 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2018-11-12 20:42:47,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-12 20:42:47,106 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:47,106 INFO L375 BasicCegarLoop]: trace histogram [48, 30, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:47,106 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:47,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:47,106 INFO L82 PathProgramCache]: Analyzing trace with hash -892003683, now seen corresponding path program 30 times [2018-11-12 20:42:47,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:47,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:47,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:47,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:47,107 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:47,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:47,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1085 proven. 930 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-11-12 20:42:47,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:47,825 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:47,825 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:47,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:47,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:47,826 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:47,833 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:47,833 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:47,881 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:47,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:47,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:47,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1085 proven. 930 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-11-12 20:42:47,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:49,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1085 proven. 930 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-11-12 20:42:49,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:49,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 52 [2018-11-12 20:42:49,330 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:49,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-12 20:42:49,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-12 20:42:49,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:42:49,331 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand 42 states. [2018-11-12 20:42:49,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:49,619 INFO L93 Difference]: Finished difference Result 164 states and 166 transitions. [2018-11-12 20:42:49,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-12 20:42:49,619 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 123 [2018-11-12 20:42:49,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:49,621 INFO L225 Difference]: With dead ends: 164 [2018-11-12 20:42:49,621 INFO L226 Difference]: Without dead ends: 126 [2018-11-12 20:42:49,621 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 207 SyntacticMatches, 30 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:42:49,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-12 20:42:49,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-11-12 20:42:49,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-12 20:42:49,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2018-11-12 20:42:49,627 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 123 [2018-11-12 20:42:49,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:49,627 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2018-11-12 20:42:49,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-12 20:42:49,628 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2018-11-12 20:42:49,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-12 20:42:49,628 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:49,628 INFO L375 BasicCegarLoop]: trace histogram [49, 31, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:49,629 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:49,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:49,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1680608794, now seen corresponding path program 31 times [2018-11-12 20:42:49,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:49,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:49,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:49,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:49,630 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:50,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1120 proven. 992 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-11-12 20:42:50,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:50,325 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:50,325 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:50,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:50,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:50,325 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:50,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:50,333 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:50,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:50,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1120 proven. 992 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-11-12 20:42:50,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:51,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1120 proven. 992 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-11-12 20:42:51,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:51,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 52 [2018-11-12 20:42:51,395 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:51,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-12 20:42:51,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-12 20:42:51,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:42:51,397 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand 43 states. [2018-11-12 20:42:51,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:51,725 INFO L93 Difference]: Finished difference Result 166 states and 168 transitions. [2018-11-12 20:42:51,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-12 20:42:51,726 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 125 [2018-11-12 20:42:51,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:51,727 INFO L225 Difference]: With dead ends: 166 [2018-11-12 20:42:51,727 INFO L226 Difference]: Without dead ends: 128 [2018-11-12 20:42:51,728 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 210 SyntacticMatches, 32 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:42:51,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-12 20:42:51,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-11-12 20:42:51,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-12 20:42:51,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2018-11-12 20:42:51,734 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 125 [2018-11-12 20:42:51,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:51,735 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2018-11-12 20:42:51,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-12 20:42:51,735 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2018-11-12 20:42:51,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-12 20:42:51,736 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:51,736 INFO L375 BasicCegarLoop]: trace histogram [50, 32, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:51,736 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:51,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:51,737 INFO L82 PathProgramCache]: Analyzing trace with hash 60036695, now seen corresponding path program 32 times [2018-11-12 20:42:51,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:51,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:51,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:51,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:51,738 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:52,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1155 proven. 1056 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-11-12 20:42:52,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:52,718 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:52,718 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:52,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:52,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:52,718 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:52,727 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:42:52,727 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:42:52,783 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-11-12 20:42:52,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:52,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:53,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1184 proven. 324 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-11-12 20:42:53,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:54,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1184 proven. 324 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-11-12 20:42:54,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:54,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 21, 21] total 82 [2018-11-12 20:42:54,656 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:54,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-11-12 20:42:54,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-11-12 20:42:54,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-11-12 20:42:54,658 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand 63 states. [2018-11-12 20:42:55,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:55,000 INFO L93 Difference]: Finished difference Result 171 states and 174 transitions. [2018-11-12 20:42:55,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-11-12 20:42:55,000 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 127 [2018-11-12 20:42:55,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:55,002 INFO L225 Difference]: With dead ends: 171 [2018-11-12 20:42:55,002 INFO L226 Difference]: Without dead ends: 133 [2018-11-12 20:42:55,003 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-11-12 20:42:55,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-12 20:42:55,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2018-11-12 20:42:55,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-12 20:42:55,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2018-11-12 20:42:55,009 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 127 [2018-11-12 20:42:55,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:55,009 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2018-11-12 20:42:55,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-11-12 20:42:55,009 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2018-11-12 20:42:55,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-12 20:42:55,010 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:55,010 INFO L375 BasicCegarLoop]: trace histogram [52, 33, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:55,010 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:55,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:55,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1913358418, now seen corresponding path program 33 times [2018-11-12 20:42:55,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:55,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:55,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:55,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:55,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:56,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1258 proven. 1122 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-11-12 20:42:56,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:56,296 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:56,296 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:56,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:56,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:56,296 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:56,305 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:56,305 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:56,348 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:56,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:56,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:56,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1258 proven. 1122 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-11-12 20:42:56,372 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:57,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1258 proven. 1122 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-11-12 20:42:57,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:57,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 52 [2018-11-12 20:42:57,351 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:57,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-12 20:42:57,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-12 20:42:57,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:42:57,352 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand 45 states. [2018-11-12 20:42:57,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:57,538 INFO L93 Difference]: Finished difference Result 174 states and 176 transitions. [2018-11-12 20:42:57,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-12 20:42:57,539 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 131 [2018-11-12 20:42:57,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:57,540 INFO L225 Difference]: With dead ends: 174 [2018-11-12 20:42:57,540 INFO L226 Difference]: Without dead ends: 134 [2018-11-12 20:42:57,541 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 220 SyntacticMatches, 36 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:42:57,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-12 20:42:57,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-11-12 20:42:57,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-12 20:42:57,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 135 transitions. [2018-11-12 20:42:57,546 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 135 transitions. Word has length 131 [2018-11-12 20:42:57,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:57,547 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 135 transitions. [2018-11-12 20:42:57,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-12 20:42:57,547 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 135 transitions. [2018-11-12 20:42:57,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-12 20:42:57,547 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:57,548 INFO L375 BasicCegarLoop]: trace histogram [53, 34, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:57,548 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:57,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:57,548 INFO L82 PathProgramCache]: Analyzing trace with hash -871195093, now seen corresponding path program 34 times [2018-11-12 20:42:57,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:57,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:57,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:57,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:57,549 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:59,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1295 proven. 1190 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-11-12 20:42:59,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:59,454 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:59,454 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:59,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:59,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:59,454 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:59,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:59,466 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:59,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:59,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1295 proven. 1190 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-11-12 20:42:59,546 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:00,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1295 proven. 1190 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-11-12 20:43:00,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:00,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 52 [2018-11-12 20:43:00,603 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:00,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-12 20:43:00,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-12 20:43:00,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:43:00,604 INFO L87 Difference]: Start difference. First operand 134 states and 135 transitions. Second operand 46 states. [2018-11-12 20:43:00,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:00,811 INFO L93 Difference]: Finished difference Result 176 states and 178 transitions. [2018-11-12 20:43:00,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-12 20:43:00,812 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 133 [2018-11-12 20:43:00,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:00,813 INFO L225 Difference]: With dead ends: 176 [2018-11-12 20:43:00,813 INFO L226 Difference]: Without dead ends: 136 [2018-11-12 20:43:00,814 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 223 SyntacticMatches, 38 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:43:00,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-12 20:43:00,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-11-12 20:43:00,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-12 20:43:00,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2018-11-12 20:43:00,820 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 133 [2018-11-12 20:43:00,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:00,820 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2018-11-12 20:43:00,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-12 20:43:00,820 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2018-11-12 20:43:00,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-12 20:43:00,821 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:00,821 INFO L375 BasicCegarLoop]: trace histogram [54, 35, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:00,821 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:00,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:00,822 INFO L82 PathProgramCache]: Analyzing trace with hash -79619736, now seen corresponding path program 35 times [2018-11-12 20:43:00,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:00,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:00,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:00,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:00,823 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:02,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1332 proven. 1260 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-11-12 20:43:02,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:02,471 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:02,471 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:02,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:02,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:02,472 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:02,481 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:43:02,481 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:43:02,534 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-11-12 20:43:02,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:02,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:03,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1365 proven. 361 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-11-12 20:43:03,319 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:04,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1365 proven. 361 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-11-12 20:43:04,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:04,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 22, 22] total 87 [2018-11-12 20:43:04,714 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:04,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-11-12 20:43:04,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-11-12 20:43:04,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-11-12 20:43:04,716 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 67 states. [2018-11-12 20:43:05,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:05,069 INFO L93 Difference]: Finished difference Result 181 states and 184 transitions. [2018-11-12 20:43:05,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-11-12 20:43:05,069 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 135 [2018-11-12 20:43:05,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:05,070 INFO L225 Difference]: With dead ends: 181 [2018-11-12 20:43:05,070 INFO L226 Difference]: Without dead ends: 141 [2018-11-12 20:43:05,071 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-11-12 20:43:05,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-12 20:43:05,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2018-11-12 20:43:05,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-12 20:43:05,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2018-11-12 20:43:05,077 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 135 [2018-11-12 20:43:05,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:05,077 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2018-11-12 20:43:05,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-11-12 20:43:05,077 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2018-11-12 20:43:05,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-12 20:43:05,078 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:05,078 INFO L375 BasicCegarLoop]: trace histogram [56, 36, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:05,079 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:05,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:05,079 INFO L82 PathProgramCache]: Analyzing trace with hash -540938881, now seen corresponding path program 36 times [2018-11-12 20:43:05,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:05,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:05,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:05,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:05,080 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:06,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1443 proven. 1332 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-11-12 20:43:06,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:06,271 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:06,272 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:06,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:06,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:06,272 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:06,280 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:43:06,281 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:43:06,332 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:43:06,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:06,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:06,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1443 proven. 1332 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-11-12 20:43:06,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:07,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1443 proven. 1332 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-11-12 20:43:07,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:07,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 52 [2018-11-12 20:43:07,387 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:07,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-12 20:43:07,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-12 20:43:07,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:43:07,388 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand 48 states. [2018-11-12 20:43:07,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:07,611 INFO L93 Difference]: Finished difference Result 184 states and 186 transitions. [2018-11-12 20:43:07,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-12 20:43:07,611 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 139 [2018-11-12 20:43:07,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:07,613 INFO L225 Difference]: With dead ends: 184 [2018-11-12 20:43:07,613 INFO L226 Difference]: Without dead ends: 142 [2018-11-12 20:43:07,614 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 233 SyntacticMatches, 42 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:43:07,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-12 20:43:07,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-11-12 20:43:07,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-12 20:43:07,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2018-11-12 20:43:07,620 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 139 [2018-11-12 20:43:07,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:07,620 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2018-11-12 20:43:07,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-12 20:43:07,621 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2018-11-12 20:43:07,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-12 20:43:07,621 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:07,622 INFO L375 BasicCegarLoop]: trace histogram [57, 37, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:07,622 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:07,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:07,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1379645700, now seen corresponding path program 37 times [2018-11-12 20:43:07,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:07,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:07,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:07,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:07,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:08,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1482 proven. 1406 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-11-12 20:43:08,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:08,640 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:08,641 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:08,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:08,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:08,641 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:08,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:08,650 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:43:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:08,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:08,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1482 proven. 1406 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-11-12 20:43:08,721 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:10,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1482 proven. 1406 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-11-12 20:43:10,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:10,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 52 [2018-11-12 20:43:10,655 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:10,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-12 20:43:10,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-12 20:43:10,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:43:10,657 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 49 states. [2018-11-12 20:43:10,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:10,885 INFO L93 Difference]: Finished difference Result 186 states and 188 transitions. [2018-11-12 20:43:10,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-12 20:43:10,885 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 141 [2018-11-12 20:43:10,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:10,887 INFO L225 Difference]: With dead ends: 186 [2018-11-12 20:43:10,887 INFO L226 Difference]: Without dead ends: 144 [2018-11-12 20:43:10,888 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 236 SyntacticMatches, 44 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:43:10,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-12 20:43:10,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-11-12 20:43:10,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-12 20:43:10,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2018-11-12 20:43:10,893 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 141 [2018-11-12 20:43:10,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:10,894 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2018-11-12 20:43:10,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-12 20:43:10,894 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2018-11-12 20:43:10,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-12 20:43:10,895 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:10,895 INFO L375 BasicCegarLoop]: trace histogram [58, 38, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:10,895 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:10,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:10,895 INFO L82 PathProgramCache]: Analyzing trace with hash 76952889, now seen corresponding path program 38 times [2018-11-12 20:43:10,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:10,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:10,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:10,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:10,897 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:11,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1521 proven. 1482 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-11-12 20:43:11,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:11,833 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:11,834 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:11,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:11,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:11,834 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:11,842 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:43:11,842 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:43:11,902 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-11-12 20:43:11,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:11,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:12,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1558 proven. 400 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-11-12 20:43:12,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:13,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1558 proven. 400 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-11-12 20:43:13,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:13,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 23, 23] total 92 [2018-11-12 20:43:13,938 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:13,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-11-12 20:43:13,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-11-12 20:43:13,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-11-12 20:43:13,939 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 71 states. [2018-11-12 20:43:14,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:14,375 INFO L93 Difference]: Finished difference Result 191 states and 194 transitions. [2018-11-12 20:43:14,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-11-12 20:43:14,376 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 143 [2018-11-12 20:43:14,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:14,377 INFO L225 Difference]: With dead ends: 191 [2018-11-12 20:43:14,377 INFO L226 Difference]: Without dead ends: 149 [2018-11-12 20:43:14,378 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-11-12 20:43:14,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-12 20:43:14,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2018-11-12 20:43:14,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-12 20:43:14,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2018-11-12 20:43:14,385 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 143 [2018-11-12 20:43:14,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:14,385 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2018-11-12 20:43:14,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-11-12 20:43:14,385 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2018-11-12 20:43:14,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-12 20:43:14,386 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:14,386 INFO L375 BasicCegarLoop]: trace histogram [60, 39, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:14,386 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:14,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:14,387 INFO L82 PathProgramCache]: Analyzing trace with hash -621720560, now seen corresponding path program 39 times [2018-11-12 20:43:14,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:14,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:14,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:14,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:14,388 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:15,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1640 proven. 1560 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-11-12 20:43:15,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:15,518 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:15,518 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:15,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:15,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:15,518 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:15,527 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:43:15,527 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:43:15,572 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:43:15,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:15,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:15,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1640 proven. 1560 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-11-12 20:43:15,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:16,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1640 proven. 1560 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-11-12 20:43:16,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:16,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 52 [2018-11-12 20:43:16,536 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:16,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-12 20:43:16,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-12 20:43:16,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:43:16,537 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand 51 states. [2018-11-12 20:43:16,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:16,740 INFO L93 Difference]: Finished difference Result 194 states and 196 transitions. [2018-11-12 20:43:16,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-12 20:43:16,741 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 147 [2018-11-12 20:43:16,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:16,742 INFO L225 Difference]: With dead ends: 194 [2018-11-12 20:43:16,742 INFO L226 Difference]: Without dead ends: 150 [2018-11-12 20:43:16,743 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 246 SyntacticMatches, 48 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:43:16,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-12 20:43:16,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-11-12 20:43:16,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-12 20:43:16,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2018-11-12 20:43:16,747 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 147 [2018-11-12 20:43:16,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:16,748 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2018-11-12 20:43:16,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-12 20:43:16,748 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2018-11-12 20:43:16,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-12 20:43:16,748 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:16,749 INFO L375 BasicCegarLoop]: trace histogram [61, 40, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:16,749 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:16,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:16,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1225467763, now seen corresponding path program 40 times [2018-11-12 20:43:16,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:16,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:16,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:16,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:16,750 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:17,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1681 proven. 1640 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-11-12 20:43:17,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:17,809 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:17,809 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:17,809 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:17,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:17,809 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:17,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:17,817 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:43:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:17,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:17,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1681 proven. 1640 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-11-12 20:43:17,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:18,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1681 proven. 1640 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-11-12 20:43:18,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:18,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2018-11-12 20:43:18,827 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:18,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-12 20:43:18,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-12 20:43:18,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:43:18,828 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 52 states. [2018-11-12 20:43:19,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:19,165 INFO L93 Difference]: Finished difference Result 196 states and 198 transitions. [2018-11-12 20:43:19,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-12 20:43:19,165 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 149 [2018-11-12 20:43:19,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:19,166 INFO L225 Difference]: With dead ends: 196 [2018-11-12 20:43:19,167 INFO L226 Difference]: Without dead ends: 152 [2018-11-12 20:43:19,167 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 249 SyntacticMatches, 50 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:43:19,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-12 20:43:19,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-11-12 20:43:19,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-12 20:43:19,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2018-11-12 20:43:19,173 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 149 [2018-11-12 20:43:19,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:19,173 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2018-11-12 20:43:19,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-12 20:43:19,173 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2018-11-12 20:43:19,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-12 20:43:19,174 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:19,174 INFO L375 BasicCegarLoop]: trace histogram [62, 41, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:19,175 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:19,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:19,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1605944886, now seen corresponding path program 41 times [2018-11-12 20:43:19,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:19,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:19,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:19,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:19,176 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:19,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:19,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1833 proven. 529 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2018-11-12 20:43:19,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:19,602 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:19,602 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:19,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:19,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:19,602 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:19,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:43:19,612 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:43:19,676 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-11-12 20:43:19,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:19,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:19,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1763 proven. 441 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-11-12 20:43:19,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:20,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1763 proven. 441 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-11-12 20:43:20,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:20,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 48 [2018-11-12 20:43:20,286 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:20,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-12 20:43:20,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-12 20:43:20,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-12 20:43:20,287 INFO L87 Difference]: Start difference. First operand 152 states and 153 transitions. Second operand 26 states. [2018-11-12 20:43:20,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:20,386 INFO L93 Difference]: Finished difference Result 162 states and 165 transitions. [2018-11-12 20:43:20,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-12 20:43:20,386 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 151 [2018-11-12 20:43:20,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:20,388 INFO L225 Difference]: With dead ends: 162 [2018-11-12 20:43:20,388 INFO L226 Difference]: Without dead ends: 159 [2018-11-12 20:43:20,388 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-12 20:43:20,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-12 20:43:20,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2018-11-12 20:43:20,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-12 20:43:20,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 159 transitions. [2018-11-12 20:43:20,395 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 159 transitions. Word has length 151 [2018-11-12 20:43:20,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:20,395 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 159 transitions. [2018-11-12 20:43:20,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-12 20:43:20,395 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 159 transitions. [2018-11-12 20:43:20,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-12 20:43:20,396 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:20,396 INFO L375 BasicCegarLoop]: trace histogram [65, 41, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:20,397 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:20,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:20,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1929444056, now seen corresponding path program 42 times [2018-11-12 20:43:20,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:20,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:20,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:20,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:20,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:20,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 2067 proven. 676 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2018-11-12 20:43:20,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:20,793 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:20,793 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:20,793 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:20,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:20,793 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:20,801 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:43:20,801 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:43:20,868 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:43:20,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:20,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:22,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:22,044 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:23,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:23,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:23,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 77, 77] total 102 [2018-11-12 20:43:23,971 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:23,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-11-12 20:43:23,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-11-12 20:43:23,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:43:23,973 INFO L87 Difference]: Start difference. First operand 158 states and 159 transitions. Second operand 79 states. [2018-11-12 20:43:24,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:24,425 INFO L93 Difference]: Finished difference Result 168 states and 171 transitions. [2018-11-12 20:43:24,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-11-12 20:43:24,425 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 157 [2018-11-12 20:43:24,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:24,426 INFO L225 Difference]: With dead ends: 168 [2018-11-12 20:43:24,427 INFO L226 Difference]: Without dead ends: 165 [2018-11-12 20:43:24,427 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 190 SyntacticMatches, 52 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11272 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:43:24,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-12 20:43:24,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2018-11-12 20:43:24,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-12 20:43:24,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 165 transitions. [2018-11-12 20:43:24,432 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 165 transitions. Word has length 157 [2018-11-12 20:43:24,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:24,432 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 165 transitions. [2018-11-12 20:43:24,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-11-12 20:43:24,432 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 165 transitions. [2018-11-12 20:43:24,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-12 20:43:24,433 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:24,433 INFO L375 BasicCegarLoop]: trace histogram [68, 41, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:24,433 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:24,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:24,434 INFO L82 PathProgramCache]: Analyzing trace with hash 238893414, now seen corresponding path program 43 times [2018-11-12 20:43:24,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:24,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:24,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:24,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:24,434 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:24,916 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2301 proven. 841 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2018-11-12 20:43:24,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:24,916 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:24,916 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:24,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:24,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:24,917 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:24,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:24,927 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:43:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:24,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:26,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:26,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:28,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:28,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:28,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 80, 80] total 102 [2018-11-12 20:43:28,140 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:28,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-11-12 20:43:28,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-11-12 20:43:28,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:43:28,141 INFO L87 Difference]: Start difference. First operand 164 states and 165 transitions. Second operand 82 states. [2018-11-12 20:43:28,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:28,538 INFO L93 Difference]: Finished difference Result 174 states and 177 transitions. [2018-11-12 20:43:28,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-11-12 20:43:28,538 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 163 [2018-11-12 20:43:28,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:28,539 INFO L225 Difference]: With dead ends: 174 [2018-11-12 20:43:28,540 INFO L226 Difference]: Without dead ends: 171 [2018-11-12 20:43:28,540 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 199 SyntacticMatches, 58 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12007 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:43:28,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-11-12 20:43:28,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2018-11-12 20:43:28,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-12 20:43:28,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 171 transitions. [2018-11-12 20:43:28,544 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 171 transitions. Word has length 163 [2018-11-12 20:43:28,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:28,545 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 171 transitions. [2018-11-12 20:43:28,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-11-12 20:43:28,545 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 171 transitions. [2018-11-12 20:43:28,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-12 20:43:28,545 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:28,546 INFO L375 BasicCegarLoop]: trace histogram [71, 41, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:28,546 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:28,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:28,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1720178036, now seen corresponding path program 44 times [2018-11-12 20:43:28,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:28,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:28,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:28,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:28,547 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:29,082 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2535 proven. 1024 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2018-11-12 20:43:29,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:29,082 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:29,082 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:29,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:29,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:29,083 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:29,093 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:43:29,093 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:43:29,180 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 62 check-sat command(s) [2018-11-12 20:43:29,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:29,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:29,209 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2501 proven. 900 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-11-12 20:43:29,209 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:30,282 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2501 proven. 900 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-11-12 20:43:30,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:30,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33, 33] total 52 [2018-11-12 20:43:30,302 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:30,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-12 20:43:30,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-12 20:43:30,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:43:30,304 INFO L87 Difference]: Start difference. First operand 170 states and 171 transitions. Second operand 35 states. [2018-11-12 20:43:30,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:30,442 INFO L93 Difference]: Finished difference Result 180 states and 183 transitions. [2018-11-12 20:43:30,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-12 20:43:30,442 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 169 [2018-11-12 20:43:30,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:30,444 INFO L225 Difference]: With dead ends: 180 [2018-11-12 20:43:30,445 INFO L226 Difference]: Without dead ends: 177 [2018-11-12 20:43:30,445 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 308 SyntacticMatches, 14 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:43:30,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-12 20:43:30,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2018-11-12 20:43:30,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-12 20:43:30,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 177 transitions. [2018-11-12 20:43:30,450 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 177 transitions. Word has length 169 [2018-11-12 20:43:30,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:30,450 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 177 transitions. [2018-11-12 20:43:30,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-12 20:43:30,450 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 177 transitions. [2018-11-12 20:43:30,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-12 20:43:30,451 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:30,452 INFO L375 BasicCegarLoop]: trace histogram [74, 41, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:30,452 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:30,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:30,452 INFO L82 PathProgramCache]: Analyzing trace with hash 268742402, now seen corresponding path program 45 times [2018-11-12 20:43:30,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:30,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:30,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:30,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:30,453 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:31,035 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2769 proven. 1225 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2018-11-12 20:43:31,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:31,036 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:31,036 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:31,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:31,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:31,036 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:31,046 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:43:31,046 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:43:31,099 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:43:31,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:31,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:32,336 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:32,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:34,066 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:34,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:34,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 86, 86] total 102 [2018-11-12 20:43:34,086 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:34,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-11-12 20:43:34,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-11-12 20:43:34,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:43:34,088 INFO L87 Difference]: Start difference. First operand 176 states and 177 transitions. Second operand 88 states. [2018-11-12 20:43:34,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:34,617 INFO L93 Difference]: Finished difference Result 186 states and 189 transitions. [2018-11-12 20:43:34,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-11-12 20:43:34,617 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 175 [2018-11-12 20:43:34,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:34,619 INFO L225 Difference]: With dead ends: 186 [2018-11-12 20:43:34,619 INFO L226 Difference]: Without dead ends: 183 [2018-11-12 20:43:34,619 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 217 SyntacticMatches, 70 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13477 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:43:34,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-12 20:43:34,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2018-11-12 20:43:34,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-12 20:43:34,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 183 transitions. [2018-11-12 20:43:34,624 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 183 transitions. Word has length 175 [2018-11-12 20:43:34,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:34,625 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 183 transitions. [2018-11-12 20:43:34,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-11-12 20:43:34,625 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 183 transitions. [2018-11-12 20:43:34,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-12 20:43:34,626 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:34,626 INFO L375 BasicCegarLoop]: trace histogram [77, 41, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:34,626 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:34,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:34,627 INFO L82 PathProgramCache]: Analyzing trace with hash 745514512, now seen corresponding path program 46 times [2018-11-12 20:43:34,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:34,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:34,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:34,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:34,628 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:35,332 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 3003 proven. 1444 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2018-11-12 20:43:35,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:35,333 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:35,333 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:35,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:35,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:35,333 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:35,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:35,343 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:43:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:35,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:36,586 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:36,586 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:38,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:38,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:38,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 89, 89] total 102 [2018-11-12 20:43:38,412 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:38,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-11-12 20:43:38,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-11-12 20:43:38,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:43:38,413 INFO L87 Difference]: Start difference. First operand 182 states and 183 transitions. Second operand 91 states. [2018-11-12 20:43:38,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:38,897 INFO L93 Difference]: Finished difference Result 192 states and 195 transitions. [2018-11-12 20:43:38,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-11-12 20:43:38,897 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 181 [2018-11-12 20:43:38,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:38,898 INFO L225 Difference]: With dead ends: 192 [2018-11-12 20:43:38,898 INFO L226 Difference]: Without dead ends: 189 [2018-11-12 20:43:38,899 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 226 SyntacticMatches, 76 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14212 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:43:38,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-12 20:43:38,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2018-11-12 20:43:38,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-11-12 20:43:38,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 189 transitions. [2018-11-12 20:43:38,906 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 189 transitions. Word has length 181 [2018-11-12 20:43:38,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:38,906 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 189 transitions. [2018-11-12 20:43:38,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-11-12 20:43:38,906 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 189 transitions. [2018-11-12 20:43:38,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-12 20:43:38,907 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:38,907 INFO L375 BasicCegarLoop]: trace histogram [80, 41, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:38,908 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:38,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:38,908 INFO L82 PathProgramCache]: Analyzing trace with hash -652436834, now seen corresponding path program 47 times [2018-11-12 20:43:38,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:38,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:38,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:38,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:38,909 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:39,913 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3237 proven. 1681 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2018-11-12 20:43:39,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:39,913 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:39,913 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:39,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:39,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:39,914 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:39,921 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:43:39,921 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:43:40,041 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 80 check-sat command(s) [2018-11-12 20:43:40,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:40,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:40,069 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3239 proven. 1521 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-11-12 20:43:40,069 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:40,929 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3239 proven. 1521 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-11-12 20:43:40,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:40,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 42, 42] total 52 [2018-11-12 20:43:40,950 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:40,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-12 20:43:40,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-12 20:43:40,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:43:40,951 INFO L87 Difference]: Start difference. First operand 188 states and 189 transitions. Second operand 44 states. [2018-11-12 20:43:41,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:41,110 INFO L93 Difference]: Finished difference Result 198 states and 201 transitions. [2018-11-12 20:43:41,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-12 20:43:41,110 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 187 [2018-11-12 20:43:41,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:41,112 INFO L225 Difference]: With dead ends: 198 [2018-11-12 20:43:41,112 INFO L226 Difference]: Without dead ends: 195 [2018-11-12 20:43:41,113 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 335 SyntacticMatches, 32 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:43:41,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-12 20:43:41,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2018-11-12 20:43:41,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-12 20:43:41,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2018-11-12 20:43:41,120 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 195 transitions. Word has length 187 [2018-11-12 20:43:41,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:41,120 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 195 transitions. [2018-11-12 20:43:41,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-12 20:43:41,120 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 195 transitions. [2018-11-12 20:43:41,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-12 20:43:41,121 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:41,121 INFO L375 BasicCegarLoop]: trace histogram [83, 42, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:41,121 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:41,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:41,122 INFO L82 PathProgramCache]: Analyzing trace with hash 485977260, now seen corresponding path program 48 times [2018-11-12 20:43:41,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:41,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:41,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:41,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:41,123 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:42,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 3471 proven. 1936 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2018-11-12 20:43:42,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:42,063 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:42,063 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:42,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:42,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:42,064 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:42,074 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:43:42,074 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:43:42,134 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:43:42,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:42,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:43,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:43,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:45,284 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:45,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:45,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 95, 95] total 102 [2018-11-12 20:43:45,305 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:45,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-11-12 20:43:45,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-11-12 20:43:45,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:43:45,306 INFO L87 Difference]: Start difference. First operand 194 states and 195 transitions. Second operand 97 states. [2018-11-12 20:43:45,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:45,792 INFO L93 Difference]: Finished difference Result 204 states and 207 transitions. [2018-11-12 20:43:45,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-11-12 20:43:45,792 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 193 [2018-11-12 20:43:45,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:45,793 INFO L225 Difference]: With dead ends: 204 [2018-11-12 20:43:45,793 INFO L226 Difference]: Without dead ends: 201 [2018-11-12 20:43:45,793 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 244 SyntacticMatches, 88 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15682 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:43:45,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-12 20:43:45,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2018-11-12 20:43:45,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-12 20:43:45,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 201 transitions. [2018-11-12 20:43:45,801 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 201 transitions. Word has length 193 [2018-11-12 20:43:45,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:45,802 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 201 transitions. [2018-11-12 20:43:45,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-11-12 20:43:45,802 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 201 transitions. [2018-11-12 20:43:45,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-12 20:43:45,803 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:45,803 INFO L375 BasicCegarLoop]: trace histogram [86, 45, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:45,803 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:45,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:45,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1451490362, now seen corresponding path program 49 times [2018-11-12 20:43:45,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:45,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:45,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:45,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:45,805 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:46,748 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3705 proven. 2209 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2018-11-12 20:43:46,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:46,748 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:46,749 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:46,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:46,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:46,749 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:46,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:46,757 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:43:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:46,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:48,096 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:48,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:50,206 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:50,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:50,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 98, 98] total 102 [2018-11-12 20:43:50,227 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:50,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-11-12 20:43:50,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-11-12 20:43:50,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:43:50,228 INFO L87 Difference]: Start difference. First operand 200 states and 201 transitions. Second operand 100 states. [2018-11-12 20:43:50,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:50,827 INFO L93 Difference]: Finished difference Result 210 states and 213 transitions. [2018-11-12 20:43:50,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-11-12 20:43:50,827 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 199 [2018-11-12 20:43:50,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:50,829 INFO L225 Difference]: With dead ends: 210 [2018-11-12 20:43:50,829 INFO L226 Difference]: Without dead ends: 207 [2018-11-12 20:43:50,829 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 253 SyntacticMatches, 94 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16417 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:43:50,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-11-12 20:43:50,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2018-11-12 20:43:50,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-11-12 20:43:50,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 207 transitions. [2018-11-12 20:43:50,836 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 207 transitions. Word has length 199 [2018-11-12 20:43:50,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:50,836 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 207 transitions. [2018-11-12 20:43:50,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-11-12 20:43:50,836 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 207 transitions. [2018-11-12 20:43:50,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-12 20:43:50,837 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:50,838 INFO L375 BasicCegarLoop]: trace histogram [89, 48, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:50,838 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:50,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:50,838 INFO L82 PathProgramCache]: Analyzing trace with hash 702425416, now seen corresponding path program 50 times [2018-11-12 20:43:50,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:50,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:50,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:50,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:50,839 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:50,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:51,892 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 3977 proven. 2304 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-11-12 20:43:51,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:51,892 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:51,893 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:51,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:51,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:51,893 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:51,902 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:43:51,902 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:43:52,041 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2018-11-12 20:43:52,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:52,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:53,020 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:53,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:56,306 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:56,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:56,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 101, 101] total 102 [2018-11-12 20:43:56,327 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:56,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-11-12 20:43:56,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-11-12 20:43:56,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:43:56,328 INFO L87 Difference]: Start difference. First operand 206 states and 207 transitions. Second operand 101 states. [2018-11-12 20:43:56,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:56,916 INFO L93 Difference]: Finished difference Result 212 states and 213 transitions. [2018-11-12 20:43:56,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-11-12 20:43:56,916 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 205 [2018-11-12 20:43:56,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:56,917 INFO L225 Difference]: With dead ends: 212 [2018-11-12 20:43:56,917 INFO L226 Difference]: Without dead ends: 209 [2018-11-12 20:43:56,917 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 262 SyntacticMatches, 98 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16953 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:43:56,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-11-12 20:43:56,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2018-11-12 20:43:56,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-11-12 20:43:56,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 209 transitions. [2018-11-12 20:43:56,922 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 209 transitions. Word has length 205 [2018-11-12 20:43:56,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:56,922 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 209 transitions. [2018-11-12 20:43:56,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-11-12 20:43:56,923 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 209 transitions. [2018-11-12 20:43:56,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-12 20:43:56,924 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:56,924 INFO L375 BasicCegarLoop]: trace histogram [90, 49, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:56,924 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:56,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:56,924 INFO L82 PathProgramCache]: Analyzing trace with hash 713420962, now seen corresponding path program 51 times [2018-11-12 20:43:56,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:56,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:56,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:56,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:56,925 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:57,909 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 4059 proven. 2401 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-11-12 20:43:57,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:57,909 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:57,909 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:57,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:57,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:57,910 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:57,918 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:43:57,918 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:43:57,980 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:43:57,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:57,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:58,936 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:58,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:00,961 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:00,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:00,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 102, 102] total 102 [2018-11-12 20:44:00,981 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:00,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-11-12 20:44:00,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-11-12 20:44:00,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:44:00,982 INFO L87 Difference]: Start difference. First operand 208 states and 209 transitions. Second operand 102 states. [2018-11-12 20:44:01,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:01,476 INFO L93 Difference]: Finished difference Result 213 states and 214 transitions. [2018-11-12 20:44:01,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-11-12 20:44:01,476 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 207 [2018-11-12 20:44:01,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:01,478 INFO L225 Difference]: With dead ends: 213 [2018-11-12 20:44:01,478 INFO L226 Difference]: Without dead ends: 210 [2018-11-12 20:44:01,479 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 265 SyntacticMatches, 100 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17200 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:44:01,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-11-12 20:44:01,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-11-12 20:44:01,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-12 20:44:01,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 211 transitions. [2018-11-12 20:44:01,485 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 211 transitions. Word has length 207 [2018-11-12 20:44:01,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:01,485 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 211 transitions. [2018-11-12 20:44:01,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-11-12 20:44:01,485 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 211 transitions. [2018-11-12 20:44:01,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-11-12 20:44:01,486 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:01,487 INFO L375 BasicCegarLoop]: trace histogram [91, 50, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:01,487 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:01,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:01,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1604761220, now seen corresponding path program 52 times [2018-11-12 20:44:01,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:01,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:01,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:44:01,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:01,488 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:03,304 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2018-11-12 20:44:03,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:03,304 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:03,304 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:03,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:03,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:03,304 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:44:03,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:03,315 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:44:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:03,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:03,508 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2018-11-12 20:44:03,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:03,823 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2018-11-12 20:44:03,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:03,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 55 [2018-11-12 20:44:03,844 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:03,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-12 20:44:03,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-12 20:44:03,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2018-11-12 20:44:03,844 INFO L87 Difference]: Start difference. First operand 210 states and 211 transitions. Second operand 54 states. [2018-11-12 20:44:05,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:05,878 INFO L93 Difference]: Finished difference Result 216 states and 217 transitions. [2018-11-12 20:44:05,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-12 20:44:05,879 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 209 [2018-11-12 20:44:05,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:05,880 INFO L225 Difference]: With dead ends: 216 [2018-11-12 20:44:05,881 INFO L226 Difference]: Without dead ends: 213 [2018-11-12 20:44:05,881 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 416 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=113, Invalid=2967, Unknown=0, NotChecked=0, Total=3080 [2018-11-12 20:44:05,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-11-12 20:44:05,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2018-11-12 20:44:05,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-11-12 20:44:05,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 213 transitions. [2018-11-12 20:44:05,891 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 213 transitions. Word has length 209 [2018-11-12 20:44:05,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:05,891 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 213 transitions. [2018-11-12 20:44:05,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-12 20:44:05,892 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 213 transitions. [2018-11-12 20:44:05,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-12 20:44:05,893 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:05,893 INFO L375 BasicCegarLoop]: trace histogram [92, 51, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:05,893 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:05,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:05,894 INFO L82 PathProgramCache]: Analyzing trace with hash -289811498, now seen corresponding path program 53 times [2018-11-12 20:44:05,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:05,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:05,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:05,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:05,895 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:07,490 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 6742 proven. 0 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2018-11-12 20:44:07,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:44:07,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2018-11-12 20:44:07,490 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:44:07,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-12 20:44:07,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-12 20:44:07,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:44:07,491 INFO L87 Difference]: Start difference. First operand 212 states and 213 transitions. Second operand 52 states. [2018-11-12 20:44:07,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:07,781 INFO L93 Difference]: Finished difference Result 212 states and 213 transitions. [2018-11-12 20:44:07,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-12 20:44:07,782 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 211 [2018-11-12 20:44:07,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:07,782 INFO L225 Difference]: With dead ends: 212 [2018-11-12 20:44:07,782 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 20:44:07,783 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:44:07,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 20:44:07,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 20:44:07,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 20:44:07,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 20:44:07,784 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 211 [2018-11-12 20:44:07,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:07,784 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 20:44:07,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-12 20:44:07,785 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 20:44:07,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 20:44:07,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 20:44:07,916 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 430 DAG size of output: 307 [2018-11-12 20:44:08,136 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-11-12 20:44:08,333 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-11-12 20:44:08,517 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-11-12 20:44:09,942 WARN L179 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 307 DAG size of output: 307 [2018-11-12 20:44:10,015 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 20:44:10,015 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-12 20:44:10,015 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 20:44:10,015 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 20:44:10,015 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-12 20:44:10,016 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 20:44:10,016 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 20:44:10,016 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2018-11-12 20:44:10,016 INFO L425 ceAbstractionStarter]: For program point L89(lines 89 98) no Hoare annotation was computed. [2018-11-12 20:44:10,016 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 8 209) no Hoare annotation was computed. [2018-11-12 20:44:10,016 INFO L425 ceAbstractionStarter]: For program point L56(lines 56 119) no Hoare annotation was computed. [2018-11-12 20:44:10,017 INFO L421 ceAbstractionStarter]: At program point L118(lines 56 119) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 8) (<= 50 main_~main__y~0)) [2018-11-12 20:44:10,017 INFO L425 ceAbstractionStarter]: For program point L44(lines 44 143) no Hoare annotation was computed. [2018-11-12 20:44:10,018 INFO L421 ceAbstractionStarter]: At program point L106(lines 62 107) the Hoare annotation is: (or (and (<= 56 main_~main__x~0) (<= main_~main__y~0 56) (<= main_~main__x~0 56) (<= 56 main_~main__y~0)) (and (<= 61 main_~main__y~0) (<= 61 main_~main__x~0) (<= main_~main__y~0 61) (<= main_~main__x~0 61)) (and (<= main_~main__x~0 91) (<= 91 main_~main__x~0) (<= main_~main__y~0 91) (<= 91 main_~main__y~0)) (and (<= 57 main_~main__y~0) (<= main_~main__y~0 57) (<= 57 main_~main__x~0) (<= main_~main__x~0 57)) (and (<= 59 main_~main__x~0) (<= main_~main__y~0 59) (<= main_~main__x~0 59) (<= 59 main_~main__y~0)) (and (<= main_~main__y~0 74) (<= 74 main_~main__y~0) (<= main_~main__x~0 74) (<= 74 main_~main__x~0)) (and (<= 75 main_~main__y~0) (<= main_~main__x~0 75) (<= 75 main_~main__x~0) (<= main_~main__y~0 75)) (and (<= main_~main__x~0 58) (<= main_~main__y~0 58) (<= 58 main_~main__x~0) (<= 58 main_~main__y~0)) (and (<= 72 main_~main__x~0) (<= main_~main__y~0 72) (<= 72 main_~main__y~0) (<= main_~main__x~0 72)) (and (<= main_~main__x~0 82) (<= 82 main_~main__x~0) (<= main_~main__y~0 82) (<= 82 main_~main__y~0)) (and (<= main_~main__y~0 64) (<= main_~main__x~0 64) (<= 64 main_~main__x~0) (<= 64 main_~main__y~0)) (and (<= main_~main__y~0 53) (<= 53 main_~main__y~0) (<= main_~main__x~0 53) (<= 53 main_~main__x~0)) (and (<= 89 main_~main__y~0) (<= main_~main__y~0 89) (<= main_~main__x~0 89) (<= 89 main_~main__x~0)) (and (<= main_~main__y~0 90) (<= 90 main_~main__y~0) (<= 90 main_~main__x~0) (<= main_~main__x~0 90)) (and (<= 87 main_~main__x~0) (<= main_~main__y~0 87) (<= main_~main__x~0 87) (<= 87 main_~main__y~0)) (and (<= main_~main__x~0 78) (<= main_~main__y~0 78) (<= 78 main_~main__x~0) (<= 78 main_~main__y~0)) (and (<= main_~main__x~0 95) (<= main_~main__y~0 95) (<= 95 main_~main__x~0) (<= 95 main_~main__y~0)) (and (<= main_~main__y~0 77) (<= 77 main_~main__y~0) (<= main_~main__x~0 77) (<= 77 main_~main__x~0)) (and (<= 55 main_~main__y~0) (<= main_~main__x~0 55) (<= main_~main__y~0 55) (<= 55 main_~main__x~0)) (and (<= 63 main_~main__x~0) (<= main_~main__y~0 63) (<= main_~main__x~0 63) (<= 63 main_~main__y~0)) (and (<= main_~main__y~0 100) (<= 100 main_~main__x~0) (<= 100 main_~main__y~0)) (and (<= 76 main_~main__x~0) (<= main_~main__x~0 76) (<= main_~main__y~0 76) (<= 76 main_~main__y~0)) (and (<= 79 main_~main__x~0) (<= 79 main_~main__y~0) (<= main_~main__x~0 79) (<= main_~main__y~0 79)) (and (<= main_~main__x~0 80) (<= main_~main__y~0 80) (<= 80 main_~main__x~0) (<= 80 main_~main__y~0)) (and (<= main_~main__y~0 54) (<= 54 main_~main__y~0) (<= 54 main_~main__x~0) (<= main_~main__x~0 54)) (and (<= main_~main__x~0 73) (<= 73 main_~main__x~0) (<= main_~main__y~0 73) (<= 73 main_~main__y~0)) (and (<= main_~main__x~0 52) (<= main_~main__y~0 52) (<= 52 main_~main__y~0) (<= 52 main_~main__x~0)) (and (<= main_~main__x~0 93) (<= main_~main__y~0 93) (<= 93 main_~main__y~0) (<= 93 main_~main__x~0)) (and (<= main_~main__y~0 97) (<= 97 main_~main__x~0) (<= 97 main_~main__y~0) (<= main_~main__x~0 97)) (and (<= main_~main__x~0 94) (<= 94 main_~main__x~0) (<= main_~main__y~0 94) (<= 94 main_~main__y~0)) (and (<= 70 main_~main__x~0) (<= main_~main__y~0 70) (<= main_~main__x~0 70) (<= 70 main_~main__y~0)) (and (<= main_~main__y~0 65) (<= 65 main_~main__y~0) (<= main_~main__x~0 65) (<= 65 main_~main__x~0)) (and (<= main_~main__y~0 84) (<= 84 main_~main__y~0) (<= 84 main_~main__x~0) (<= main_~main__x~0 84)) (and (<= main_~main__x~0 66) (<= main_~main__y~0 66) (<= 66 main_~main__y~0) (<= 66 main_~main__x~0)) (and (<= main_~main__x~0 60) (<= 60 main_~main__x~0) (<= 60 main_~main__y~0) (<= main_~main__y~0 60)) (and (<= main_~main__x~0 69) (<= main_~main__y~0 69) (<= 69 main_~main__y~0) (<= 69 main_~main__x~0)) (and (<= main_~main__y~0 71) (<= 71 main_~main__y~0) (<= 71 main_~main__x~0) (<= main_~main__x~0 71)) (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 50)) (and (<= 62 main_~main__y~0) (<= main_~main__y~0 62) (<= 62 main_~main__x~0) (<= main_~main__x~0 62)) (and (<= main_~main__y~0 68) (<= 68 main_~main__x~0) (<= main_~main__x~0 68) (<= 68 main_~main__y~0)) (and (<= main_~main__x~0 99) (<= 99 main_~main__x~0) (<= main_~main__y~0 99) (<= 99 main_~main__y~0)) (and (<= main_~main__x~0 96) (<= main_~main__y~0 96) (<= 96 main_~main__y~0) (<= 96 main_~main__x~0)) (and (<= main_~main__x~0 81) (<= main_~main__y~0 81) (<= 81 main_~main__x~0) (<= 81 main_~main__y~0)) (and (<= main_~main__y~0 98) (<= 98 main_~main__y~0) (<= main_~main__x~0 98) (<= 98 main_~main__x~0)) (and (<= 86 main_~main__x~0) (<= main_~main__x~0 86) (<= main_~main__y~0 86) (<= 86 main_~main__y~0)) (and (<= 51 main_~main__y~0) (<= main_~main__x~0 51) (<= 51 main_~main__x~0) (<= main_~main__y~0 51)) (and (<= 85 main_~main__y~0) (<= main_~main__x~0 85) (<= 85 main_~main__x~0) (<= main_~main__y~0 85)) (and (<= main_~main__x~0 92) (<= 92 main_~main__x~0) (<= main_~main__y~0 92) (<= 92 main_~main__y~0)) (and (<= main_~main__x~0 67) (<= 67 main_~main__x~0) (<= main_~main__y~0 67) (<= 67 main_~main__y~0)) (and (<= main_~main__x~0 88) (<= 88 main_~main__x~0) (<= main_~main__y~0 88) (<= 88 main_~main__y~0)) (and (<= main_~main__y~0 83) (<= main_~main__x~0 83) (<= 83 main_~main__x~0) (<= 83 main_~main__y~0))) [2018-11-12 20:44:10,019 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 80) no Hoare annotation was computed. [2018-11-12 20:44:10,019 INFO L425 ceAbstractionStarter]: For program point L32(lines 32 167) no Hoare annotation was computed. [2018-11-12 20:44:10,019 INFO L425 ceAbstractionStarter]: For program point L20(lines 20 191) no Hoare annotation was computed. [2018-11-12 20:44:10,019 INFO L425 ceAbstractionStarter]: For program point L12(lines 12 208) no Hoare annotation was computed. [2018-11-12 20:44:10,019 INFO L421 ceAbstractionStarter]: At program point L202(lines 14 203) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 1)) [2018-11-12 20:44:10,019 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 107) no Hoare annotation was computed. [2018-11-12 20:44:10,019 INFO L421 ceAbstractionStarter]: At program point L190(lines 20 191) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 2)) [2018-11-12 20:44:10,019 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-12 20:44:10,019 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 131) no Hoare annotation was computed. [2018-11-12 20:44:10,020 INFO L421 ceAbstractionStarter]: At program point L178(lines 26 179) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 3)) [2018-11-12 20:44:10,020 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 8 209) no Hoare annotation was computed. [2018-11-12 20:44:10,020 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 155) no Hoare annotation was computed. [2018-11-12 20:44:10,020 INFO L421 ceAbstractionStarter]: At program point L166(lines 32 167) the Hoare annotation is: (and (<= main_~main__x~0 4) (<= main_~main__y~0 50) (<= 50 main_~main__y~0)) [2018-11-12 20:44:10,020 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 8 209) the Hoare annotation is: true [2018-11-12 20:44:10,020 INFO L425 ceAbstractionStarter]: For program point L26(lines 26 179) no Hoare annotation was computed. [2018-11-12 20:44:10,020 INFO L421 ceAbstractionStarter]: At program point L154(lines 38 155) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 5) (<= 50 main_~main__y~0)) [2018-11-12 20:44:10,020 INFO L425 ceAbstractionStarter]: For program point L14(lines 14 203) no Hoare annotation was computed. [2018-11-12 20:44:10,020 INFO L421 ceAbstractionStarter]: At program point L142(lines 44 143) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 6)) [2018-11-12 20:44:10,020 INFO L421 ceAbstractionStarter]: At program point L130(lines 50 131) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 7) (<= 50 main_~main__y~0)) [2018-11-12 20:44:10,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 08:44:10 BoogieIcfgContainer [2018-11-12 20:44:10,046 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 20:44:10,047 INFO L168 Benchmark]: Toolchain (without parser) took 139894.48 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -939.7 MB). Peak memory consumption was 905.5 MB. Max. memory is 7.1 GB. [2018-11-12 20:44:10,048 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:44:10,048 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.81 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-12 20:44:10,049 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.09 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:44:10,049 INFO L168 Benchmark]: Boogie Preprocessor took 25.07 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:44:10,049 INFO L168 Benchmark]: RCFGBuilder took 634.60 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -783.2 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2018-11-12 20:44:10,050 INFO L168 Benchmark]: TraceAbstraction took 138909.27 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 281.0 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -167.0 MB). Peak memory consumption was 927.9 MB. Max. memory is 7.1 GB. [2018-11-12 20:44:10,053 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.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 297.81 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 23.09 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.07 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 634.60 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -783.2 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 138909.27 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 281.0 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -167.0 MB). Peak memory consumption was 927.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: 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: 32]: Loop Invariant Derived loop invariant: (main__x <= 4 && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 8) && 50 <= main__y - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 3 - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 7) && 50 <= main__y - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 2 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 6 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 1 - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 5) && 50 <= main__y - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((56 <= main__x && main__y <= 56) && main__x <= 56) && 56 <= main__y) || (((61 <= main__y && 61 <= main__x) && main__y <= 61) && main__x <= 61)) || (((main__x <= 91 && 91 <= main__x) && main__y <= 91) && 91 <= main__y)) || (((57 <= main__y && main__y <= 57) && 57 <= main__x) && main__x <= 57)) || (((59 <= main__x && main__y <= 59) && main__x <= 59) && 59 <= main__y)) || (((main__y <= 74 && 74 <= main__y) && main__x <= 74) && 74 <= main__x)) || (((75 <= main__y && main__x <= 75) && 75 <= main__x) && main__y <= 75)) || (((main__x <= 58 && main__y <= 58) && 58 <= main__x) && 58 <= main__y)) || (((72 <= main__x && main__y <= 72) && 72 <= main__y) && main__x <= 72)) || (((main__x <= 82 && 82 <= main__x) && main__y <= 82) && 82 <= main__y)) || (((main__y <= 64 && main__x <= 64) && 64 <= main__x) && 64 <= main__y)) || (((main__y <= 53 && 53 <= main__y) && main__x <= 53) && 53 <= main__x)) || (((89 <= main__y && main__y <= 89) && main__x <= 89) && 89 <= main__x)) || (((main__y <= 90 && 90 <= main__y) && 90 <= main__x) && main__x <= 90)) || (((87 <= main__x && main__y <= 87) && main__x <= 87) && 87 <= main__y)) || (((main__x <= 78 && main__y <= 78) && 78 <= main__x) && 78 <= main__y)) || (((main__x <= 95 && main__y <= 95) && 95 <= main__x) && 95 <= main__y)) || (((main__y <= 77 && 77 <= main__y) && main__x <= 77) && 77 <= main__x)) || (((55 <= main__y && main__x <= 55) && main__y <= 55) && 55 <= main__x)) || (((63 <= main__x && main__y <= 63) && main__x <= 63) && 63 <= main__y)) || ((main__y <= 100 && 100 <= main__x) && 100 <= main__y)) || (((76 <= main__x && main__x <= 76) && main__y <= 76) && 76 <= main__y)) || (((79 <= main__x && 79 <= main__y) && main__x <= 79) && main__y <= 79)) || (((main__x <= 80 && main__y <= 80) && 80 <= main__x) && 80 <= main__y)) || (((main__y <= 54 && 54 <= main__y) && 54 <= main__x) && main__x <= 54)) || (((main__x <= 73 && 73 <= main__x) && main__y <= 73) && 73 <= main__y)) || (((main__x <= 52 && main__y <= 52) && 52 <= main__y) && 52 <= main__x)) || (((main__x <= 93 && main__y <= 93) && 93 <= main__y) && 93 <= main__x)) || (((main__y <= 97 && 97 <= main__x) && 97 <= main__y) && main__x <= 97)) || (((main__x <= 94 && 94 <= main__x) && main__y <= 94) && 94 <= main__y)) || (((70 <= main__x && main__y <= 70) && main__x <= 70) && 70 <= main__y)) || (((main__y <= 65 && 65 <= main__y) && main__x <= 65) && 65 <= main__x)) || (((main__y <= 84 && 84 <= main__y) && 84 <= main__x) && main__x <= 84)) || (((main__x <= 66 && main__y <= 66) && 66 <= main__y) && 66 <= main__x)) || (((main__x <= 60 && 60 <= main__x) && 60 <= main__y) && main__y <= 60)) || (((main__x <= 69 && main__y <= 69) && 69 <= main__y) && 69 <= main__x)) || (((main__y <= 71 && 71 <= main__y) && 71 <= main__x) && main__x <= 71)) || ((main__y <= 50 && 50 <= main__y) && main__x <= 50)) || (((62 <= main__y && main__y <= 62) && 62 <= main__x) && main__x <= 62)) || (((main__y <= 68 && 68 <= main__x) && main__x <= 68) && 68 <= main__y)) || (((main__x <= 99 && 99 <= main__x) && main__y <= 99) && 99 <= main__y)) || (((main__x <= 96 && main__y <= 96) && 96 <= main__y) && 96 <= main__x)) || (((main__x <= 81 && main__y <= 81) && 81 <= main__x) && 81 <= main__y)) || (((main__y <= 98 && 98 <= main__y) && main__x <= 98) && 98 <= main__x)) || (((86 <= main__x && main__x <= 86) && main__y <= 86) && 86 <= main__y)) || (((51 <= main__y && main__x <= 51) && 51 <= main__x) && main__y <= 51)) || (((85 <= main__y && main__x <= 85) && 85 <= main__x) && main__y <= 85)) || (((main__x <= 92 && 92 <= main__x) && main__y <= 92) && 92 <= main__y)) || (((main__x <= 67 && 67 <= main__x) && main__y <= 67) && 67 <= main__y)) || (((main__x <= 88 && 88 <= main__x) && main__y <= 88) && 88 <= main__y)) || (((main__y <= 83 && main__x <= 83) && 83 <= main__x) && 83 <= main__y) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 33 locations, 1 error locations. SAFE Result, 138.8s OverallTime, 60 OverallIterations, 92 TraceHistogramMax, 19.5s AutomataDifference, 0.0s DeadEndRemovalTime, 2.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 725 SDtfs, 2076 SDslu, 12241 SDs, 0 SdLazy, 14640 SolverSat, 1886 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14019 GetRequests, 9814 SyntacticMatches, 1134 SemanticMatches, 3071 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129326 ImplicationChecksByTransitivity, 105.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred in iteration=59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 60 MinimizatonAttempts, 21 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 113 NumberOfFragments, 742 HoareAnnotationTreeSize, 13 FomulaSimplifications, 533 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 171 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 110.3s InterpolantComputationTime, 12570 NumberOfCodeBlocks, 12334 NumberOfCodeBlocksAsserted, 754 NumberOfCheckSat, 18490 ConstructedInterpolants, 0 QuantifiedInterpolants, 6182396 SizeOfPredicates, 37 NumberOfNonLiveVariables, 14570 ConjunctsInSsa, 2026 ConjunctsInUnsatCore, 164 InterpolantComputations, 8 PerfectInterpolantSequences, 204938/407627 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...