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.epf -i ../../../trunk/examples/svcomp/loop-new/count_by_nondet_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 05:08:39,665 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 05:08:39,667 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 05:08:39,680 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 05:08:39,680 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 05:08:39,681 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 05:08:39,682 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 05:08:39,684 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 05:08:39,686 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 05:08:39,686 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 05:08:39,687 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 05:08:39,688 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 05:08:39,689 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 05:08:39,690 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 05:08:39,691 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 05:08:39,692 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 05:08:39,693 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 05:08:39,695 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 05:08:39,696 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 05:08:39,698 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 05:08:39,699 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 05:08:39,700 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 05:08:39,703 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 05:08:39,703 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 05:08:39,704 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 05:08:39,704 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 05:08:39,706 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 05:08:39,706 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 05:08:39,707 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 05:08:39,708 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 05:08:39,708 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 05:08:39,709 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 05:08:39,709 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 05:08:39,710 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 05:08:39,711 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 05:08:39,711 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 05:08:39,712 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 05:08:39,741 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 05:08:39,741 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 05:08:39,742 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 05:08:39,742 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 05:08:39,742 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 05:08:39,743 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 05:08:39,743 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 05:08:39,743 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 05:08:39,743 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 05:08:39,743 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 05:08:39,743 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 05:08:39,745 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 05:08:39,746 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 05:08:39,746 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 05:08:39,746 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 05:08:39,747 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 05:08:39,747 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 05:08:39,747 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 05:08:39,747 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 05:08:39,747 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 05:08:39,748 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 05:08:39,748 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 05:08:39,748 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 05:08:39,748 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 05:08:39,748 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 05:08:39,751 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 05:08:39,752 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 05:08:39,752 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 05:08:39,752 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 05:08:39,752 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 05:08:39,752 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 05:08:39,752 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 05:08:39,753 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 05:08:39,753 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 05:08:39,823 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 05:08:39,838 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 05:08:39,842 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 05:08:39,844 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 05:08:39,844 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 05:08:39,845 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/count_by_nondet_true-unreach-call_true-termination.i [2018-11-07 05:08:39,906 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5db11757e/4dc6c405c16e4a6e801dcff5935176f4/FLAG854ef3aed [2018-11-07 05:08:40,332 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 05:08:40,333 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_nondet_true-unreach-call_true-termination.i [2018-11-07 05:08:40,339 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5db11757e/4dc6c405c16e4a6e801dcff5935176f4/FLAG854ef3aed [2018-11-07 05:08:40,360 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5db11757e/4dc6c405c16e4a6e801dcff5935176f4 [2018-11-07 05:08:40,373 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 05:08:40,375 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 05:08:40,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 05:08:40,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 05:08:40,381 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 05:08:40,382 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:08:40" (1/1) ... [2018-11-07 05:08:40,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5367fa28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:08:40, skipping insertion in model container [2018-11-07 05:08:40,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:08:40" (1/1) ... [2018-11-07 05:08:40,397 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 05:08:40,424 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 05:08:40,667 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 05:08:40,671 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 05:08:40,695 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 05:08:40,713 INFO L193 MainTranslator]: Completed translation [2018-11-07 05:08:40,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:08:40 WrapperNode [2018-11-07 05:08:40,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 05:08:40,714 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 05:08:40,714 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 05:08:40,714 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 05:08:40,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:08:40" (1/1) ... [2018-11-07 05:08:40,732 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:08:40" (1/1) ... [2018-11-07 05:08:40,739 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 05:08:40,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 05:08:40,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 05:08:40,740 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 05:08:40,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:08:40" (1/1) ... [2018-11-07 05:08:40,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:08:40" (1/1) ... [2018-11-07 05:08:40,752 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:08:40" (1/1) ... [2018-11-07 05:08:40,752 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:08:40" (1/1) ... [2018-11-07 05:08:40,757 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:08:40" (1/1) ... [2018-11-07 05:08:40,763 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:08:40" (1/1) ... [2018-11-07 05:08:40,764 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:08:40" (1/1) ... [2018-11-07 05:08:40,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 05:08:40,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 05:08:40,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 05:08:40,767 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 05:08:40,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:08:40" (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-07 05:08:40,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 05:08:40,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 05:08:40,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 05:08:40,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 05:08:40,944 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 05:08:40,944 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 05:08:40,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 05:08:40,945 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 05:08:41,179 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 05:08:41,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:08:41 BoogieIcfgContainer [2018-11-07 05:08:41,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 05:08:41,181 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 05:08:41,181 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 05:08:41,184 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 05:08:41,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:08:40" (1/3) ... [2018-11-07 05:08:41,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d60aced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:08:41, skipping insertion in model container [2018-11-07 05:08:41,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:08:40" (2/3) ... [2018-11-07 05:08:41,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d60aced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:08:41, skipping insertion in model container [2018-11-07 05:08:41,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:08:41" (3/3) ... [2018-11-07 05:08:41,188 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_nondet_true-unreach-call_true-termination.i [2018-11-07 05:08:41,199 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 05:08:41,208 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 05:08:41,235 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 05:08:41,306 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 05:08:41,307 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 05:08:41,307 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 05:08:41,307 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 05:08:41,307 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 05:08:41,307 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 05:08:41,307 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 05:08:41,308 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 05:08:41,327 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-07 05:08:41,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-07 05:08:41,334 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:08:41,335 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:08:41,337 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:08:41,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:08:41,344 INFO L82 PathProgramCache]: Analyzing trace with hash -722424895, now seen corresponding path program 1 times [2018-11-07 05:08:41,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:08:41,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:41,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:08:41,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:41,401 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:08:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:08:41,453 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-07 05:08:41,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:08:41,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 05:08:41,456 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:08:41,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 05:08:41,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 05:08:41,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 05:08:41,479 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-07 05:08:41,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:08:41,502 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-07 05:08:41,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 05:08:41,504 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-07 05:08:41,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:08:41,513 INFO L225 Difference]: With dead ends: 32 [2018-11-07 05:08:41,513 INFO L226 Difference]: Without dead ends: 13 [2018-11-07 05:08:41,517 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 05:08:41,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-07 05:08:41,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-07 05:08:41,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-07 05:08:41,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-07 05:08:41,551 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-11-07 05:08:41,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:08:41,552 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-07 05:08:41,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 05:08:41,552 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-07 05:08:41,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-07 05:08:41,553 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:08:41,553 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:08:41,553 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:08:41,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:08:41,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1289299715, now seen corresponding path program 1 times [2018-11-07 05:08:41,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:08:41,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:41,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:08:41,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:41,556 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:08:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:08:41,618 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-07 05:08:41,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:08:41,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 05:08:41,619 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:08:41,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 05:08:41,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 05:08:41,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 05:08:41,621 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 3 states. [2018-11-07 05:08:41,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:08:41,655 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-07 05:08:41,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 05:08:41,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-07 05:08:41,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:08:41,657 INFO L225 Difference]: With dead ends: 21 [2018-11-07 05:08:41,657 INFO L226 Difference]: Without dead ends: 16 [2018-11-07 05:08:41,658 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-07 05:08:41,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-07 05:08:41,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-07 05:08:41,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-07 05:08:41,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-07 05:08:41,663 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2018-11-07 05:08:41,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:08:41,664 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-07 05:08:41,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 05:08:41,664 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-07 05:08:41,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-07 05:08:41,665 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:08:41,665 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:08:41,665 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:08:41,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:08:41,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1003978365, now seen corresponding path program 1 times [2018-11-07 05:08:41,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:08:41,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:41,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:08:41,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:41,667 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:08:41,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:08:41,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:41,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:41,729 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:08:41,730 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-11-07 05:08:41,732 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [18], [25], [28], [30], [36], [37], [38], [40] [2018-11-07 05:08:41,788 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:08:41,788 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:08:42,213 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 05:08:42,214 INFO L272 AbstractInterpreter]: Visited 13 different actions 96 times. Merged at 4 different actions 46 times. Widened at 1 different actions 8 times. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2018-11-07 05:08:42,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:08:42,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 05:08:42,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:42,254 INFO L194 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-07 05:08:42,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:08:42,270 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:08:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:08:42,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:08:42,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:42,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:08:42,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:42,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:08:42,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2018-11-07 05:08:42,444 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:08:42,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 05:08:42,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 05:08:42,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 05:08:42,445 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 4 states. [2018-11-07 05:08:42,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:08:42,515 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-07 05:08:42,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 05:08:42,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-07 05:08:42,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:08:42,517 INFO L225 Difference]: With dead ends: 23 [2018-11-07 05:08:42,517 INFO L226 Difference]: Without dead ends: 18 [2018-11-07 05:08:42,517 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 05:08:42,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-07 05:08:42,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-07 05:08:42,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-07 05:08:42,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-07 05:08:42,522 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 14 [2018-11-07 05:08:42,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:08:42,522 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-07 05:08:42,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 05:08:42,523 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-07 05:08:42,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 05:08:42,523 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:08:42,524 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:08:42,524 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:08:42,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:08:42,524 INFO L82 PathProgramCache]: Analyzing trace with hash 6482173, now seen corresponding path program 2 times [2018-11-07 05:08:42,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:08:42,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:42,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:08:42,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:42,526 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:08:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:08:42,666 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:42,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:42,667 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:08:42,667 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:08:42,667 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:08:42,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:42,668 INFO L194 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-07 05:08:42,684 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:08:42,685 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:08:42,720 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 05:08:42,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:08:42,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:08:42,822 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:42,822 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:08:43,182 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:43,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:08:43,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-07 05:08:43,203 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:08:43,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 05:08:43,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 05:08:43,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-07 05:08:43,204 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 7 states. [2018-11-07 05:08:43,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:08:43,265 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-07 05:08:43,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 05:08:43,266 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-11-07 05:08:43,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:08:43,267 INFO L225 Difference]: With dead ends: 27 [2018-11-07 05:08:43,268 INFO L226 Difference]: Without dead ends: 22 [2018-11-07 05:08:43,269 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-11-07 05:08:43,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-07 05:08:43,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-07 05:08:43,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-07 05:08:43,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-07 05:08:43,274 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 17 [2018-11-07 05:08:43,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:08:43,274 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-07 05:08:43,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 05:08:43,274 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-07 05:08:43,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-07 05:08:43,275 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:08:43,275 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:08:43,276 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:08:43,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:08:43,276 INFO L82 PathProgramCache]: Analyzing trace with hash 476147325, now seen corresponding path program 3 times [2018-11-07 05:08:43,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:08:43,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:43,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:08:43,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:43,278 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:08:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:08:43,537 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:43,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:43,537 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:08:43,537 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:08:43,538 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:08:43,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:43,538 INFO L194 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-07 05:08:43,546 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:08:43,547 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:08:43,564 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:08:43,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:08:43,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:08:43,601 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:43,601 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:08:43,738 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:43,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:08:43,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-11-07 05:08:43,765 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:08:43,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 05:08:43,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 05:08:43,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-11-07 05:08:43,767 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 8 states. [2018-11-07 05:08:43,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:08:43,989 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-07 05:08:43,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 05:08:43,991 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-07 05:08:43,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:08:43,992 INFO L225 Difference]: With dead ends: 30 [2018-11-07 05:08:43,992 INFO L226 Difference]: Without dead ends: 25 [2018-11-07 05:08:43,993 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2018-11-07 05:08:43,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-07 05:08:43,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-07 05:08:44,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-07 05:08:44,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-07 05:08:44,002 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 20 [2018-11-07 05:08:44,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:08:44,003 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-07 05:08:44,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 05:08:44,003 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-07 05:08:44,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 05:08:44,004 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:08:44,004 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:08:44,004 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:08:44,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:08:44,007 INFO L82 PathProgramCache]: Analyzing trace with hash -732759811, now seen corresponding path program 4 times [2018-11-07 05:08:44,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:08:44,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:44,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:08:44,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:44,008 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:08:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:08:44,190 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:44,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:44,191 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:08:44,192 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:08:44,192 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:08:44,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:44,193 INFO L194 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-07 05:08:44,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:08:44,204 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:08:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:08:44,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:08:44,251 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:44,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:08:44,388 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:44,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:08:44,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-11-07 05:08:44,409 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:08:44,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 05:08:44,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 05:08:44,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2018-11-07 05:08:44,411 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 9 states. [2018-11-07 05:08:44,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:08:44,466 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-07 05:08:44,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 05:08:44,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-07 05:08:44,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:08:44,468 INFO L225 Difference]: With dead ends: 33 [2018-11-07 05:08:44,468 INFO L226 Difference]: Without dead ends: 28 [2018-11-07 05:08:44,469 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-11-07 05:08:44,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-07 05:08:44,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-07 05:08:44,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-07 05:08:44,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-07 05:08:44,474 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 23 [2018-11-07 05:08:44,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:08:44,474 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-07 05:08:44,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 05:08:44,475 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-07 05:08:44,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-07 05:08:44,476 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:08:44,476 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:08:44,476 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:08:44,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:08:44,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1984471427, now seen corresponding path program 5 times [2018-11-07 05:08:44,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:08:44,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:44,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:08:44,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:44,478 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:08:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:08:44,670 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:44,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:44,671 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:08:44,671 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:08:44,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:08:44,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:44,672 INFO L194 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-07 05:08:44,681 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:08:44,681 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:08:44,771 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 05:08:44,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:08:44,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:08:44,872 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:44,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:08:45,166 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:45,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:08:45,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2018-11-07 05:08:45,195 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:08:45,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 05:08:45,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 05:08:45,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2018-11-07 05:08:45,196 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 10 states. [2018-11-07 05:08:45,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:08:45,247 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-07 05:08:45,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 05:08:45,248 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-11-07 05:08:45,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:08:45,249 INFO L225 Difference]: With dead ends: 36 [2018-11-07 05:08:45,249 INFO L226 Difference]: Without dead ends: 31 [2018-11-07 05:08:45,249 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-11-07 05:08:45,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-07 05:08:45,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-07 05:08:45,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-07 05:08:45,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-07 05:08:45,255 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 26 [2018-11-07 05:08:45,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:08:45,256 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-07 05:08:45,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 05:08:45,256 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-07 05:08:45,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 05:08:45,257 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:08:45,257 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:08:45,257 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:08:45,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:08:45,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1475807485, now seen corresponding path program 6 times [2018-11-07 05:08:45,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:08:45,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:45,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:08:45,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:45,259 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:08:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:08:45,424 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:45,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:45,424 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:08:45,425 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:08:45,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:08:45,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:45,425 INFO L194 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-07 05:08:45,434 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:08:45,434 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:08:45,475 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:08:45,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:08:45,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:08:45,503 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:45,503 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:08:45,704 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:45,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:08:45,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2018-11-07 05:08:45,726 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:08:45,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 05:08:45,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 05:08:45,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2018-11-07 05:08:45,728 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 11 states. [2018-11-07 05:08:45,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:08:45,801 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-07 05:08:45,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 05:08:45,802 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-11-07 05:08:45,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:08:45,803 INFO L225 Difference]: With dead ends: 39 [2018-11-07 05:08:45,803 INFO L226 Difference]: Without dead ends: 34 [2018-11-07 05:08:45,803 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2018-11-07 05:08:45,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-07 05:08:45,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-07 05:08:45,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-07 05:08:45,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-07 05:08:45,808 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 29 [2018-11-07 05:08:45,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:08:45,809 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-07 05:08:45,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 05:08:45,809 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-07 05:08:45,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-07 05:08:45,810 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:08:45,810 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:08:45,810 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:08:45,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:08:45,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1160163715, now seen corresponding path program 7 times [2018-11-07 05:08:45,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:08:45,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:45,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:08:45,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:45,812 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:08:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:08:46,130 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:46,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:46,131 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:08:46,131 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:08:46,132 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:08:46,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:46,132 INFO L194 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-07 05:08:46,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:08:46,142 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:08:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:08:46,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:08:46,203 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:46,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:08:46,413 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:46,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:08:46,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-11-07 05:08:46,435 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:08:46,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 05:08:46,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 05:08:46,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=299, Unknown=0, NotChecked=0, Total=462 [2018-11-07 05:08:46,436 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 12 states. [2018-11-07 05:08:46,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:08:46,624 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-07 05:08:46,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 05:08:46,624 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-11-07 05:08:46,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:08:46,626 INFO L225 Difference]: With dead ends: 42 [2018-11-07 05:08:46,626 INFO L226 Difference]: Without dead ends: 37 [2018-11-07 05:08:46,627 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2018-11-07 05:08:46,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-07 05:08:46,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-07 05:08:46,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-07 05:08:46,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-11-07 05:08:46,632 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 32 [2018-11-07 05:08:46,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:08:46,632 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-11-07 05:08:46,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 05:08:46,633 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-07 05:08:46,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-07 05:08:46,634 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:08:46,634 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:08:46,634 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:08:46,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:08:46,634 INFO L82 PathProgramCache]: Analyzing trace with hash -196142851, now seen corresponding path program 8 times [2018-11-07 05:08:46,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:08:46,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:46,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:08:46,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:46,636 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:08:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:08:46,785 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:46,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:46,786 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:08:46,786 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:08:46,786 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:08:46,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:46,787 INFO L194 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-07 05:08:46,800 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:08:46,800 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:08:46,824 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 05:08:46,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:08:46,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:08:46,863 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:46,863 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:08:47,118 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:47,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:08:47,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-11-07 05:08:47,139 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:08:47,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 05:08:47,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 05:08:47,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2018-11-07 05:08:47,140 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 13 states. [2018-11-07 05:08:47,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:08:47,235 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-07 05:08:47,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 05:08:47,235 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2018-11-07 05:08:47,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:08:47,236 INFO L225 Difference]: With dead ends: 45 [2018-11-07 05:08:47,237 INFO L226 Difference]: Without dead ends: 40 [2018-11-07 05:08:47,238 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=206, Invalid=394, Unknown=0, NotChecked=0, Total=600 [2018-11-07 05:08:47,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-07 05:08:47,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-07 05:08:47,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-07 05:08:47,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-11-07 05:08:47,243 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 35 [2018-11-07 05:08:47,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:08:47,243 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-11-07 05:08:47,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 05:08:47,244 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-07 05:08:47,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-07 05:08:47,245 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:08:47,245 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:08:47,245 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:08:47,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:08:47,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1496891779, now seen corresponding path program 9 times [2018-11-07 05:08:47,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:08:47,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:47,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:08:47,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:47,247 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:08:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:08:47,399 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:47,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:47,400 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:08:47,400 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:08:47,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:08:47,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:47,401 INFO L194 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-07 05:08:47,412 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:08:47,412 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:08:47,457 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:08:47,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:08:47,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:08:47,562 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:47,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:08:47,905 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:47,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:08:47,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2018-11-07 05:08:47,924 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:08:47,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 05:08:47,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 05:08:47,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=409, Unknown=0, NotChecked=0, Total=650 [2018-11-07 05:08:47,926 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 14 states. [2018-11-07 05:08:47,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:08:47,970 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-07 05:08:47,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 05:08:47,971 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2018-11-07 05:08:47,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:08:47,972 INFO L225 Difference]: With dead ends: 48 [2018-11-07 05:08:47,973 INFO L226 Difference]: Without dead ends: 43 [2018-11-07 05:08:47,974 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=247, Invalid=455, Unknown=0, NotChecked=0, Total=702 [2018-11-07 05:08:47,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-07 05:08:47,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-11-07 05:08:47,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-07 05:08:47,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-11-07 05:08:47,978 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 38 [2018-11-07 05:08:47,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:08:47,979 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-11-07 05:08:47,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 05:08:47,979 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-07 05:08:47,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 05:08:47,981 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:08:47,981 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:08:47,981 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:08:47,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:08:47,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1381705981, now seen corresponding path program 10 times [2018-11-07 05:08:47,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:08:47,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:47,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:08:47,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:47,983 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:08:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:08:48,372 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:48,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:48,372 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:08:48,373 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:08:48,373 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:08:48,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:48,373 INFO L194 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-07 05:08:48,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:08:48,383 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:08:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:08:48,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:08:48,445 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:48,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:08:48,748 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:48,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:08:48,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2018-11-07 05:08:48,771 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:08:48,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 05:08:48,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 05:08:48,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=470, Unknown=0, NotChecked=0, Total=756 [2018-11-07 05:08:48,772 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 15 states. [2018-11-07 05:08:48,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:08:48,832 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-11-07 05:08:48,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 05:08:48,832 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-11-07 05:08:48,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:08:48,833 INFO L225 Difference]: With dead ends: 51 [2018-11-07 05:08:48,833 INFO L226 Difference]: Without dead ends: 46 [2018-11-07 05:08:48,834 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=292, Invalid=520, Unknown=0, NotChecked=0, Total=812 [2018-11-07 05:08:48,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-07 05:08:48,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-11-07 05:08:48,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-07 05:08:48,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-11-07 05:08:48,839 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 41 [2018-11-07 05:08:48,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:08:48,839 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-11-07 05:08:48,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 05:08:48,840 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-11-07 05:08:48,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-07 05:08:48,841 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:08:48,841 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:08:48,841 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:08:48,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:08:48,841 INFO L82 PathProgramCache]: Analyzing trace with hash 75574909, now seen corresponding path program 11 times [2018-11-07 05:08:48,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:08:48,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:48,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:08:48,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:48,843 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:08:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:08:49,047 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:49,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:49,047 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:08:49,047 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:08:49,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:08:49,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:49,048 INFO L194 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-07 05:08:49,057 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:08:49,057 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:08:49,093 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 05:08:49,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:08:49,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:08:49,310 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:49,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:08:49,915 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:49,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:08:49,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2018-11-07 05:08:49,935 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:08:49,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 05:08:49,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 05:08:49,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=535, Unknown=0, NotChecked=0, Total=870 [2018-11-07 05:08:49,936 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 16 states. [2018-11-07 05:08:50,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:08:50,024 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-07 05:08:50,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 05:08:50,024 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-11-07 05:08:50,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:08:50,026 INFO L225 Difference]: With dead ends: 54 [2018-11-07 05:08:50,026 INFO L226 Difference]: Without dead ends: 49 [2018-11-07 05:08:50,027 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=341, Invalid=589, Unknown=0, NotChecked=0, Total=930 [2018-11-07 05:08:50,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-07 05:08:50,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-11-07 05:08:50,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 05:08:50,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-11-07 05:08:50,033 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 44 [2018-11-07 05:08:50,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:08:50,033 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-11-07 05:08:50,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 05:08:50,034 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-11-07 05:08:50,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-07 05:08:50,034 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:08:50,035 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:08:50,035 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:08:50,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:08:50,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1528510717, now seen corresponding path program 12 times [2018-11-07 05:08:50,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:08:50,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:50,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:08:50,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:50,037 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:08:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:08:50,283 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:50,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:50,284 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:08:50,284 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:08:50,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:08:50,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:50,284 INFO L194 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-07 05:08:50,294 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:08:50,295 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:08:50,329 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:08:50,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:08:50,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:08:50,483 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:50,483 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:08:50,773 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:50,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:08:50,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2018-11-07 05:08:50,796 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:08:50,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 05:08:50,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 05:08:50,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=604, Unknown=0, NotChecked=0, Total=992 [2018-11-07 05:08:50,798 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 17 states. [2018-11-07 05:08:50,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:08:50,874 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-07 05:08:50,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 05:08:50,875 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-11-07 05:08:50,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:08:50,876 INFO L225 Difference]: With dead ends: 57 [2018-11-07 05:08:50,876 INFO L226 Difference]: Without dead ends: 52 [2018-11-07 05:08:50,878 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=394, Invalid=662, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 05:08:50,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-07 05:08:50,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-07 05:08:50,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-07 05:08:50,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-11-07 05:08:50,883 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 47 [2018-11-07 05:08:50,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:08:50,883 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-11-07 05:08:50,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 05:08:50,884 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-11-07 05:08:50,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-07 05:08:50,885 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:08:50,885 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:08:50,885 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:08:50,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:08:50,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1258757757, now seen corresponding path program 13 times [2018-11-07 05:08:50,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:08:50,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:50,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:08:50,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:50,886 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:08:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:08:51,309 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:51,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:51,309 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:08:51,309 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:08:51,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:08:51,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:51,310 INFO L194 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-07 05:08:51,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:08:51,321 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:08:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:08:51,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:08:51,393 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:51,394 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:08:51,753 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:51,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:08:51,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2018-11-07 05:08:51,773 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:08:51,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 05:08:51,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 05:08:51,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=677, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 05:08:51,775 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 18 states. [2018-11-07 05:08:51,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:08:51,818 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-11-07 05:08:51,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 05:08:51,819 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 50 [2018-11-07 05:08:51,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:08:51,820 INFO L225 Difference]: With dead ends: 60 [2018-11-07 05:08:51,820 INFO L226 Difference]: Without dead ends: 55 [2018-11-07 05:08:51,821 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=451, Invalid=739, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 05:08:51,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-07 05:08:51,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-11-07 05:08:51,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-07 05:08:51,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-11-07 05:08:51,826 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 50 [2018-11-07 05:08:51,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:08:51,827 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-11-07 05:08:51,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 05:08:51,827 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-07 05:08:51,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-07 05:08:51,828 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:08:51,828 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:08:51,828 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:08:51,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:08:51,829 INFO L82 PathProgramCache]: Analyzing trace with hash 932137213, now seen corresponding path program 14 times [2018-11-07 05:08:51,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:08:51,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:51,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:08:51,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:51,830 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:08:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:08:52,049 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:52,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:52,049 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:08:52,049 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:08:52,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:08:52,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:52,050 INFO L194 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-07 05:08:52,059 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:08:52,060 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:08:52,088 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-07 05:08:52,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:08:52,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:08:52,195 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:52,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:08:52,954 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:52,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:08:52,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2018-11-07 05:08:52,974 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:08:52,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 05:08:52,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 05:08:52,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=506, Invalid=754, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 05:08:52,975 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 19 states. [2018-11-07 05:08:53,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:08:53,096 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-11-07 05:08:53,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 05:08:53,097 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 53 [2018-11-07 05:08:53,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:08:53,097 INFO L225 Difference]: With dead ends: 63 [2018-11-07 05:08:53,098 INFO L226 Difference]: Without dead ends: 58 [2018-11-07 05:08:53,099 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=512, Invalid=820, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 05:08:53,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-07 05:08:53,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-11-07 05:08:53,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-07 05:08:53,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-11-07 05:08:53,103 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 53 [2018-11-07 05:08:53,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:08:53,104 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-11-07 05:08:53,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 05:08:53,104 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-07 05:08:53,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-07 05:08:53,105 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:08:53,105 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:08:53,105 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:08:53,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:08:53,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1319563651, now seen corresponding path program 15 times [2018-11-07 05:08:53,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:08:53,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:53,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:08:53,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:53,107 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:08:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:08:53,346 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:53,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:53,346 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:08:53,346 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:08:53,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:08:53,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:53,347 INFO L194 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-07 05:08:53,355 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:08:53,355 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:08:53,381 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:08:53,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:08:53,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:08:53,462 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:53,462 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:08:54,403 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:54,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:08:54,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 38 [2018-11-07 05:08:54,424 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:08:54,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 05:08:54,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 05:08:54,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=835, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 05:08:54,425 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 20 states. [2018-11-07 05:08:54,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:08:54,552 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-11-07 05:08:54,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 05:08:54,552 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2018-11-07 05:08:54,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:08:54,553 INFO L225 Difference]: With dead ends: 66 [2018-11-07 05:08:54,553 INFO L226 Difference]: Without dead ends: 61 [2018-11-07 05:08:54,554 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=577, Invalid=905, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 05:08:54,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-07 05:08:54,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-11-07 05:08:54,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-07 05:08:54,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-11-07 05:08:54,559 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 56 [2018-11-07 05:08:54,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:08:54,560 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-11-07 05:08:54,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 05:08:54,560 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-11-07 05:08:54,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 05:08:54,561 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:08:54,561 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:08:54,561 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:08:54,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:08:54,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1354193149, now seen corresponding path program 16 times [2018-11-07 05:08:54,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:08:54,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:54,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:08:54,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:54,563 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:08:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:08:55,185 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:55,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:55,186 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:08:55,186 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:08:55,186 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:08:55,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:55,186 INFO L194 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-07 05:08:55,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:08:55,195 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:08:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:08:55,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:08:55,328 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:55,328 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:08:56,377 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:56,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:08:56,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2018-11-07 05:08:56,397 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:08:56,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 05:08:56,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 05:08:56,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=640, Invalid=920, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 05:08:56,398 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 21 states. [2018-11-07 05:08:56,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:08:56,475 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-11-07 05:08:56,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 05:08:56,475 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 59 [2018-11-07 05:08:56,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:08:56,476 INFO L225 Difference]: With dead ends: 69 [2018-11-07 05:08:56,477 INFO L226 Difference]: Without dead ends: 64 [2018-11-07 05:08:56,478 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=646, Invalid=994, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 05:08:56,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-07 05:08:56,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-11-07 05:08:56,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-07 05:08:56,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-11-07 05:08:56,482 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 59 [2018-11-07 05:08:56,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:08:56,483 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-11-07 05:08:56,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 05:08:56,483 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-11-07 05:08:56,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-07 05:08:56,484 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:08:56,484 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:08:56,484 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:08:56,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:08:56,485 INFO L82 PathProgramCache]: Analyzing trace with hash 779550333, now seen corresponding path program 17 times [2018-11-07 05:08:56,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:08:56,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:56,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:08:56,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:56,486 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:08:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:08:56,849 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:56,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:56,850 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:08:56,850 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:08:56,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:08:56,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:56,850 INFO L194 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-07 05:08:56,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:08:56,858 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:08:56,898 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-07 05:08:56,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:08:56,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:08:56,919 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:56,919 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:08:57,386 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:57,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:08:57,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2018-11-07 05:08:57,406 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:08:57,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 05:08:57,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 05:08:57,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=713, Invalid=1009, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 05:08:57,407 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 22 states. [2018-11-07 05:08:57,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:08:57,454 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-11-07 05:08:57,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 05:08:57,455 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 62 [2018-11-07 05:08:57,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:08:57,456 INFO L225 Difference]: With dead ends: 72 [2018-11-07 05:08:57,456 INFO L226 Difference]: Without dead ends: 67 [2018-11-07 05:08:57,458 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=719, Invalid=1087, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 05:08:57,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-07 05:08:57,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-11-07 05:08:57,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-07 05:08:57,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-11-07 05:08:57,462 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 62 [2018-11-07 05:08:57,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:08:57,463 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-11-07 05:08:57,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 05:08:57,463 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-11-07 05:08:57,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-07 05:08:57,464 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:08:57,464 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:08:57,464 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:08:57,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:08:57,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1335060733, now seen corresponding path program 18 times [2018-11-07 05:08:57,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:08:57,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:57,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:08:57,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:57,466 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:08:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:08:58,330 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:58,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:58,331 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:08:58,331 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:08:58,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:08:58,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:58,331 INFO L194 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-07 05:08:58,340 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:08:58,340 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:08:58,372 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:08:58,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:08:58,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:08:58,393 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:58,393 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:08:58,928 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:58,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:08:58,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 44 [2018-11-07 05:08:58,949 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:08:58,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 05:08:58,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 05:08:58,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=790, Invalid=1102, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 05:08:58,951 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 23 states. [2018-11-07 05:08:59,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:08:59,010 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-11-07 05:08:59,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 05:08:59,010 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 65 [2018-11-07 05:08:59,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:08:59,011 INFO L225 Difference]: With dead ends: 75 [2018-11-07 05:08:59,011 INFO L226 Difference]: Without dead ends: 70 [2018-11-07 05:08:59,012 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=796, Invalid=1184, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 05:08:59,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-07 05:08:59,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-11-07 05:08:59,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-07 05:08:59,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-11-07 05:08:59,017 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 65 [2018-11-07 05:08:59,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:08:59,018 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-11-07 05:08:59,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 05:08:59,018 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-11-07 05:08:59,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-07 05:08:59,019 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:08:59,019 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:08:59,019 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:08:59,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:08:59,019 INFO L82 PathProgramCache]: Analyzing trace with hash 2036395645, now seen corresponding path program 19 times [2018-11-07 05:08:59,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:08:59,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:59,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:08:59,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:08:59,021 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:08:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:08:59,302 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:59,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:59,303 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:08:59,303 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:08:59,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:08:59,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:08:59,303 INFO L194 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-07 05:08:59,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:08:59,312 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:08:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:08:59,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:08:59,391 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:59,392 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:08:59,913 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:08:59,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:08:59,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 46 [2018-11-07 05:08:59,933 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:08:59,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 05:08:59,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 05:08:59,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=871, Invalid=1199, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 05:08:59,935 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 24 states. [2018-11-07 05:08:59,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:09:00,000 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-11-07 05:09:00,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 05:09:00,000 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 68 [2018-11-07 05:09:00,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:09:00,001 INFO L225 Difference]: With dead ends: 78 [2018-11-07 05:09:00,001 INFO L226 Difference]: Without dead ends: 73 [2018-11-07 05:09:00,003 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=877, Invalid=1285, Unknown=0, NotChecked=0, Total=2162 [2018-11-07 05:09:00,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-07 05:09:00,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-11-07 05:09:00,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-07 05:09:00,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-11-07 05:09:00,006 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 68 [2018-11-07 05:09:00,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:09:00,007 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-11-07 05:09:00,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 05:09:00,007 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-11-07 05:09:00,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-07 05:09:00,008 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:09:00,008 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:09:00,008 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:09:00,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:00,008 INFO L82 PathProgramCache]: Analyzing trace with hash 488863997, now seen corresponding path program 20 times [2018-11-07 05:09:00,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:09:00,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:00,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:09:00,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:00,010 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:09:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:00,371 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:00,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:00,372 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:09:00,372 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:09:00,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:09:00,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:00,372 INFO L194 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-07 05:09:00,381 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:09:00,381 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:09:00,427 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-07 05:09:00,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:09:00,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:09:00,604 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:00,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:09:01,590 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:01,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:09:01,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2018-11-07 05:09:01,611 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:09:01,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 05:09:01,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 05:09:01,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=956, Invalid=1300, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 05:09:01,612 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 25 states. [2018-11-07 05:09:01,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:09:01,683 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-11-07 05:09:01,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 05:09:01,686 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 71 [2018-11-07 05:09:01,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:09:01,687 INFO L225 Difference]: With dead ends: 81 [2018-11-07 05:09:01,687 INFO L226 Difference]: Without dead ends: 76 [2018-11-07 05:09:01,688 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=962, Invalid=1390, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 05:09:01,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-07 05:09:01,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-11-07 05:09:01,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-07 05:09:01,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-11-07 05:09:01,691 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 71 [2018-11-07 05:09:01,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:09:01,692 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-11-07 05:09:01,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 05:09:01,692 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-11-07 05:09:01,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-07 05:09:01,693 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:09:01,693 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:09:01,693 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:09:01,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:01,693 INFO L82 PathProgramCache]: Analyzing trace with hash 152493693, now seen corresponding path program 21 times [2018-11-07 05:09:01,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:09:01,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:01,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:09:01,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:01,695 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:09:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:02,066 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:02,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:02,066 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:09:02,066 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:09:02,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:09:02,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:02,067 INFO L194 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-07 05:09:02,075 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:09:02,075 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:09:02,121 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:09:02,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:09:02,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:09:02,156 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:02,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:09:02,769 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:02,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:09:02,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 50 [2018-11-07 05:09:02,789 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:09:02,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 05:09:02,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 05:09:02,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1045, Invalid=1405, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 05:09:02,791 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 26 states. [2018-11-07 05:09:02,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:09:02,908 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-11-07 05:09:02,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 05:09:02,909 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 74 [2018-11-07 05:09:02,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:09:02,910 INFO L225 Difference]: With dead ends: 84 [2018-11-07 05:09:02,910 INFO L226 Difference]: Without dead ends: 79 [2018-11-07 05:09:02,912 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1051, Invalid=1499, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 05:09:02,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-07 05:09:02,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-11-07 05:09:02,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-07 05:09:02,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-11-07 05:09:02,915 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 74 [2018-11-07 05:09:02,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:09:02,915 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-11-07 05:09:02,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 05:09:02,915 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-11-07 05:09:02,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-07 05:09:02,916 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:09:02,916 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:09:02,917 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:09:02,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:02,917 INFO L82 PathProgramCache]: Analyzing trace with hash -496531203, now seen corresponding path program 22 times [2018-11-07 05:09:02,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:09:02,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:02,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:09:02,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:02,918 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:09:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:03,511 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:03,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:03,512 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:09:03,512 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:09:03,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:09:03,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:03,512 INFO L194 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-07 05:09:03,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:09:03,522 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:09:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:03,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:09:03,586 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:03,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:09:04,251 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:04,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:09:04,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 52 [2018-11-07 05:09:04,271 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:09:04,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 05:09:04,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 05:09:04,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1138, Invalid=1514, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 05:09:04,272 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 27 states. [2018-11-07 05:09:04,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:09:04,327 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-11-07 05:09:04,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 05:09:04,327 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 77 [2018-11-07 05:09:04,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:09:04,328 INFO L225 Difference]: With dead ends: 87 [2018-11-07 05:09:04,328 INFO L226 Difference]: Without dead ends: 82 [2018-11-07 05:09:04,330 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1144, Invalid=1612, Unknown=0, NotChecked=0, Total=2756 [2018-11-07 05:09:04,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-07 05:09:04,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-11-07 05:09:04,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-07 05:09:04,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-11-07 05:09:04,333 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 77 [2018-11-07 05:09:04,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:09:04,334 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-11-07 05:09:04,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 05:09:04,334 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-11-07 05:09:04,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-07 05:09:04,335 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:09:04,335 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:09:04,335 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:09:04,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:04,335 INFO L82 PathProgramCache]: Analyzing trace with hash 345558653, now seen corresponding path program 23 times [2018-11-07 05:09:04,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:09:04,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:04,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:09:04,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:04,336 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:09:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:05,053 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:05,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:05,054 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:09:05,054 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:09:05,054 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:09:05,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:05,054 INFO L194 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-07 05:09:05,063 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:09:05,063 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:09:05,108 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-11-07 05:09:05,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:09:05,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:09:05,183 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:05,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:09:05,918 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:05,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:09:05,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 54 [2018-11-07 05:09:05,938 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:09:05,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 05:09:05,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 05:09:05,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1235, Invalid=1627, Unknown=0, NotChecked=0, Total=2862 [2018-11-07 05:09:05,939 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 28 states. [2018-11-07 05:09:06,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:09:06,009 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-11-07 05:09:06,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 05:09:06,012 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 80 [2018-11-07 05:09:06,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:09:06,012 INFO L225 Difference]: With dead ends: 90 [2018-11-07 05:09:06,012 INFO L226 Difference]: Without dead ends: 85 [2018-11-07 05:09:06,013 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1241, Invalid=1729, Unknown=0, NotChecked=0, Total=2970 [2018-11-07 05:09:06,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-07 05:09:06,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-11-07 05:09:06,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-07 05:09:06,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-11-07 05:09:06,017 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 80 [2018-11-07 05:09:06,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:09:06,017 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-11-07 05:09:06,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 05:09:06,017 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-11-07 05:09:06,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-07 05:09:06,018 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:09:06,018 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:09:06,018 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:09:06,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:06,019 INFO L82 PathProgramCache]: Analyzing trace with hash 140482813, now seen corresponding path program 24 times [2018-11-07 05:09:06,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:09:06,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:06,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:09:06,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:06,020 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:09:06,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:06,679 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:06,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:06,680 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:09:06,680 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:09:06,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:09:06,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:06,680 INFO L194 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-07 05:09:06,688 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:09:06,688 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:09:06,737 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:09:06,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:09:06,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:09:06,804 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:06,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:09:07,538 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:07,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:09:07,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 56 [2018-11-07 05:09:07,558 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:09:07,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-07 05:09:07,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-07 05:09:07,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1336, Invalid=1744, Unknown=0, NotChecked=0, Total=3080 [2018-11-07 05:09:07,560 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 29 states. [2018-11-07 05:09:07,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:09:07,624 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-11-07 05:09:07,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 05:09:07,624 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 83 [2018-11-07 05:09:07,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:09:07,626 INFO L225 Difference]: With dead ends: 93 [2018-11-07 05:09:07,626 INFO L226 Difference]: Without dead ends: 88 [2018-11-07 05:09:07,627 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1342, Invalid=1850, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 05:09:07,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-07 05:09:07,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-11-07 05:09:07,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-07 05:09:07,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-11-07 05:09:07,631 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 83 [2018-11-07 05:09:07,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:09:07,631 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-11-07 05:09:07,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-07 05:09:07,631 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-11-07 05:09:07,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-07 05:09:07,631 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:09:07,631 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:09:07,632 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:09:07,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:07,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1830371715, now seen corresponding path program 25 times [2018-11-07 05:09:07,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:09:07,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:07,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:09:07,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:07,633 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:09:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:08,072 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:08,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:08,072 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:09:08,072 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:09:08,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:09:08,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:08,072 INFO L194 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-07 05:09:08,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:09:08,080 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:09:08,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:08,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:09:08,161 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:08,161 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:09:08,996 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:09,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:09:09,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 58 [2018-11-07 05:09:09,015 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:09:09,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 05:09:09,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 05:09:09,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1441, Invalid=1865, Unknown=0, NotChecked=0, Total=3306 [2018-11-07 05:09:09,017 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 30 states. [2018-11-07 05:09:09,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:09:09,102 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-11-07 05:09:09,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-07 05:09:09,103 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 86 [2018-11-07 05:09:09,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:09:09,104 INFO L225 Difference]: With dead ends: 96 [2018-11-07 05:09:09,104 INFO L226 Difference]: Without dead ends: 91 [2018-11-07 05:09:09,106 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1447, Invalid=1975, Unknown=0, NotChecked=0, Total=3422 [2018-11-07 05:09:09,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-07 05:09:09,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-11-07 05:09:09,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-07 05:09:09,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-11-07 05:09:09,109 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 86 [2018-11-07 05:09:09,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:09:09,109 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-11-07 05:09:09,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 05:09:09,110 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-11-07 05:09:09,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-07 05:09:09,110 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:09:09,110 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:09:09,111 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:09:09,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:09,111 INFO L82 PathProgramCache]: Analyzing trace with hash 940288253, now seen corresponding path program 26 times [2018-11-07 05:09:09,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:09:09,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:09,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:09:09,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:09,112 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:09:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:09,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:09,701 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:09:09,701 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:09:09,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:09:09,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:09,701 INFO L194 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-07 05:09:09,709 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:09:09,710 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:09:09,760 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-11-07 05:09:09,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:09:09,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:09:09,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:09,791 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:09:12,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:12,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:09:12,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 60 [2018-11-07 05:09:12,278 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:09:12,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-07 05:09:12,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-07 05:09:12,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1550, Invalid=1990, Unknown=0, NotChecked=0, Total=3540 [2018-11-07 05:09:12,279 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 31 states. [2018-11-07 05:09:12,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:09:12,351 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-11-07 05:09:12,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 05:09:12,351 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 89 [2018-11-07 05:09:12,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:09:12,352 INFO L225 Difference]: With dead ends: 99 [2018-11-07 05:09:12,352 INFO L226 Difference]: Without dead ends: 94 [2018-11-07 05:09:12,353 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1556, Invalid=2104, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 05:09:12,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-07 05:09:12,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-11-07 05:09:12,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-07 05:09:12,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-11-07 05:09:12,358 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 89 [2018-11-07 05:09:12,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:09:12,358 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-11-07 05:09:12,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-07 05:09:12,358 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-11-07 05:09:12,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-07 05:09:12,358 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:09:12,359 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:09:12,359 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:09:12,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:12,359 INFO L82 PathProgramCache]: Analyzing trace with hash 989900413, now seen corresponding path program 27 times [2018-11-07 05:09:12,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:09:12,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:12,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:09:12,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:12,360 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:09:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:12,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:12,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:12,784 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:09:12,784 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:09:12,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:09:12,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:12,784 INFO L194 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-07 05:09:12,794 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:09:12,794 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:09:12,837 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:09:12,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:09:12,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:09:12,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:12,890 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:09:14,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:14,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:09:14,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 62 [2018-11-07 05:09:14,060 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:09:14,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 05:09:14,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 05:09:14,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1663, Invalid=2119, Unknown=0, NotChecked=0, Total=3782 [2018-11-07 05:09:14,062 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 32 states. [2018-11-07 05:09:14,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:09:14,179 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-11-07 05:09:14,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 05:09:14,180 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 92 [2018-11-07 05:09:14,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:09:14,181 INFO L225 Difference]: With dead ends: 102 [2018-11-07 05:09:14,181 INFO L226 Difference]: Without dead ends: 97 [2018-11-07 05:09:14,182 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1669, Invalid=2237, Unknown=0, NotChecked=0, Total=3906 [2018-11-07 05:09:14,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-07 05:09:14,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-11-07 05:09:14,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-07 05:09:14,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-11-07 05:09:14,186 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 92 [2018-11-07 05:09:14,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:09:14,187 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-11-07 05:09:14,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 05:09:14,187 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-11-07 05:09:14,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-07 05:09:14,187 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:09:14,188 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:09:14,188 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:09:14,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:14,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1517009149, now seen corresponding path program 28 times [2018-11-07 05:09:14,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:09:14,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:14,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:09:14,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:14,189 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:09:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:14,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:14,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:14,642 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:09:14,642 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:09:14,642 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:09:14,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:14,642 INFO L194 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-07 05:09:14,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:09:14,651 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:09:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:14,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:09:14,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:14,720 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:09:15,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:15,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:09:15,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 64 [2018-11-07 05:09:15,736 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:09:15,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 05:09:15,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 05:09:15,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1780, Invalid=2252, Unknown=0, NotChecked=0, Total=4032 [2018-11-07 05:09:15,737 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 33 states. [2018-11-07 05:09:15,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:09:15,849 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-11-07 05:09:15,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 05:09:15,852 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 95 [2018-11-07 05:09:15,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:09:15,853 INFO L225 Difference]: With dead ends: 105 [2018-11-07 05:09:15,854 INFO L226 Difference]: Without dead ends: 100 [2018-11-07 05:09:15,854 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1786, Invalid=2374, Unknown=0, NotChecked=0, Total=4160 [2018-11-07 05:09:15,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-07 05:09:15,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2018-11-07 05:09:15,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-07 05:09:15,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-11-07 05:09:15,859 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 95 [2018-11-07 05:09:15,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:09:15,859 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-11-07 05:09:15,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 05:09:15,860 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-11-07 05:09:15,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-07 05:09:15,860 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:09:15,860 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:09:15,860 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:09:15,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:15,861 INFO L82 PathProgramCache]: Analyzing trace with hash -2082038147, now seen corresponding path program 29 times [2018-11-07 05:09:15,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:09:15,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:15,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:09:15,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:15,862 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:09:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:16,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:16,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:16,384 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:09:16,384 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:09:16,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:09:16,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:16,384 INFO L194 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-07 05:09:16,392 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:09:16,392 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:09:16,453 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-11-07 05:09:16,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:09:16,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:09:16,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:16,491 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:09:17,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:17,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:09:17,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 66 [2018-11-07 05:09:17,878 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:09:17,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 05:09:17,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 05:09:17,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1901, Invalid=2389, Unknown=0, NotChecked=0, Total=4290 [2018-11-07 05:09:17,880 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 34 states. [2018-11-07 05:09:18,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:09:18,001 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-11-07 05:09:18,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-07 05:09:18,002 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 98 [2018-11-07 05:09:18,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:09:18,003 INFO L225 Difference]: With dead ends: 108 [2018-11-07 05:09:18,003 INFO L226 Difference]: Without dead ends: 103 [2018-11-07 05:09:18,004 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1907, Invalid=2515, Unknown=0, NotChecked=0, Total=4422 [2018-11-07 05:09:18,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-07 05:09:18,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-11-07 05:09:18,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-07 05:09:18,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-11-07 05:09:18,008 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 98 [2018-11-07 05:09:18,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:09:18,008 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-11-07 05:09:18,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-07 05:09:18,009 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-11-07 05:09:18,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-07 05:09:18,009 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:09:18,009 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:09:18,010 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:09:18,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:18,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1736455939, now seen corresponding path program 30 times [2018-11-07 05:09:18,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:09:18,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:18,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:09:18,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:18,011 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:09:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:18,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:18,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:18,960 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:09:18,960 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:09:18,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:09:18,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:18,960 INFO L194 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-07 05:09:18,968 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:09:18,968 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:09:19,017 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:09:19,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:09:19,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:09:19,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:19,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:09:20,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:20,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:09:20,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 68 [2018-11-07 05:09:20,233 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:09:20,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 05:09:20,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 05:09:20,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2026, Invalid=2530, Unknown=0, NotChecked=0, Total=4556 [2018-11-07 05:09:20,235 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 35 states. [2018-11-07 05:09:20,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:09:20,361 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-11-07 05:09:20,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 05:09:20,362 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 101 [2018-11-07 05:09:20,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:09:20,363 INFO L225 Difference]: With dead ends: 111 [2018-11-07 05:09:20,363 INFO L226 Difference]: Without dead ends: 106 [2018-11-07 05:09:20,365 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2032, Invalid=2660, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 05:09:20,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-07 05:09:20,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-11-07 05:09:20,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-07 05:09:20,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-11-07 05:09:20,369 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 101 [2018-11-07 05:09:20,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:09:20,369 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-11-07 05:09:20,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-07 05:09:20,369 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-11-07 05:09:20,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-07 05:09:20,370 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:09:20,370 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:09:20,370 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:09:20,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:20,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1533505923, now seen corresponding path program 31 times [2018-11-07 05:09:20,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:09:20,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:20,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:09:20,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:20,372 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:09:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:21,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:21,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:21,040 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:09:21,040 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:09:21,040 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:09:21,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:21,040 INFO L194 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-07 05:09:21,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:09:21,050 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:09:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:21,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:09:21,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:21,164 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:09:22,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:22,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:09:22,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 70 [2018-11-07 05:09:22,603 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:09:22,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 05:09:22,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 05:09:22,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2155, Invalid=2675, Unknown=0, NotChecked=0, Total=4830 [2018-11-07 05:09:22,605 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 36 states. [2018-11-07 05:09:22,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:09:22,738 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-11-07 05:09:22,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-07 05:09:22,738 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 104 [2018-11-07 05:09:22,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:09:22,739 INFO L225 Difference]: With dead ends: 114 [2018-11-07 05:09:22,739 INFO L226 Difference]: Without dead ends: 109 [2018-11-07 05:09:22,739 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2161, Invalid=2809, Unknown=0, NotChecked=0, Total=4970 [2018-11-07 05:09:22,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-07 05:09:22,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2018-11-07 05:09:22,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-07 05:09:22,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-11-07 05:09:22,743 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 104 [2018-11-07 05:09:22,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:09:22,743 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-11-07 05:09:22,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 05:09:22,743 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-11-07 05:09:22,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-07 05:09:22,744 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:09:22,744 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:09:22,745 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:09:22,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:22,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1531435261, now seen corresponding path program 32 times [2018-11-07 05:09:22,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:09:22,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:22,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:09:22,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:22,746 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:09:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:23,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:23,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:23,493 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:09:23,493 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:09:23,494 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:09:23,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:23,494 INFO L194 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-07 05:09:23,502 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:09:23,502 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:09:23,568 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-11-07 05:09:23,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:09:23,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:09:23,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:23,720 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:09:24,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:24,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:09:24,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 72 [2018-11-07 05:09:24,969 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:09:24,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-07 05:09:24,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-07 05:09:24,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2288, Invalid=2824, Unknown=0, NotChecked=0, Total=5112 [2018-11-07 05:09:24,971 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 37 states. [2018-11-07 05:09:25,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:09:25,039 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-11-07 05:09:25,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-07 05:09:25,040 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 107 [2018-11-07 05:09:25,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:09:25,041 INFO L225 Difference]: With dead ends: 117 [2018-11-07 05:09:25,041 INFO L226 Difference]: Without dead ends: 112 [2018-11-07 05:09:25,042 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 179 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2294, Invalid=2962, Unknown=0, NotChecked=0, Total=5256 [2018-11-07 05:09:25,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-07 05:09:25,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2018-11-07 05:09:25,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-07 05:09:25,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-11-07 05:09:25,045 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 107 [2018-11-07 05:09:25,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:09:25,045 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-11-07 05:09:25,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-07 05:09:25,045 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-11-07 05:09:25,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-07 05:09:25,046 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:09:25,046 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:09:25,046 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:09:25,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:25,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1810465155, now seen corresponding path program 33 times [2018-11-07 05:09:25,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:09:25,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:25,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:09:25,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:25,047 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:09:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:25,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:25,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:25,790 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:09:25,790 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:09:25,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:09:25,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:25,791 INFO L194 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-07 05:09:25,799 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:09:25,799 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:09:25,852 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:09:25,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:09:25,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:09:25,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:25,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:09:27,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:27,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:09:27,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 74 [2018-11-07 05:09:27,514 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:09:27,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 05:09:27,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 05:09:27,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 05:09:27,515 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 38 states. [2018-11-07 05:09:27,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:09:27,607 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-11-07 05:09:27,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-07 05:09:27,608 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 110 [2018-11-07 05:09:27,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:09:27,608 INFO L225 Difference]: With dead ends: 120 [2018-11-07 05:09:27,609 INFO L226 Difference]: Without dead ends: 115 [2018-11-07 05:09:27,609 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 184 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2431, Invalid=3119, Unknown=0, NotChecked=0, Total=5550 [2018-11-07 05:09:27,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-07 05:09:27,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2018-11-07 05:09:27,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-07 05:09:27,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-11-07 05:09:27,613 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 110 [2018-11-07 05:09:27,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:09:27,613 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-11-07 05:09:27,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 05:09:27,613 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-11-07 05:09:27,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-07 05:09:27,614 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:09:27,614 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:09:27,614 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:09:27,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:27,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1271130365, now seen corresponding path program 34 times [2018-11-07 05:09:27,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:09:27,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:27,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:09:27,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:27,616 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:09:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:28,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:28,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:28,869 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:09:28,869 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:09:28,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:09:28,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:28,870 INFO L194 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-07 05:09:28,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:09:28,879 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:09:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:28,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:09:28,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:28,985 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:09:30,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:30,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:09:30,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 76 [2018-11-07 05:09:30,417 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:09:30,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 05:09:30,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 05:09:30,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2566, Invalid=3134, Unknown=0, NotChecked=0, Total=5700 [2018-11-07 05:09:30,418 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 39 states. [2018-11-07 05:09:30,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:09:30,676 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-11-07 05:09:30,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 05:09:30,677 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 113 [2018-11-07 05:09:30,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:09:30,678 INFO L225 Difference]: With dead ends: 123 [2018-11-07 05:09:30,678 INFO L226 Difference]: Without dead ends: 118 [2018-11-07 05:09:30,678 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2572, Invalid=3280, Unknown=0, NotChecked=0, Total=5852 [2018-11-07 05:09:30,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-07 05:09:30,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-11-07 05:09:30,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-07 05:09:30,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-11-07 05:09:30,682 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 113 [2018-11-07 05:09:30,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:09:30,683 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-11-07 05:09:30,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 05:09:30,683 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-11-07 05:09:30,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-07 05:09:30,684 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:09:30,684 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:09:30,684 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:09:30,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:30,685 INFO L82 PathProgramCache]: Analyzing trace with hash 157314685, now seen corresponding path program 35 times [2018-11-07 05:09:30,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:09:30,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:30,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:09:30,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:30,686 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:09:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:31,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:31,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:31,532 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:09:31,532 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:09:31,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:09:31,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:31,533 INFO L194 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-07 05:09:31,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:09:31,541 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:09:31,623 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-11-07 05:09:31,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:09:31,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:09:32,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:32,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:09:34,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:34,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:09:34,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 78 [2018-11-07 05:09:34,151 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:09:34,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-07 05:09:34,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-07 05:09:34,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2711, Invalid=3295, Unknown=0, NotChecked=0, Total=6006 [2018-11-07 05:09:34,152 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 40 states. [2018-11-07 05:09:34,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:09:34,239 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-11-07 05:09:34,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-07 05:09:34,240 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 116 [2018-11-07 05:09:34,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:09:34,241 INFO L225 Difference]: With dead ends: 126 [2018-11-07 05:09:34,241 INFO L226 Difference]: Without dead ends: 121 [2018-11-07 05:09:34,241 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2717, Invalid=3445, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 05:09:34,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-07 05:09:34,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2018-11-07 05:09:34,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-07 05:09:34,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-11-07 05:09:34,245 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 116 [2018-11-07 05:09:34,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:09:34,246 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-11-07 05:09:34,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-07 05:09:34,246 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-11-07 05:09:34,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 05:09:34,246 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:09:34,247 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:09:34,247 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:09:34,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:34,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1391720701, now seen corresponding path program 36 times [2018-11-07 05:09:34,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:09:34,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:34,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:09:34,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:34,248 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:09:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:34,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:34,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:34,918 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:09:34,918 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:09:34,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:09:34,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:34,918 INFO L194 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-07 05:09:34,926 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:09:34,926 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:09:34,985 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:09:34,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:09:34,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:09:35,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:35,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:09:36,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:36,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:09:36,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 80 [2018-11-07 05:09:36,970 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:09:36,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-07 05:09:36,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-07 05:09:36,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2860, Invalid=3460, Unknown=0, NotChecked=0, Total=6320 [2018-11-07 05:09:36,972 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 41 states. [2018-11-07 05:09:37,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:09:37,150 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-11-07 05:09:37,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 05:09:37,150 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 119 [2018-11-07 05:09:37,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:09:37,151 INFO L225 Difference]: With dead ends: 129 [2018-11-07 05:09:37,151 INFO L226 Difference]: Without dead ends: 124 [2018-11-07 05:09:37,152 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2866, Invalid=3614, Unknown=0, NotChecked=0, Total=6480 [2018-11-07 05:09:37,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-07 05:09:37,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2018-11-07 05:09:37,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-07 05:09:37,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-11-07 05:09:37,155 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 119 [2018-11-07 05:09:37,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:09:37,156 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-11-07 05:09:37,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-07 05:09:37,156 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-11-07 05:09:37,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-07 05:09:37,157 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:09:37,157 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:09:37,157 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:09:37,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:37,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2071355005, now seen corresponding path program 37 times [2018-11-07 05:09:37,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:09:37,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:37,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:09:37,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:37,158 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:09:37,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:38,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:38,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:38,072 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:09:38,072 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:09:38,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:09:38,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:38,073 INFO L194 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-07 05:09:38,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:09:38,082 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:09:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:38,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:09:38,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:38,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:09:39,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:39,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:09:39,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 82 [2018-11-07 05:09:39,939 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:09:39,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 05:09:39,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 05:09:39,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3013, Invalid=3629, Unknown=0, NotChecked=0, Total=6642 [2018-11-07 05:09:39,941 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 42 states. [2018-11-07 05:09:40,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:09:40,082 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-11-07 05:09:40,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-07 05:09:40,083 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 122 [2018-11-07 05:09:40,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:09:40,084 INFO L225 Difference]: With dead ends: 132 [2018-11-07 05:09:40,084 INFO L226 Difference]: Without dead ends: 127 [2018-11-07 05:09:40,086 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3019, Invalid=3787, Unknown=0, NotChecked=0, Total=6806 [2018-11-07 05:09:40,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-07 05:09:40,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2018-11-07 05:09:40,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-07 05:09:40,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-11-07 05:09:40,090 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 122 [2018-11-07 05:09:40,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:09:40,090 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-11-07 05:09:40,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 05:09:40,090 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-11-07 05:09:40,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-07 05:09:40,091 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:09:40,091 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:09:40,091 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:09:40,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:40,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1713895171, now seen corresponding path program 38 times [2018-11-07 05:09:40,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:09:40,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:40,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:09:40,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:40,093 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:09:40,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:41,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:41,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:41,435 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:09:41,435 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:09:41,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:09:41,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:41,435 INFO L194 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-07 05:09:41,443 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:09:41,443 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:09:41,527 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-11-07 05:09:41,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:09:41,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:09:41,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:41,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:09:43,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:43,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:09:43,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 84 [2018-11-07 05:09:43,879 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:09:43,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-07 05:09:43,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-07 05:09:43,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3170, Invalid=3802, Unknown=0, NotChecked=0, Total=6972 [2018-11-07 05:09:43,880 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 43 states. [2018-11-07 05:09:44,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:09:44,089 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-11-07 05:09:44,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-07 05:09:44,090 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 125 [2018-11-07 05:09:44,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:09:44,091 INFO L225 Difference]: With dead ends: 135 [2018-11-07 05:09:44,092 INFO L226 Difference]: Without dead ends: 130 [2018-11-07 05:09:44,092 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 209 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3176, Invalid=3964, Unknown=0, NotChecked=0, Total=7140 [2018-11-07 05:09:44,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-07 05:09:44,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-11-07 05:09:44,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-07 05:09:44,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-11-07 05:09:44,097 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 125 [2018-11-07 05:09:44,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:09:44,097 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-11-07 05:09:44,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-07 05:09:44,097 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-11-07 05:09:44,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-07 05:09:44,098 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:09:44,098 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:09:44,098 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:09:44,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:44,098 INFO L82 PathProgramCache]: Analyzing trace with hash 559435389, now seen corresponding path program 39 times [2018-11-07 05:09:44,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:09:44,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:44,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:09:44,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:44,099 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:09:44,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:45,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:45,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:45,937 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:09:45,938 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:09:45,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:09:45,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:45,938 INFO L194 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-07 05:09:45,946 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:09:45,946 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:09:46,009 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:09:46,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:09:46,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:09:46,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:46,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:09:48,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:48,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:09:48,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 86 [2018-11-07 05:09:48,244 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:09:48,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-07 05:09:48,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-07 05:09:48,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3331, Invalid=3979, Unknown=0, NotChecked=0, Total=7310 [2018-11-07 05:09:48,246 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 44 states. [2018-11-07 05:09:48,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:09:48,491 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-11-07 05:09:48,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 05:09:48,492 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 128 [2018-11-07 05:09:48,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:09:48,493 INFO L225 Difference]: With dead ends: 138 [2018-11-07 05:09:48,493 INFO L226 Difference]: Without dead ends: 133 [2018-11-07 05:09:48,494 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 214 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3337, Invalid=4145, Unknown=0, NotChecked=0, Total=7482 [2018-11-07 05:09:48,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-07 05:09:48,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2018-11-07 05:09:48,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-07 05:09:48,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-11-07 05:09:48,498 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 128 [2018-11-07 05:09:48,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:09:48,498 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-11-07 05:09:48,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-07 05:09:48,499 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-11-07 05:09:48,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-07 05:09:48,499 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:09:48,500 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:09:48,500 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:09:48,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:48,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1989142275, now seen corresponding path program 40 times [2018-11-07 05:09:48,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:09:48,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:48,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:09:48,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:48,501 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:09:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:51,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:51,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:51,515 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:09:51,515 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:09:51,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:09:51,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:51,516 INFO L194 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-07 05:09:51,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:09:51,524 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:09:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:51,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:09:51,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:51,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:09:54,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:54,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:09:54,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 88 [2018-11-07 05:09:54,100 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:09:54,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-07 05:09:54,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-07 05:09:54,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3496, Invalid=4160, Unknown=0, NotChecked=0, Total=7656 [2018-11-07 05:09:54,102 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 45 states. [2018-11-07 05:09:54,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:09:54,281 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-11-07 05:09:54,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-07 05:09:54,282 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 131 [2018-11-07 05:09:54,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:09:54,284 INFO L225 Difference]: With dead ends: 141 [2018-11-07 05:09:54,284 INFO L226 Difference]: Without dead ends: 136 [2018-11-07 05:09:54,285 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=3502, Invalid=4330, Unknown=0, NotChecked=0, Total=7832 [2018-11-07 05:09:54,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-07 05:09:54,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2018-11-07 05:09:54,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-07 05:09:54,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-11-07 05:09:54,288 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 131 [2018-11-07 05:09:54,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:09:54,289 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-11-07 05:09:54,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-07 05:09:54,289 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-11-07 05:09:54,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-07 05:09:54,289 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:09:54,290 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:09:54,290 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:09:54,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:54,290 INFO L82 PathProgramCache]: Analyzing trace with hash -234471811, now seen corresponding path program 41 times [2018-11-07 05:09:54,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:09:54,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:54,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:09:54,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:54,291 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:09:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:55,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:55,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:55,816 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:09:55,816 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:09:55,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:09:55,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:55,816 INFO L194 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-07 05:09:55,825 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:09:55,825 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:09:55,993 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-11-07 05:09:55,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:09:55,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:09:56,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:56,164 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:09:58,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:58,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:09:58,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 90 [2018-11-07 05:09:58,738 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:09:58,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-07 05:09:58,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-07 05:09:58,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3665, Invalid=4345, Unknown=0, NotChecked=0, Total=8010 [2018-11-07 05:09:58,739 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 46 states. [2018-11-07 05:09:59,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:09:59,069 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-11-07 05:09:59,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-07 05:09:59,069 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 134 [2018-11-07 05:09:59,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:09:59,070 INFO L225 Difference]: With dead ends: 144 [2018-11-07 05:09:59,071 INFO L226 Difference]: Without dead ends: 139 [2018-11-07 05:09:59,071 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 224 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3671, Invalid=4519, Unknown=0, NotChecked=0, Total=8190 [2018-11-07 05:09:59,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-07 05:09:59,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2018-11-07 05:09:59,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-07 05:09:59,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-11-07 05:09:59,079 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 134 [2018-11-07 05:09:59,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:09:59,079 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-11-07 05:09:59,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-07 05:09:59,079 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-11-07 05:09:59,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-07 05:09:59,080 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:09:59,080 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:09:59,080 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:09:59,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:59,080 INFO L82 PathProgramCache]: Analyzing trace with hash -893638403, now seen corresponding path program 42 times [2018-11-07 05:09:59,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:09:59,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:59,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:09:59,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:59,082 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:09:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:00,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:00,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:00,325 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:00,325 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:00,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:00,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:00,325 INFO L194 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-07 05:10:00,335 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:10:00,335 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:10:00,402 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:10:00,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:10:00,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:00,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:00,526 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:02,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:02,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:02,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 92 [2018-11-07 05:10:02,602 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:02,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-07 05:10:02,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-07 05:10:02,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3838, Invalid=4534, Unknown=0, NotChecked=0, Total=8372 [2018-11-07 05:10:02,603 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 47 states. [2018-11-07 05:10:02,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:02,768 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-11-07 05:10:02,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-07 05:10:02,768 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 137 [2018-11-07 05:10:02,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:02,769 INFO L225 Difference]: With dead ends: 147 [2018-11-07 05:10:02,769 INFO L226 Difference]: Without dead ends: 142 [2018-11-07 05:10:02,770 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 229 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3844, Invalid=4712, Unknown=0, NotChecked=0, Total=8556 [2018-11-07 05:10:02,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-07 05:10:02,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-11-07 05:10:02,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-07 05:10:02,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-11-07 05:10:02,774 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 137 [2018-11-07 05:10:02,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:02,774 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-11-07 05:10:02,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-07 05:10:02,774 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-11-07 05:10:02,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-07 05:10:02,775 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:02,775 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:02,775 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:02,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:02,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1535103363, now seen corresponding path program 43 times [2018-11-07 05:10:02,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:02,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:02,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:10:02,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:02,777 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:03,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:03,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:03,829 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:03,830 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:03,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:03,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:03,830 INFO L194 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-07 05:10:03,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:03,841 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:10:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:03,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:04,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:04,033 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:06,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:06,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:06,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 94 [2018-11-07 05:10:06,251 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:06,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-07 05:10:06,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-07 05:10:06,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4015, Invalid=4727, Unknown=0, NotChecked=0, Total=8742 [2018-11-07 05:10:06,253 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 48 states. [2018-11-07 05:10:06,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:06,353 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-11-07 05:10:06,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-07 05:10:06,353 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 140 [2018-11-07 05:10:06,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:06,354 INFO L225 Difference]: With dead ends: 150 [2018-11-07 05:10:06,354 INFO L226 Difference]: Without dead ends: 145 [2018-11-07 05:10:06,355 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 234 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4021, Invalid=4909, Unknown=0, NotChecked=0, Total=8930 [2018-11-07 05:10:06,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-07 05:10:06,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2018-11-07 05:10:06,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-07 05:10:06,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-11-07 05:10:06,359 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 140 [2018-11-07 05:10:06,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:06,359 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-11-07 05:10:06,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-07 05:10:06,359 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-11-07 05:10:06,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-07 05:10:06,360 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:06,360 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:06,360 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:06,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:06,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1186740477, now seen corresponding path program 44 times [2018-11-07 05:10:06,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:06,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:06,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:06,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:06,361 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:07,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:07,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:07,279 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:07,279 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:07,279 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:07,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:07,279 INFO L194 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-07 05:10:07,288 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:10:07,288 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:10:07,389 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-11-07 05:10:07,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:10:07,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:07,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:07,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:10,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:10,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:10,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 96 [2018-11-07 05:10:10,031 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:10,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-07 05:10:10,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-07 05:10:10,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4196, Invalid=4924, Unknown=0, NotChecked=0, Total=9120 [2018-11-07 05:10:10,033 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 49 states. [2018-11-07 05:10:10,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:10,129 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-11-07 05:10:10,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-07 05:10:10,129 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 143 [2018-11-07 05:10:10,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:10,130 INFO L225 Difference]: With dead ends: 153 [2018-11-07 05:10:10,131 INFO L226 Difference]: Without dead ends: 148 [2018-11-07 05:10:10,132 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 239 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4202, Invalid=5110, Unknown=0, NotChecked=0, Total=9312 [2018-11-07 05:10:10,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-07 05:10:10,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2018-11-07 05:10:10,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-07 05:10:10,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-11-07 05:10:10,136 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 143 [2018-11-07 05:10:10,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:10,136 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-11-07 05:10:10,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-07 05:10:10,137 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-11-07 05:10:10,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-07 05:10:10,137 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:10,138 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:10,138 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:10,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:10,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1345970563, now seen corresponding path program 45 times [2018-11-07 05:10:10,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:10,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:10,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:10:10,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:10,139 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:11,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:11,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:11,095 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:11,095 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:11,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:11,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:11,096 INFO L194 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-07 05:10:11,104 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:10:11,104 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:10:11,178 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:10:11,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:10:11,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:11,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:11,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:13,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:13,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:13,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 98 [2018-11-07 05:10:13,902 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:13,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-07 05:10:13,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-07 05:10:13,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4381, Invalid=5125, Unknown=0, NotChecked=0, Total=9506 [2018-11-07 05:10:13,904 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 50 states. [2018-11-07 05:10:13,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:13,995 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-11-07 05:10:13,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-07 05:10:13,996 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 146 [2018-11-07 05:10:13,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:13,997 INFO L225 Difference]: With dead ends: 156 [2018-11-07 05:10:13,997 INFO L226 Difference]: Without dead ends: 151 [2018-11-07 05:10:13,998 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 244 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4387, Invalid=5315, Unknown=0, NotChecked=0, Total=9702 [2018-11-07 05:10:13,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-07 05:10:14,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2018-11-07 05:10:14,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-07 05:10:14,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-11-07 05:10:14,003 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 146 [2018-11-07 05:10:14,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:14,003 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-11-07 05:10:14,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-07 05:10:14,003 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-11-07 05:10:14,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-07 05:10:14,004 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:14,004 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:14,004 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:14,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:14,005 INFO L82 PathProgramCache]: Analyzing trace with hash 644892925, now seen corresponding path program 46 times [2018-11-07 05:10:14,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:14,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:14,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:10:14,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:14,006 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:15,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:15,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:15,048 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:15,048 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:15,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:15,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:15,048 INFO L194 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-07 05:10:15,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:15,058 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:10:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:15,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:15,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:15,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:18,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:18,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:18,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 100 [2018-11-07 05:10:18,043 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:18,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-07 05:10:18,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-07 05:10:18,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4570, Invalid=5330, Unknown=0, NotChecked=0, Total=9900 [2018-11-07 05:10:18,045 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 51 states. [2018-11-07 05:10:18,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:18,217 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-11-07 05:10:18,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-07 05:10:18,217 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 149 [2018-11-07 05:10:18,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:18,218 INFO L225 Difference]: With dead ends: 159 [2018-11-07 05:10:18,218 INFO L226 Difference]: Without dead ends: 154 [2018-11-07 05:10:18,219 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4576, Invalid=5524, Unknown=0, NotChecked=0, Total=10100 [2018-11-07 05:10:18,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-07 05:10:18,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-11-07 05:10:18,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-07 05:10:18,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-11-07 05:10:18,223 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 149 [2018-11-07 05:10:18,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:18,223 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-11-07 05:10:18,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-07 05:10:18,223 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-11-07 05:10:18,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-07 05:10:18,224 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:18,224 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:18,224 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:18,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:18,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1255673469, now seen corresponding path program 47 times [2018-11-07 05:10:18,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:18,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:18,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:18,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:18,226 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:19,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:19,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:19,420 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:19,421 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:19,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:19,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:19,421 INFO L194 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-07 05:10:19,429 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:10:19,429 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:10:19,532 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-11-07 05:10:19,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:10:19,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:19,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:19,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:22,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:22,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:22,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 102 [2018-11-07 05:10:22,109 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:22,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-07 05:10:22,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-07 05:10:22,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4763, Invalid=5539, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 05:10:22,111 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 52 states. [2018-11-07 05:10:22,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:22,261 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-11-07 05:10:22,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-07 05:10:22,261 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 152 [2018-11-07 05:10:22,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:22,262 INFO L225 Difference]: With dead ends: 162 [2018-11-07 05:10:22,262 INFO L226 Difference]: Without dead ends: 157 [2018-11-07 05:10:22,263 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 254 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4769, Invalid=5737, Unknown=0, NotChecked=0, Total=10506 [2018-11-07 05:10:22,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-07 05:10:22,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2018-11-07 05:10:22,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-07 05:10:22,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-11-07 05:10:22,267 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 152 [2018-11-07 05:10:22,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:22,268 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-11-07 05:10:22,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-07 05:10:22,268 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-11-07 05:10:22,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-07 05:10:22,269 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:22,269 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:22,269 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:22,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:22,270 INFO L82 PathProgramCache]: Analyzing trace with hash -757573379, now seen corresponding path program 48 times [2018-11-07 05:10:22,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:22,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:22,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:10:22,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:22,271 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:23,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:23,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:23,486 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:23,486 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:23,487 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:23,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:23,487 INFO L194 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-07 05:10:23,495 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:10:23,496 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:10:23,571 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:10:23,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:10:23,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:23,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:23,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:26,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:26,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:26,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 104 [2018-11-07 05:10:26,250 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:26,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-07 05:10:26,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-07 05:10:26,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4960, Invalid=5752, Unknown=0, NotChecked=0, Total=10712 [2018-11-07 05:10:26,252 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 53 states. [2018-11-07 05:10:26,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:26,399 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-11-07 05:10:26,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-07 05:10:26,399 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 155 [2018-11-07 05:10:26,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:26,400 INFO L225 Difference]: With dead ends: 165 [2018-11-07 05:10:26,400 INFO L226 Difference]: Without dead ends: 160 [2018-11-07 05:10:26,401 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 259 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4966, Invalid=5954, Unknown=0, NotChecked=0, Total=10920 [2018-11-07 05:10:26,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-07 05:10:26,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2018-11-07 05:10:26,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-07 05:10:26,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-11-07 05:10:26,404 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 155 [2018-11-07 05:10:26,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:26,404 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-11-07 05:10:26,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-07 05:10:26,404 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-11-07 05:10:26,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-07 05:10:26,404 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:26,405 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:26,405 INFO L423 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:26,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:26,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1823866493, now seen corresponding path program 49 times [2018-11-07 05:10:26,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:26,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:26,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:10:26,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:26,406 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:27,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:27,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:27,663 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:27,664 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:27,664 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:27,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:27,664 INFO L194 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-07 05:10:27,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:27,672 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:10:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:27,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:27,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:27,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:30,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:30,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:30,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 106 [2018-11-07 05:10:30,993 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:30,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-07 05:10:30,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-07 05:10:30,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5161, Invalid=5969, Unknown=0, NotChecked=0, Total=11130 [2018-11-07 05:10:30,995 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 54 states. [2018-11-07 05:10:31,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:31,135 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-11-07 05:10:31,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-07 05:10:31,135 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 158 [2018-11-07 05:10:31,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:31,136 INFO L225 Difference]: With dead ends: 168 [2018-11-07 05:10:31,137 INFO L226 Difference]: Without dead ends: 163 [2018-11-07 05:10:31,138 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 264 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5167, Invalid=6175, Unknown=0, NotChecked=0, Total=11342 [2018-11-07 05:10:31,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-07 05:10:31,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2018-11-07 05:10:31,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-07 05:10:31,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-11-07 05:10:31,141 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 158 [2018-11-07 05:10:31,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:31,141 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-11-07 05:10:31,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-07 05:10:31,141 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-11-07 05:10:31,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-07 05:10:31,142 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:31,142 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:31,143 INFO L423 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:31,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:31,143 INFO L82 PathProgramCache]: Analyzing trace with hash -185308931, now seen corresponding path program 50 times [2018-11-07 05:10:31,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:31,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:31,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:31,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:31,144 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:32,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:32,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:32,215 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:32,215 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:32,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:32,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:32,215 INFO L194 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-07 05:10:32,224 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:10:32,224 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:10:32,337 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2018-11-07 05:10:32,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:10:32,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:32,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:32,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:35,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:35,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:35,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 108 [2018-11-07 05:10:35,643 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:35,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-07 05:10:35,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-07 05:10:35,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5366, Invalid=6190, Unknown=0, NotChecked=0, Total=11556 [2018-11-07 05:10:35,645 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 55 states. [2018-11-07 05:10:35,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:35,760 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-11-07 05:10:35,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-07 05:10:35,761 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 161 [2018-11-07 05:10:35,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:35,761 INFO L225 Difference]: With dead ends: 171 [2018-11-07 05:10:35,762 INFO L226 Difference]: Without dead ends: 166 [2018-11-07 05:10:35,762 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 269 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5372, Invalid=6400, Unknown=0, NotChecked=0, Total=11772 [2018-11-07 05:10:35,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-07 05:10:35,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-11-07 05:10:35,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-07 05:10:35,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-11-07 05:10:35,766 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 161 [2018-11-07 05:10:35,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:35,767 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-11-07 05:10:35,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-07 05:10:35,767 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-11-07 05:10:35,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-07 05:10:35,768 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:35,768 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:35,768 INFO L423 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:35,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:35,769 INFO L82 PathProgramCache]: Analyzing trace with hash -866128259, now seen corresponding path program 51 times [2018-11-07 05:10:35,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:35,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:35,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:10:35,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:35,770 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:35,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:36,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:36,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:36,867 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:36,867 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:36,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:36,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:36,868 INFO L194 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-07 05:10:36,875 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:10:36,876 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:10:36,963 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:10:36,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:10:36,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:37,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:37,039 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:40,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:40,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:40,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 110 [2018-11-07 05:10:40,294 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:40,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-11-07 05:10:40,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-07 05:10:40,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5575, Invalid=6415, Unknown=0, NotChecked=0, Total=11990 [2018-11-07 05:10:40,296 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 56 states. [2018-11-07 05:10:40,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:40,463 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-11-07 05:10:40,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-11-07 05:10:40,463 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 164 [2018-11-07 05:10:40,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:40,465 INFO L225 Difference]: With dead ends: 174 [2018-11-07 05:10:40,465 INFO L226 Difference]: Without dead ends: 169 [2018-11-07 05:10:40,466 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 274 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5581, Invalid=6629, Unknown=0, NotChecked=0, Total=12210 [2018-11-07 05:10:40,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-07 05:10:40,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2018-11-07 05:10:40,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-07 05:10:40,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-11-07 05:10:40,470 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 164 [2018-11-07 05:10:40,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:40,470 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-11-07 05:10:40,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-11-07 05:10:40,470 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-11-07 05:10:40,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-07 05:10:40,471 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:40,471 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:40,471 INFO L423 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:40,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:40,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1975810301, now seen corresponding path program 52 times [2018-11-07 05:10:40,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:40,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:40,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:10:40,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:40,472 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:41,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:41,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:41,787 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:41,788 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:41,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:41,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:41,788 INFO L194 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-07 05:10:41,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:41,797 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:10:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:41,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:41,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:41,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:45,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:45,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:45,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 112 [2018-11-07 05:10:45,464 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:45,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-11-07 05:10:45,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-07 05:10:45,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5788, Invalid=6644, Unknown=0, NotChecked=0, Total=12432 [2018-11-07 05:10:45,465 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 57 states. [2018-11-07 05:10:45,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:45,572 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-11-07 05:10:45,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-11-07 05:10:45,572 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 167 [2018-11-07 05:10:45,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:45,574 INFO L225 Difference]: With dead ends: 177 [2018-11-07 05:10:45,574 INFO L226 Difference]: Without dead ends: 172 [2018-11-07 05:10:45,575 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 279 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5794, Invalid=6862, Unknown=0, NotChecked=0, Total=12656 [2018-11-07 05:10:45,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-07 05:10:45,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2018-11-07 05:10:45,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-07 05:10:45,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-11-07 05:10:45,578 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 167 [2018-11-07 05:10:45,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:45,578 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-11-07 05:10:45,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-11-07 05:10:45,578 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-11-07 05:10:45,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-07 05:10:45,579 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:45,579 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:45,579 INFO L423 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:45,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:45,579 INFO L82 PathProgramCache]: Analyzing trace with hash -522854787, now seen corresponding path program 53 times [2018-11-07 05:10:45,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:45,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:45,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:45,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:45,580 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:46,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:46,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:46,743 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:46,743 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:46,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:46,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:46,743 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:46,751 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:10:46,751 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:10:46,871 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2018-11-07 05:10:46,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:10:46,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:47,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:47,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:50,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:50,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:50,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 114 [2018-11-07 05:10:50,966 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:50,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-07 05:10:50,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-07 05:10:50,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6005, Invalid=6877, Unknown=0, NotChecked=0, Total=12882 [2018-11-07 05:10:50,968 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 58 states. [2018-11-07 05:10:51,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:51,140 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-11-07 05:10:51,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-11-07 05:10:51,140 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 170 [2018-11-07 05:10:51,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:51,141 INFO L225 Difference]: With dead ends: 180 [2018-11-07 05:10:51,141 INFO L226 Difference]: Without dead ends: 175 [2018-11-07 05:10:51,142 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 284 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6011, Invalid=7099, Unknown=0, NotChecked=0, Total=13110 [2018-11-07 05:10:51,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-07 05:10:51,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2018-11-07 05:10:51,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-07 05:10:51,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-11-07 05:10:51,146 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 170 [2018-11-07 05:10:51,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:51,146 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-11-07 05:10:51,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-07 05:10:51,146 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-11-07 05:10:51,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-07 05:10:51,147 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:51,147 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:51,147 INFO L423 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:51,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:51,148 INFO L82 PathProgramCache]: Analyzing trace with hash 2118682877, now seen corresponding path program 54 times [2018-11-07 05:10:51,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:51,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:51,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:10:51,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:51,149 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:52,367 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:52,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:52,367 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:52,368 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:52,368 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:52,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:52,368 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:52,380 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:10:52,380 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:10:52,466 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:10:52,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:10:52,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:52,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:52,542 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:56,020 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:56,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:56,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 116 [2018-11-07 05:10:56,040 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:56,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-11-07 05:10:56,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-11-07 05:10:56,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6226, Invalid=7114, Unknown=0, NotChecked=0, Total=13340 [2018-11-07 05:10:56,045 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 59 states. [2018-11-07 05:10:56,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:56,170 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-11-07 05:10:56,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-07 05:10:56,170 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 173 [2018-11-07 05:10:56,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:56,171 INFO L225 Difference]: With dead ends: 183 [2018-11-07 05:10:56,171 INFO L226 Difference]: Without dead ends: 178 [2018-11-07 05:10:56,172 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 289 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6232, Invalid=7340, Unknown=0, NotChecked=0, Total=13572 [2018-11-07 05:10:56,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-11-07 05:10:56,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-11-07 05:10:56,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-07 05:10:56,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-11-07 05:10:56,176 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 173 [2018-11-07 05:10:56,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:56,177 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-11-07 05:10:56,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-11-07 05:10:56,177 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-11-07 05:10:56,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-07 05:10:56,178 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:56,178 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:56,178 INFO L423 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:56,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:56,179 INFO L82 PathProgramCache]: Analyzing trace with hash -518533507, now seen corresponding path program 55 times [2018-11-07 05:10:56,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:56,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:56,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:10:56,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:56,180 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:57,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:57,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:57,498 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:57,498 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:57,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:57,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:57,498 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:57,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:57,506 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:10:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:57,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:57,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:57,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:11:01,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:11:01,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:11:01,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 118 [2018-11-07 05:11:01,446 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:11:01,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-11-07 05:11:01,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-11-07 05:11:01,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6451, Invalid=7355, Unknown=0, NotChecked=0, Total=13806 [2018-11-07 05:11:01,448 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 60 states. [2018-11-07 05:11:01,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:11:01,638 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-11-07 05:11:01,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-11-07 05:11:01,638 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 176 [2018-11-07 05:11:01,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:11:01,639 INFO L225 Difference]: With dead ends: 186 [2018-11-07 05:11:01,639 INFO L226 Difference]: Without dead ends: 181 [2018-11-07 05:11:01,641 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 294 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6457, Invalid=7585, Unknown=0, NotChecked=0, Total=14042 [2018-11-07 05:11:01,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-11-07 05:11:01,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2018-11-07 05:11:01,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-11-07 05:11:01,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-11-07 05:11:01,645 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 176 [2018-11-07 05:11:01,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:11:01,645 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-11-07 05:11:01,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-11-07 05:11:01,646 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-11-07 05:11:01,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-07 05:11:01,646 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:11:01,647 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:11:01,647 INFO L423 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:11:01,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:11:01,647 INFO L82 PathProgramCache]: Analyzing trace with hash 2004916477, now seen corresponding path program 56 times [2018-11-07 05:11:01,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:11:01,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:01,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:11:01,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:01,648 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:11:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:11:02,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:11:02,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:02,957 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:11:02,957 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:11:02,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:11:02,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:02,957 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:11:02,966 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:11:02,966 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:11:03,094 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2018-11-07 05:11:03,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:11:03,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:11:03,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:11:03,242 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:11:07,087 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:11:07,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:11:07,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 120 [2018-11-07 05:11:07,107 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:11:07,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-11-07 05:11:07,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-11-07 05:11:07,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6680, Invalid=7600, Unknown=0, NotChecked=0, Total=14280 [2018-11-07 05:11:07,109 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 61 states. [2018-11-07 05:11:07,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:11:07,297 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-11-07 05:11:07,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-11-07 05:11:07,298 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 179 [2018-11-07 05:11:07,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:11:07,299 INFO L225 Difference]: With dead ends: 189 [2018-11-07 05:11:07,299 INFO L226 Difference]: Without dead ends: 184 [2018-11-07 05:11:07,300 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 299 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6686, Invalid=7834, Unknown=0, NotChecked=0, Total=14520 [2018-11-07 05:11:07,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-11-07 05:11:07,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2018-11-07 05:11:07,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-11-07 05:11:07,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-11-07 05:11:07,303 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 179 [2018-11-07 05:11:07,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:11:07,304 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-11-07 05:11:07,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-11-07 05:11:07,304 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-11-07 05:11:07,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-07 05:11:07,305 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:11:07,305 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:11:07,305 INFO L423 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:11:07,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:11:07,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1004159363, now seen corresponding path program 57 times [2018-11-07 05:11:07,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:11:07,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:07,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:11:07,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:07,307 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:11:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:11:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:11:08,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:08,646 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:11:08,646 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:11:08,646 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:11:08,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:08,647 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:11:08,655 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:11:08,656 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:11:08,743 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:11:08,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:11:08,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:11:08,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:11:08,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:11:12,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:11:12,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:11:12,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 122 [2018-11-07 05:11:12,927 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:11:12,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-11-07 05:11:12,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-11-07 05:11:12,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6913, Invalid=7849, Unknown=0, NotChecked=0, Total=14762 [2018-11-07 05:11:12,928 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 62 states. [2018-11-07 05:11:13,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:11:13,057 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-11-07 05:11:13,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-11-07 05:11:13,057 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 182 [2018-11-07 05:11:13,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:11:13,058 INFO L225 Difference]: With dead ends: 192 [2018-11-07 05:11:13,058 INFO L226 Difference]: Without dead ends: 187 [2018-11-07 05:11:13,059 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=6919, Invalid=8087, Unknown=0, NotChecked=0, Total=15006 [2018-11-07 05:11:13,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-07 05:11:13,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2018-11-07 05:11:13,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-11-07 05:11:13,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-11-07 05:11:13,062 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 182 [2018-11-07 05:11:13,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:11:13,063 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-11-07 05:11:13,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-11-07 05:11:13,063 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-11-07 05:11:13,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-07 05:11:13,064 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:11:13,064 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:11:13,064 INFO L423 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:11:13,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:11:13,065 INFO L82 PathProgramCache]: Analyzing trace with hash 174893309, now seen corresponding path program 58 times [2018-11-07 05:11:13,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:11:13,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:13,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:11:13,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:13,066 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:11:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:11:14,765 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:11:14,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:14,766 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:11:14,766 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:11:14,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:11:14,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:14,766 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:11:14,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:11:14,777 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:11:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:11:14,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:11:14,951 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:11:14,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:11:18,762 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:11:18,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:11:18,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 124 [2018-11-07 05:11:18,782 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:11:18,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-11-07 05:11:18,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-11-07 05:11:18,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7150, Invalid=8102, Unknown=0, NotChecked=0, Total=15252 [2018-11-07 05:11:18,784 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 63 states. [2018-11-07 05:11:18,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:11:18,961 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-11-07 05:11:18,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-11-07 05:11:18,961 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 185 [2018-11-07 05:11:18,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:11:18,963 INFO L225 Difference]: With dead ends: 195 [2018-11-07 05:11:18,963 INFO L226 Difference]: Without dead ends: 190 [2018-11-07 05:11:18,964 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 309 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7156, Invalid=8344, Unknown=0, NotChecked=0, Total=15500 [2018-11-07 05:11:18,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-07 05:11:18,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2018-11-07 05:11:18,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-07 05:11:18,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-11-07 05:11:18,968 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 185 [2018-11-07 05:11:18,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:11:18,969 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-11-07 05:11:18,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-11-07 05:11:18,969 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-11-07 05:11:18,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-07 05:11:18,969 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:11:18,970 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:11:18,970 INFO L423 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:11:18,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:11:18,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1090498173, now seen corresponding path program 59 times [2018-11-07 05:11:18,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:11:18,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:18,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:11:18,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:18,971 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:11:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:11:20,866 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:11:20,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:20,867 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:11:20,867 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:11:20,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:11:20,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:20,867 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:11:20,875 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:11:20,875 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:11:21,015 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2018-11-07 05:11:21,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:11:21,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:11:21,073 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:11:21,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:11:25,303 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:11:25,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:11:25,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 126 [2018-11-07 05:11:25,323 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:11:25,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-11-07 05:11:25,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-11-07 05:11:25,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7391, Invalid=8359, Unknown=0, NotChecked=0, Total=15750 [2018-11-07 05:11:25,325 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 64 states. [2018-11-07 05:11:25,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:11:25,506 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-11-07 05:11:25,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-11-07 05:11:25,506 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 188 [2018-11-07 05:11:25,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:11:25,508 INFO L225 Difference]: With dead ends: 198 [2018-11-07 05:11:25,508 INFO L226 Difference]: Without dead ends: 193 [2018-11-07 05:11:25,509 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 314 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=7397, Invalid=8605, Unknown=0, NotChecked=0, Total=16002 [2018-11-07 05:11:25,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-07 05:11:25,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2018-11-07 05:11:25,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-11-07 05:11:25,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-11-07 05:11:25,511 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 188 [2018-11-07 05:11:25,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:11:25,512 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-11-07 05:11:25,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-11-07 05:11:25,512 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-11-07 05:11:25,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-07 05:11:25,512 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:11:25,513 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:11:25,513 INFO L423 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:11:25,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:11:25,513 INFO L82 PathProgramCache]: Analyzing trace with hash 537704701, now seen corresponding path program 60 times [2018-11-07 05:11:25,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:11:25,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:25,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:11:25,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:25,514 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:11:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:11:26,967 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:11:26,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:26,967 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:11:26,967 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:11:26,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:11:26,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:26,968 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:11:26,976 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:11:26,976 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:11:27,068 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:11:27,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:11:27,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:11:27,153 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:11:27,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:11:31,515 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:11:31,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:11:31,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 128 [2018-11-07 05:11:31,535 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:11:31,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-11-07 05:11:31,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-11-07 05:11:31,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7636, Invalid=8620, Unknown=0, NotChecked=0, Total=16256 [2018-11-07 05:11:31,537 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 65 states. [2018-11-07 05:11:31,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:11:31,695 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-11-07 05:11:31,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-11-07 05:11:31,695 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 191 [2018-11-07 05:11:31,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:11:31,696 INFO L225 Difference]: With dead ends: 201 [2018-11-07 05:11:31,696 INFO L226 Difference]: Without dead ends: 196 [2018-11-07 05:11:31,698 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 319 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=7642, Invalid=8870, Unknown=0, NotChecked=0, Total=16512 [2018-11-07 05:11:31,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-11-07 05:11:31,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2018-11-07 05:11:31,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-11-07 05:11:31,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-11-07 05:11:31,702 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 191 [2018-11-07 05:11:31,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:11:31,702 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-11-07 05:11:31,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-11-07 05:11:31,703 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-11-07 05:11:31,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-07 05:11:31,704 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:11:31,704 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:11:31,704 INFO L423 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:11:31,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:11:31,704 INFO L82 PathProgramCache]: Analyzing trace with hash -828006787, now seen corresponding path program 61 times [2018-11-07 05:11:31,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:11:31,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:31,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:11:31,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:31,705 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:11:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:11:33,950 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:11:33,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:33,950 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:11:33,950 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:11:33,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:11:33,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:33,951 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:11:33,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:11:33,960 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:11:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:11:34,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:11:34,137 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:11:34,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:11:38,618 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:11:38,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:11:38,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 130 [2018-11-07 05:11:38,638 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:11:38,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-11-07 05:11:38,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-11-07 05:11:38,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7885, Invalid=8885, Unknown=0, NotChecked=0, Total=16770 [2018-11-07 05:11:38,640 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 66 states. [2018-11-07 05:11:38,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:11:38,843 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2018-11-07 05:11:38,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-11-07 05:11:38,843 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 194 [2018-11-07 05:11:38,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:11:38,844 INFO L225 Difference]: With dead ends: 204 [2018-11-07 05:11:38,844 INFO L226 Difference]: Without dead ends: 199 [2018-11-07 05:11:38,845 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 324 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=7891, Invalid=9139, Unknown=0, NotChecked=0, Total=17030 [2018-11-07 05:11:38,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-07 05:11:38,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2018-11-07 05:11:38,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-11-07 05:11:38,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-11-07 05:11:38,848 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 194 [2018-11-07 05:11:38,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:11:38,849 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-11-07 05:11:38,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-11-07 05:11:38,849 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-11-07 05:11:38,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-07 05:11:38,850 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:11:38,850 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:11:38,850 INFO L423 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:11:38,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:11:38,851 INFO L82 PathProgramCache]: Analyzing trace with hash -513750787, now seen corresponding path program 62 times [2018-11-07 05:11:38,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:11:38,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:38,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:11:38,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:38,852 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:11:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:11:40,898 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:11:40,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:40,899 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:11:40,899 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:11:40,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:11:40,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:40,899 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:11:40,908 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:11:40,908 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:11:41,057 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2018-11-07 05:11:41,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:11:41,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:11:41,144 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:11:41,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:11:45,649 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:11:45,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:11:45,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 132 [2018-11-07 05:11:45,669 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:11:45,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-11-07 05:11:45,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-11-07 05:11:45,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8138, Invalid=9154, Unknown=0, NotChecked=0, Total=17292 [2018-11-07 05:11:45,671 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 67 states. [2018-11-07 05:11:45,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:11:45,885 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-11-07 05:11:45,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-11-07 05:11:45,886 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 197 [2018-11-07 05:11:45,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:11:45,887 INFO L225 Difference]: With dead ends: 207 [2018-11-07 05:11:45,887 INFO L226 Difference]: Without dead ends: 202 [2018-11-07 05:11:45,888 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 329 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=8144, Invalid=9412, Unknown=0, NotChecked=0, Total=17556 [2018-11-07 05:11:45,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-07 05:11:45,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2018-11-07 05:11:45,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-07 05:11:45,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-11-07 05:11:45,893 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 197 [2018-11-07 05:11:45,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:11:45,893 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-11-07 05:11:45,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-11-07 05:11:45,893 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-11-07 05:11:45,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-07 05:11:45,894 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:11:45,895 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:11:45,895 INFO L423 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:11:45,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:11:45,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1541960067, now seen corresponding path program 63 times [2018-11-07 05:11:45,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:11:45,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:45,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:11:45,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:45,896 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:11:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:11:47,508 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:11:47,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:47,508 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:11:47,508 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:11:47,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:11:47,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:47,508 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:11:47,519 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:11:47,520 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:11:47,612 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:11:47,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:11:47,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:11:47,717 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:11:47,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:11:52,414 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:11:52,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:11:52,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 134 [2018-11-07 05:11:52,434 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:11:52,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-11-07 05:11:52,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-11-07 05:11:52,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8395, Invalid=9427, Unknown=0, NotChecked=0, Total=17822 [2018-11-07 05:11:52,436 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 68 states. [2018-11-07 05:11:52,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:11:52,607 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2018-11-07 05:11:52,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-11-07 05:11:52,607 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 200 [2018-11-07 05:11:52,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:11:52,608 INFO L225 Difference]: With dead ends: 210 [2018-11-07 05:11:52,608 INFO L226 Difference]: Without dead ends: 205 [2018-11-07 05:11:52,609 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 334 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8401, Invalid=9689, Unknown=0, NotChecked=0, Total=18090 [2018-11-07 05:11:52,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-11-07 05:11:52,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2018-11-07 05:11:52,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-07 05:11:52,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2018-11-07 05:11:52,611 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 200 [2018-11-07 05:11:52,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:11:52,612 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2018-11-07 05:11:52,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-11-07 05:11:52,612 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2018-11-07 05:11:52,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-07 05:11:52,613 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:11:52,613 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:11:52,613 INFO L423 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:11:52,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:11:52,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1217865475, now seen corresponding path program 64 times [2018-11-07 05:11:52,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:11:52,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:52,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:11:52,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:52,615 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:11:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:11:54,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:11:54,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:54,208 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:11:54,208 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:11:54,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:11:54,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:54,208 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:11:54,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:11:54,219 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:11:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:11:54,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:11:54,402 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:11:54,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:11:59,230 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:11:59,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:11:59,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 136 [2018-11-07 05:11:59,250 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:11:59,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-11-07 05:11:59,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-11-07 05:11:59,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8656, Invalid=9704, Unknown=0, NotChecked=0, Total=18360 [2018-11-07 05:11:59,252 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 69 states. [2018-11-07 05:11:59,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:11:59,434 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-11-07 05:11:59,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-11-07 05:11:59,435 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 203 [2018-11-07 05:11:59,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:11:59,436 INFO L225 Difference]: With dead ends: 213 [2018-11-07 05:11:59,437 INFO L226 Difference]: Without dead ends: 208 [2018-11-07 05:11:59,437 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 339 SyntacticMatches, 1 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=8662, Invalid=9970, Unknown=0, NotChecked=0, Total=18632 [2018-11-07 05:11:59,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-11-07 05:11:59,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 207. [2018-11-07 05:11:59,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-11-07 05:11:59,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-11-07 05:11:59,441 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 203 [2018-11-07 05:11:59,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:11:59,441 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-11-07 05:11:59,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-11-07 05:11:59,442 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-11-07 05:11:59,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-07 05:11:59,442 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:11:59,442 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:11:59,443 INFO L423 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:11:59,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:11:59,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1202356611, now seen corresponding path program 65 times [2018-11-07 05:11:59,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:11:59,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:59,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:11:59,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:59,444 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:11:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:01,412 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:12:01,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:01,412 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:12:01,412 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:12:01,412 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:12:01,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:01,412 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:12:01,425 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:12:01,425 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:12:01,585 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2018-11-07 05:12:01,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:12:01,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:12:01,699 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:12:01,700 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:12:06,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:12:06,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:12:06,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 138 [2018-11-07 05:12:06,713 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:12:06,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-11-07 05:12:06,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-11-07 05:12:06,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8921, Invalid=9985, Unknown=0, NotChecked=0, Total=18906 [2018-11-07 05:12:06,714 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 70 states. [2018-11-07 05:12:06,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:12:06,912 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-11-07 05:12:06,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-11-07 05:12:06,912 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 206 [2018-11-07 05:12:06,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:12:06,914 INFO L225 Difference]: With dead ends: 216 [2018-11-07 05:12:06,914 INFO L226 Difference]: Without dead ends: 211 [2018-11-07 05:12:06,915 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 344 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=8927, Invalid=10255, Unknown=0, NotChecked=0, Total=19182 [2018-11-07 05:12:06,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-11-07 05:12:06,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 210. [2018-11-07 05:12:06,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-07 05:12:06,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2018-11-07 05:12:06,919 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 206 [2018-11-07 05:12:06,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:12:06,919 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2018-11-07 05:12:06,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-11-07 05:12:06,919 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2018-11-07 05:12:06,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-11-07 05:12:06,920 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:12:06,921 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:12:06,921 INFO L423 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:12:06,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:12:06,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1260710141, now seen corresponding path program 66 times [2018-11-07 05:12:06,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:12:06,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:06,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:12:06,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:06,922 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:12:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:08,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:12:08,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:08,775 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:12:08,776 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:12:08,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:12:08,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:08,776 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:12:08,784 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:12:08,784 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:12:08,886 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:12:08,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:12:08,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:12:08,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:12:08,980 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:12:14,021 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:12:14,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:12:14,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 140 [2018-11-07 05:12:14,041 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:12:14,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-11-07 05:12:14,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-11-07 05:12:14,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9190, Invalid=10270, Unknown=0, NotChecked=0, Total=19460 [2018-11-07 05:12:14,042 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 71 states. [2018-11-07 05:12:14,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:12:14,213 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-11-07 05:12:14,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-11-07 05:12:14,214 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 209 [2018-11-07 05:12:14,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:12:14,215 INFO L225 Difference]: With dead ends: 219 [2018-11-07 05:12:14,215 INFO L226 Difference]: Without dead ends: 214 [2018-11-07 05:12:14,216 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 349 SyntacticMatches, 1 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9196, Invalid=10544, Unknown=0, NotChecked=0, Total=19740 [2018-11-07 05:12:14,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-11-07 05:12:14,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2018-11-07 05:12:14,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-11-07 05:12:14,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-11-07 05:12:14,220 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 209 [2018-11-07 05:12:14,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:12:14,220 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-11-07 05:12:14,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-11-07 05:12:14,221 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-11-07 05:12:14,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-07 05:12:14,222 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:12:14,222 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:12:14,222 INFO L423 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:12:14,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:12:14,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1033933187, now seen corresponding path program 67 times [2018-11-07 05:12:14,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:12:14,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:14,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:12:14,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:14,223 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:12:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:16,346 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:12:16,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:16,346 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:12:16,346 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:12:16,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:12:16,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:16,347 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:12:16,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:12:16,355 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:12:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:16,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:12:16,549 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:12:16,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:12:21,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:12:21,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:12:21,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 142 [2018-11-07 05:12:21,968 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:12:21,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-11-07 05:12:21,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-11-07 05:12:21,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9463, Invalid=10559, Unknown=0, NotChecked=0, Total=20022 [2018-11-07 05:12:21,970 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 72 states. [2018-11-07 05:12:22,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:12:22,210 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2018-11-07 05:12:22,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-11-07 05:12:22,210 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 212 [2018-11-07 05:12:22,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:12:22,211 INFO L225 Difference]: With dead ends: 222 [2018-11-07 05:12:22,211 INFO L226 Difference]: Without dead ends: 217 [2018-11-07 05:12:22,212 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 354 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=9469, Invalid=10837, Unknown=0, NotChecked=0, Total=20306 [2018-11-07 05:12:22,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-11-07 05:12:22,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 216. [2018-11-07 05:12:22,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-11-07 05:12:22,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-11-07 05:12:22,217 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 212 [2018-11-07 05:12:22,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:12:22,218 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-11-07 05:12:22,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-11-07 05:12:22,218 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-11-07 05:12:22,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-07 05:12:22,219 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:12:22,219 INFO L375 BasicCegarLoop]: trace histogram [69, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:12:22,219 INFO L423 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:12:22,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:12:22,220 INFO L82 PathProgramCache]: Analyzing trace with hash -2053834499, now seen corresponding path program 68 times [2018-11-07 05:12:22,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:12:22,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:22,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:12:22,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:22,220 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:12:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:24,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:12:24,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:24,033 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:12:24,033 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:12:24,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:12:24,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:24,034 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:12:24,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:12:24,041 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:12:24,209 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2018-11-07 05:12:24,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:12:24,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:12:24,304 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:12:24,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:12:29,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:12:29,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:12:29,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 144 [2018-11-07 05:12:29,736 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:12:29,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-11-07 05:12:29,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-11-07 05:12:29,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9740, Invalid=10852, Unknown=0, NotChecked=0, Total=20592 [2018-11-07 05:12:29,738 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 73 states. [2018-11-07 05:12:29,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:12:29,950 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-11-07 05:12:29,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-11-07 05:12:29,951 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 215 [2018-11-07 05:12:29,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:12:29,952 INFO L225 Difference]: With dead ends: 225 [2018-11-07 05:12:29,952 INFO L226 Difference]: Without dead ends: 220 [2018-11-07 05:12:29,952 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 359 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=9746, Invalid=11134, Unknown=0, NotChecked=0, Total=20880 [2018-11-07 05:12:29,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-11-07 05:12:29,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 219. [2018-11-07 05:12:29,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-11-07 05:12:29,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-11-07 05:12:29,957 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 215 [2018-11-07 05:12:29,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:12:29,957 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-11-07 05:12:29,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-11-07 05:12:29,957 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-11-07 05:12:29,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-07 05:12:29,958 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:12:29,958 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:12:29,958 INFO L423 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:12:29,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:12:29,958 INFO L82 PathProgramCache]: Analyzing trace with hash 959798909, now seen corresponding path program 69 times [2018-11-07 05:12:29,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:12:29,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:29,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:12:29,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:29,959 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:12:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:32,238 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:12:32,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:32,239 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:12:32,239 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:12:32,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:12:32,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:32,239 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:12:32,247 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:12:32,247 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:12:32,356 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:12:32,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:12:32,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:12:32,457 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:12:32,457 INFO L316 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-11-07 05:12:34,576 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-07 05:12:34,777 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 70 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:12:34,777 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 05:12:34,784 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 05:12:34,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:12:34 BoogieIcfgContainer [2018-11-07 05:12:34,784 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 05:12:34,785 INFO L168 Benchmark]: Toolchain (without parser) took 234411.29 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 1.6 GB in the end (delta: -178.3 MB). Peak memory consumption was 869.8 MB. Max. memory is 7.1 GB. [2018-11-07 05:12:34,786 INFO L168 Benchmark]: CDTParser took 0.20 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-07 05:12:34,786 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.33 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-07 05:12:34,787 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.65 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-07 05:12:34,787 INFO L168 Benchmark]: Boogie Preprocessor took 25.99 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-07 05:12:34,787 INFO L168 Benchmark]: RCFGBuilder took 413.68 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 783.8 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -833.3 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-07 05:12:34,788 INFO L168 Benchmark]: TraceAbstraction took 233603.52 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 264.2 MB). Free memory was 2.3 GB in the beginning and 1.6 GB in the end (delta: 644.5 MB). Peak memory consumption was 908.7 MB. Max. memory is 7.1 GB. [2018-11-07 05:12:34,790 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.20 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 337.33 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 25.65 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.99 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 413.68 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 783.8 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -833.3 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 233603.52 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 264.2 MB). Free memory was 2.3 GB in the beginning and 1.6 GB in the end (delta: 644.5 MB). Peak memory consumption was 908.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was analyzing trace of length 219 with TraceHistMax 70,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 109 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. TIMEOUT Result, 233.4s OverallTime, 71 OverallIterations, 70 TraceHistogramMax, 9.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 780 SDtfs, 2482 SDslu, 19339 SDs, 0 SdLazy, 4603 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18260 GetRequests, 13029 SyntacticMatches, 69 SemanticMatches, 5162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18962 ImplicationChecksByTransitivity, 204.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=219occurred in iteration=70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 70 MinimizatonAttempts, 68 StatesRemovedByMinimization, 68 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 5.4s SatisfiabilityAnalysisTime, 209.0s InterpolantComputationTime, 15593 NumberOfCodeBlocks, 15593 NumberOfCodeBlocksAsserted, 965 NumberOfCheckSat, 23173 ConstructedInterpolants, 0 QuantifiedInterpolants, 9789751 SizeOfPredicates, 137 NumberOfNonLiveVariables, 29852 ConjunctsInSsa, 2818 ConjunctsInUnsatCore, 206 InterpolantComputations, 2 PerfectInterpolantSequences, 0/485622 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown