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-EXP.epf -i ../../../trunk/examples/svcomp/loop-new/count_by_2_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 10:40:37,667 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 10:40:37,669 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 10:40:37,681 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 10:40:37,682 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 10:40:37,683 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 10:40:37,687 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 10:40:37,689 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 10:40:37,691 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 10:40:37,692 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 10:40:37,698 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 10:40:37,699 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 10:40:37,700 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 10:40:37,700 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 10:40:37,705 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 10:40:37,707 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 10:40:37,708 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 10:40:37,710 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 10:40:37,714 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 10:40:37,715 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 10:40:37,716 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 10:40:37,719 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 10:40:37,725 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 10:40:37,725 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 10:40:37,726 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 10:40:37,727 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 10:40:37,728 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 10:40:37,730 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 10:40:37,731 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 10:40:37,732 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 10:40:37,732 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 10:40:37,732 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 10:40:37,734 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 10:40:37,734 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 10:40:37,735 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 10:40:37,736 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 10:40:37,736 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 10:40:37,763 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 10:40:37,763 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 10:40:37,764 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 10:40:37,764 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 10:40:37,764 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 10:40:37,765 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 10:40:37,765 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 10:40:37,765 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 10:40:37,765 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 10:40:37,765 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 10:40:37,766 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 10:40:37,766 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 10:40:37,766 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 10:40:37,766 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 10:40:37,767 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 10:40:37,767 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 10:40:37,767 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 10:40:37,767 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 10:40:37,768 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 10:40:37,768 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 10:40:37,768 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 10:40:37,768 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 10:40:37,768 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 10:40:37,769 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 10:40:37,769 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 10:40:37,769 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 10:40:37,769 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:40:37,769 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 10:40:37,770 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 10:40:37,770 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 10:40:37,770 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 10:40:37,770 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 10:40:37,770 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 10:40:37,771 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 10:40:37,771 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 10:40:37,771 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 10:40:37,830 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 10:40:37,843 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 10:40:37,848 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 10:40:37,850 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 10:40:37,850 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 10:40:37,851 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/count_by_2_true-unreach-call_true-termination.i [2018-11-07 10:40:37,906 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22e9ae774/2a5c656fd0ca468b834c5750aa707977/FLAG3e9c12089 [2018-11-07 10:40:38,331 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 10:40:38,332 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_2_true-unreach-call_true-termination.i [2018-11-07 10:40:38,340 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22e9ae774/2a5c656fd0ca468b834c5750aa707977/FLAG3e9c12089 [2018-11-07 10:40:38,354 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22e9ae774/2a5c656fd0ca468b834c5750aa707977 [2018-11-07 10:40:38,365 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 10:40:38,367 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 10:40:38,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 10:40:38,368 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 10:40:38,372 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 10:40:38,373 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:40:38" (1/1) ... [2018-11-07 10:40:38,375 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23e00d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:38, skipping insertion in model container [2018-11-07 10:40:38,376 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:40:38" (1/1) ... [2018-11-07 10:40:38,385 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 10:40:38,405 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 10:40:38,623 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:40:38,628 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 10:40:38,642 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:40:38,656 INFO L193 MainTranslator]: Completed translation [2018-11-07 10:40:38,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:38 WrapperNode [2018-11-07 10:40:38,656 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 10:40:38,657 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 10:40:38,657 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 10:40:38,657 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 10:40:38,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:38" (1/1) ... [2018-11-07 10:40:38,670 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:38" (1/1) ... [2018-11-07 10:40:38,675 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 10:40:38,675 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 10:40:38,676 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 10:40:38,676 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 10:40:38,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:38" (1/1) ... [2018-11-07 10:40:38,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:38" (1/1) ... [2018-11-07 10:40:38,684 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:38" (1/1) ... [2018-11-07 10:40:38,684 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:38" (1/1) ... [2018-11-07 10:40:38,688 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:38" (1/1) ... [2018-11-07 10:40:38,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:38" (1/1) ... [2018-11-07 10:40:38,693 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:38" (1/1) ... [2018-11-07 10:40:38,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 10:40:38,695 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 10:40:38,695 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 10:40:38,695 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 10:40:38,696 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:38" (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 10:40:38,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 10:40:38,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 10:40:38,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 10:40:38,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 10:40:38,826 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 10:40:38,826 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 10:40:38,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 10:40:38,826 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 10:40:39,003 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 10:40:39,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:40:39 BoogieIcfgContainer [2018-11-07 10:40:39,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 10:40:39,005 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 10:40:39,005 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 10:40:39,008 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 10:40:39,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:40:38" (1/3) ... [2018-11-07 10:40:39,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5755a9fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:40:39, skipping insertion in model container [2018-11-07 10:40:39,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:38" (2/3) ... [2018-11-07 10:40:39,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5755a9fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:40:39, skipping insertion in model container [2018-11-07 10:40:39,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:40:39" (3/3) ... [2018-11-07 10:40:39,012 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_2_true-unreach-call_true-termination.i [2018-11-07 10:40:39,021 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 10:40:39,028 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 10:40:39,042 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 10:40:39,071 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 10:40:39,071 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 10:40:39,071 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 10:40:39,071 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 10:40:39,072 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 10:40:39,072 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 10:40:39,072 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 10:40:39,072 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 10:40:39,091 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-07 10:40:39,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-07 10:40:39,098 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:39,099 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:39,101 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:39,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:39,108 INFO L82 PathProgramCache]: Analyzing trace with hash 563245249, now seen corresponding path program 1 times [2018-11-07 10:40:39,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:39,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:39,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:39,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:39,166 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:39,218 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 10:40:39,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:40:39,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 10:40:39,220 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:40:39,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 10:40:39,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 10:40:39,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 10:40:39,238 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-07 10:40:39,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:39,259 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-07 10:40:39,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 10:40:39,260 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-07 10:40:39,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:39,268 INFO L225 Difference]: With dead ends: 32 [2018-11-07 10:40:39,268 INFO L226 Difference]: Without dead ends: 13 [2018-11-07 10:40:39,272 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 10:40:39,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-07 10:40:39,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-07 10:40:39,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-07 10:40:39,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-07 10:40:39,309 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-11-07 10:40:39,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:39,310 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-07 10:40:39,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 10:40:39,310 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-07 10:40:39,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-07 10:40:39,311 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:39,311 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:39,312 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:39,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:39,312 INFO L82 PathProgramCache]: Analyzing trace with hash -496423, now seen corresponding path program 1 times [2018-11-07 10:40:39,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:39,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:39,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:39,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:39,314 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:39,394 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 10:40:39,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:40:39,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:40:39,395 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:40:39,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:40:39,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:40:39,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:40:39,398 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 3 states. [2018-11-07 10:40:39,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:39,574 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-07 10:40:39,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:40:39,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-07 10:40:39,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:39,576 INFO L225 Difference]: With dead ends: 21 [2018-11-07 10:40:39,577 INFO L226 Difference]: Without dead ends: 16 [2018-11-07 10:40:39,579 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 10:40:39,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-07 10:40:39,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-07 10:40:39,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-07 10:40:39,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-07 10:40:39,585 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2018-11-07 10:40:39,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:39,586 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-07 10:40:39,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:40:39,586 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-07 10:40:39,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-07 10:40:39,587 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:39,587 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:39,587 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:39,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:39,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1177044387, now seen corresponding path program 1 times [2018-11-07 10:40:39,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:39,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:39,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:39,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:39,590 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:39,681 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 10:40:39,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:39,682 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:39,682 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-11-07 10:40:39,685 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [13], [15], [22], [25], [27], [33], [34], [35], [37] [2018-11-07 10:40:39,716 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:40:39,717 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:40:39,832 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:40:39,833 INFO L272 AbstractInterpreter]: Visited 13 different actions 21 times. Merged at 3 different actions 6 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2018-11-07 10:40:39,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:39,846 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:40:39,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:39,846 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 10:40:39,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:39,867 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:40:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:39,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:39,920 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 10:40:39,920 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:39,990 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 10:40:40,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:40,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-07 10:40:40,020 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:40,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 10:40:40,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 10:40:40,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:40:40,023 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 4 states. [2018-11-07 10:40:40,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:40,074 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-07 10:40:40,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 10:40:40,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-07 10:40:40,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:40,076 INFO L225 Difference]: With dead ends: 24 [2018-11-07 10:40:40,076 INFO L226 Difference]: Without dead ends: 19 [2018-11-07 10:40:40,077 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:40:40,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-07 10:40:40,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-11-07 10:40:40,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-07 10:40:40,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-07 10:40:40,081 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 14 [2018-11-07 10:40:40,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:40,082 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-07 10:40:40,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 10:40:40,082 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-07 10:40:40,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 10:40:40,084 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:40,084 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:40,084 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:40,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:40,085 INFO L82 PathProgramCache]: Analyzing trace with hash -489337255, now seen corresponding path program 2 times [2018-11-07 10:40:40,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:40,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:40,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:40,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:40,086 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:40,158 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 10:40:40,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:40,159 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:40,159 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:40,159 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:40,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:40,159 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 10:40:40,169 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:40:40,170 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:40:40,218 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 10:40:40,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:40,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:40,227 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 10:40:40,227 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:40,397 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 10:40:40,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:40,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-07 10:40:40,418 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:40,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:40:40,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:40:40,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-07 10:40:40,419 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 5 states. [2018-11-07 10:40:40,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:40,579 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-07 10:40:40,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:40:40,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-07 10:40:40,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:40,581 INFO L225 Difference]: With dead ends: 27 [2018-11-07 10:40:40,581 INFO L226 Difference]: Without dead ends: 22 [2018-11-07 10:40:40,582 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-07 10:40:40,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-07 10:40:40,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-07 10:40:40,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-07 10:40:40,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-07 10:40:40,587 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 17 [2018-11-07 10:40:40,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:40,588 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-07 10:40:40,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:40:40,588 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-07 10:40:40,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-07 10:40:40,589 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:40,589 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:40,589 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:40,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:40,590 INFO L82 PathProgramCache]: Analyzing trace with hash -169763, now seen corresponding path program 3 times [2018-11-07 10:40:40,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:40,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:40,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:40,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:40,591 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:40,683 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 10:40:40,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:40,684 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:40,684 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:40,684 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:40,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:40,685 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 10:40:40,699 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:40:40,700 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:40:40,730 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:40:40,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:40,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:40,739 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 10:40:40,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:40,870 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 10:40:40,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:40,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-11-07 10:40:40,890 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:40,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:40:40,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:40:40,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:40:40,892 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 6 states. [2018-11-07 10:40:40,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:40,960 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-07 10:40:40,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 10:40:40,961 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-07 10:40:40,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:40,962 INFO L225 Difference]: With dead ends: 30 [2018-11-07 10:40:40,962 INFO L226 Difference]: Without dead ends: 25 [2018-11-07 10:40:40,963 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:40:40,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-07 10:40:40,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-07 10:40:40,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-07 10:40:40,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-07 10:40:40,967 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 20 [2018-11-07 10:40:40,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:40,968 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-07 10:40:40,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:40:40,968 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-07 10:40:40,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 10:40:40,969 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:40,969 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:40,970 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:40,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:40,970 INFO L82 PathProgramCache]: Analyzing trace with hash -35450919, now seen corresponding path program 4 times [2018-11-07 10:40:40,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:40,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:40,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:40,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:40,972 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:41,119 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 10:40:41,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:41,120 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:41,121 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:41,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:41,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:41,121 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 10:40:41,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:41,136 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:40:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:41,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:41,154 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 10:40:41,154 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:41,270 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 10:40:41,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:41,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-07 10:40:41,291 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:41,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 10:40:41,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 10:40:41,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-07 10:40:41,293 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 7 states. [2018-11-07 10:40:41,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:41,421 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-07 10:40:41,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 10:40:41,421 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-07 10:40:41,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:41,422 INFO L225 Difference]: With dead ends: 33 [2018-11-07 10:40:41,423 INFO L226 Difference]: Without dead ends: 28 [2018-11-07 10:40:41,424 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-07 10:40:41,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-07 10:40:41,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-07 10:40:41,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-07 10:40:41,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-07 10:40:41,433 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 23 [2018-11-07 10:40:41,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:41,433 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-07 10:40:41,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 10:40:41,436 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-07 10:40:41,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-07 10:40:41,437 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:41,437 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:41,438 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:41,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:41,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1170618205, now seen corresponding path program 5 times [2018-11-07 10:40:41,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:41,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:41,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:41,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:41,440 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:41,752 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 10:40:41,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:41,753 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:41,753 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:41,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:41,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:41,754 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 10:40:41,763 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:40:41,763 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:40:41,778 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 10:40:41,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:41,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:41,788 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 10:40:41,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:41,965 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 10:40:41,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:41,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-11-07 10:40:41,995 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:41,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 10:40:41,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 10:40:41,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-07 10:40:41,996 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 8 states. [2018-11-07 10:40:42,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:42,048 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-07 10:40:42,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 10:40:42,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-07 10:40:42,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:42,050 INFO L225 Difference]: With dead ends: 36 [2018-11-07 10:40:42,051 INFO L226 Difference]: Without dead ends: 31 [2018-11-07 10:40:42,051 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-07 10:40:42,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-07 10:40:42,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-07 10:40:42,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-07 10:40:42,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-07 10:40:42,056 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 26 [2018-11-07 10:40:42,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:42,057 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-07 10:40:42,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 10:40:42,057 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-07 10:40:42,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 10:40:42,058 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:42,058 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:42,058 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:42,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:42,059 INFO L82 PathProgramCache]: Analyzing trace with hash -520507047, now seen corresponding path program 6 times [2018-11-07 10:40:42,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:42,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:42,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:42,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:42,061 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:42,177 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 10:40:42,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:42,178 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:42,178 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:42,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:42,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:42,179 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 10:40:42,187 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:40:42,187 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:40:42,199 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:40:42,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:42,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:42,209 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 10:40:42,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:42,417 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 10:40:42,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:42,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-11-07 10:40:42,438 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:42,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 10:40:42,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 10:40:42,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-07 10:40:42,440 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 9 states. [2018-11-07 10:40:42,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:42,531 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-07 10:40:42,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 10:40:42,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-07 10:40:42,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:42,537 INFO L225 Difference]: With dead ends: 39 [2018-11-07 10:40:42,537 INFO L226 Difference]: Without dead ends: 34 [2018-11-07 10:40:42,538 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-07 10:40:42,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-07 10:40:42,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-07 10:40:42,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-07 10:40:42,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-07 10:40:42,543 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 29 [2018-11-07 10:40:42,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:42,543 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-07 10:40:42,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 10:40:42,544 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-07 10:40:42,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-07 10:40:42,545 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:42,545 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:42,545 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:42,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:42,546 INFO L82 PathProgramCache]: Analyzing trace with hash -866507299, now seen corresponding path program 7 times [2018-11-07 10:40:42,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:42,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:42,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:42,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:42,547 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:42,753 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 10:40:42,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:42,753 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:42,753 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:42,754 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:42,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:42,754 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 10:40:42,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:42,768 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:40:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:42,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:42,795 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 10:40:42,796 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:43,073 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 10:40:43,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:43,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2018-11-07 10:40:43,093 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:43,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 10:40:43,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 10:40:43,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-07 10:40:43,094 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 10 states. [2018-11-07 10:40:43,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:43,137 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-07 10:40:43,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 10:40:43,138 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-07 10:40:43,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:43,140 INFO L225 Difference]: With dead ends: 42 [2018-11-07 10:40:43,140 INFO L226 Difference]: Without dead ends: 37 [2018-11-07 10:40:43,140 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-07 10:40:43,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-07 10:40:43,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-07 10:40:43,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-07 10:40:43,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-11-07 10:40:43,145 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 32 [2018-11-07 10:40:43,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:43,145 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-11-07 10:40:43,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 10:40:43,146 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-07 10:40:43,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-07 10:40:43,147 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:43,147 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:43,147 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:43,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:43,147 INFO L82 PathProgramCache]: Analyzing trace with hash -638504231, now seen corresponding path program 8 times [2018-11-07 10:40:43,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:43,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:43,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:43,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:43,149 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:43,400 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 10:40:43,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:43,401 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:43,401 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:43,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:43,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:43,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 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 10:40:43,412 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:40:43,413 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:40:43,428 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 10:40:43,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:43,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:43,439 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 10:40:43,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:43,661 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 10:40:43,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:43,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2018-11-07 10:40:43,681 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:43,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 10:40:43,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 10:40:43,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-07 10:40:43,682 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 11 states. [2018-11-07 10:40:43,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:43,828 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-07 10:40:43,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 10:40:43,831 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-11-07 10:40:43,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:43,832 INFO L225 Difference]: With dead ends: 45 [2018-11-07 10:40:43,832 INFO L226 Difference]: Without dead ends: 40 [2018-11-07 10:40:43,833 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-07 10:40:43,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-07 10:40:43,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-07 10:40:43,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-07 10:40:43,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-11-07 10:40:43,838 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 35 [2018-11-07 10:40:43,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:43,838 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-11-07 10:40:43,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 10:40:43,839 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-07 10:40:43,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-07 10:40:43,839 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:43,840 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:43,840 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:43,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:43,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1457599581, now seen corresponding path program 9 times [2018-11-07 10:40:43,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:43,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:43,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:43,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:43,842 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:44,004 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 10:40:44,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:44,005 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:44,005 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:44,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:44,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:44,006 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 10:40:44,014 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:40:44,014 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:40:44,024 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:40:44,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:44,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:44,036 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 10:40:44,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:44,312 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 10:40:44,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:44,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-11-07 10:40:44,333 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:44,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 10:40:44,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 10:40:44,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-07 10:40:44,335 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 12 states. [2018-11-07 10:40:44,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:44,378 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-07 10:40:44,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 10:40:44,379 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-11-07 10:40:44,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:44,380 INFO L225 Difference]: With dead ends: 48 [2018-11-07 10:40:44,380 INFO L226 Difference]: Without dead ends: 43 [2018-11-07 10:40:44,381 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-07 10:40:44,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-07 10:40:44,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-11-07 10:40:44,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-07 10:40:44,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-11-07 10:40:44,386 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 38 [2018-11-07 10:40:44,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:44,386 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-11-07 10:40:44,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 10:40:44,386 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-07 10:40:44,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 10:40:44,387 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:44,387 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:44,388 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:44,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:44,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1956746329, now seen corresponding path program 10 times [2018-11-07 10:40:44,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:44,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:44,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:44,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:44,389 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:44,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:44,526 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 10:40:44,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:44,526 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:44,526 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:44,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:44,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:44,527 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 10:40:44,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:44,536 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:40:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:44,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:44,568 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 10:40:44,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:44,974 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 10:40:44,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:44,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-11-07 10:40:44,995 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:44,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 10:40:44,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 10:40:44,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-07 10:40:44,996 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 13 states. [2018-11-07 10:40:45,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:45,046 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-11-07 10:40:45,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 10:40:45,048 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2018-11-07 10:40:45,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:45,049 INFO L225 Difference]: With dead ends: 51 [2018-11-07 10:40:45,049 INFO L226 Difference]: Without dead ends: 46 [2018-11-07 10:40:45,050 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-07 10:40:45,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-07 10:40:45,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-11-07 10:40:45,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-07 10:40:45,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-11-07 10:40:45,056 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 41 [2018-11-07 10:40:45,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:45,056 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-11-07 10:40:45,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 10:40:45,057 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-11-07 10:40:45,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-07 10:40:45,057 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:45,058 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:45,058 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:45,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:45,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1434230051, now seen corresponding path program 11 times [2018-11-07 10:40:45,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:45,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:45,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:45,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:45,059 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:45,352 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 10:40:45,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:45,352 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:45,352 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:45,352 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:45,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:45,353 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 10:40:45,361 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:40:45,361 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:40:45,375 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 10:40:45,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:45,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:45,389 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 10:40:45,389 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:45,667 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 10:40:45,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:45,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2018-11-07 10:40:45,689 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:45,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 10:40:45,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 10:40:45,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-07 10:40:45,691 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 14 states. [2018-11-07 10:40:45,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:45,793 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-07 10:40:45,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 10:40:45,793 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-11-07 10:40:45,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:45,795 INFO L225 Difference]: With dead ends: 54 [2018-11-07 10:40:45,795 INFO L226 Difference]: Without dead ends: 49 [2018-11-07 10:40:45,796 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-07 10:40:45,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-07 10:40:45,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-11-07 10:40:45,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 10:40:45,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-11-07 10:40:45,801 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 44 [2018-11-07 10:40:45,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:45,802 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-11-07 10:40:45,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 10:40:45,802 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-11-07 10:40:45,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-07 10:40:45,803 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:45,803 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:45,803 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:45,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:45,804 INFO L82 PathProgramCache]: Analyzing trace with hash -85797415, now seen corresponding path program 12 times [2018-11-07 10:40:45,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:45,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:45,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:45,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:45,805 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:45,985 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 10:40:45,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:45,985 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:45,985 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:45,985 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:45,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:45,986 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 10:40:45,995 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:40:45,995 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:40:46,023 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:40:46,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:46,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:46,037 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 10:40:46,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:46,433 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 10:40:46,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:46,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2018-11-07 10:40:46,454 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:46,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 10:40:46,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 10:40:46,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-07 10:40:46,455 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 15 states. [2018-11-07 10:40:46,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:46,507 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-07 10:40:46,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 10:40:46,508 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2018-11-07 10:40:46,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:46,509 INFO L225 Difference]: With dead ends: 57 [2018-11-07 10:40:46,509 INFO L226 Difference]: Without dead ends: 52 [2018-11-07 10:40:46,510 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-07 10:40:46,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-07 10:40:46,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-07 10:40:46,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-07 10:40:46,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-11-07 10:40:46,514 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 47 [2018-11-07 10:40:46,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:46,514 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-11-07 10:40:46,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 10:40:46,515 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-11-07 10:40:46,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-07 10:40:46,515 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:46,516 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:46,516 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:46,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:46,516 INFO L82 PathProgramCache]: Analyzing trace with hash 241742173, now seen corresponding path program 13 times [2018-11-07 10:40:46,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:46,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:46,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:46,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:46,518 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:46,681 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 10:40:46,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:46,682 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:46,682 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:46,682 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:46,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:46,682 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 10:40:46,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:46,690 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:40:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:46,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:46,722 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 10:40:46,722 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:47,257 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 10:40:47,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:47,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2018-11-07 10:40:47,277 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:47,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 10:40:47,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 10:40:47,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-07 10:40:47,278 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 16 states. [2018-11-07 10:40:47,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:47,326 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-11-07 10:40:47,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 10:40:47,329 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-11-07 10:40:47,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:47,330 INFO L225 Difference]: With dead ends: 60 [2018-11-07 10:40:47,330 INFO L226 Difference]: Without dead ends: 55 [2018-11-07 10:40:47,331 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-07 10:40:47,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-07 10:40:47,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-11-07 10:40:47,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-07 10:40:47,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-11-07 10:40:47,335 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 50 [2018-11-07 10:40:47,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:47,335 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-11-07 10:40:47,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 10:40:47,336 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-07 10:40:47,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-07 10:40:47,336 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:47,337 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:47,337 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:47,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:47,337 INFO L82 PathProgramCache]: Analyzing trace with hash -192088231, now seen corresponding path program 14 times [2018-11-07 10:40:47,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:47,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:47,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:47,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:47,338 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:47,544 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 10:40:47,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:47,545 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:47,545 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:47,545 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:47,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:47,545 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 10:40:47,554 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:40:47,555 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:40:47,572 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-07 10:40:47,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:47,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:47,584 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 10:40:47,584 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:48,295 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 10:40:48,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:48,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2018-11-07 10:40:48,316 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:48,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 10:40:48,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 10:40:48,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-07 10:40:48,318 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 17 states. [2018-11-07 10:40:48,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:48,397 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-11-07 10:40:48,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 10:40:48,398 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-11-07 10:40:48,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:48,399 INFO L225 Difference]: With dead ends: 63 [2018-11-07 10:40:48,399 INFO L226 Difference]: Without dead ends: 58 [2018-11-07 10:40:48,400 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-07 10:40:48,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-07 10:40:48,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-11-07 10:40:48,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-07 10:40:48,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-11-07 10:40:48,406 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 53 [2018-11-07 10:40:48,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:48,406 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-11-07 10:40:48,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 10:40:48,406 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-07 10:40:48,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-07 10:40:48,407 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:48,407 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:48,408 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:48,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:48,408 INFO L82 PathProgramCache]: Analyzing trace with hash -877060131, now seen corresponding path program 15 times [2018-11-07 10:40:48,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:48,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:48,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:48,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:48,409 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:48,642 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 10:40:48,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:48,643 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:48,643 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:48,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:48,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:48,643 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 10:40:48,652 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:40:48,652 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:40:48,663 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:40:48,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:48,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:48,675 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 10:40:48,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:49,108 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 10:40:49,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:49,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2018-11-07 10:40:49,129 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:49,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 10:40:49,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 10:40:49,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 10:40:49,130 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 18 states. [2018-11-07 10:40:49,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:49,185 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-11-07 10:40:49,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 10:40:49,185 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2018-11-07 10:40:49,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:49,186 INFO L225 Difference]: With dead ends: 66 [2018-11-07 10:40:49,186 INFO L226 Difference]: Without dead ends: 61 [2018-11-07 10:40:49,187 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 10:40:49,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-07 10:40:49,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-11-07 10:40:49,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-07 10:40:49,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-11-07 10:40:49,192 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 56 [2018-11-07 10:40:49,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:49,192 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-11-07 10:40:49,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 10:40:49,193 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-11-07 10:40:49,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 10:40:49,194 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:49,194 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:49,194 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:49,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:49,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1485309735, now seen corresponding path program 16 times [2018-11-07 10:40:49,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:49,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:49,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:49,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:49,195 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:49,823 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 10:40:49,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:49,823 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:49,823 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:49,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:49,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:49,823 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 10:40:49,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:49,832 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:40:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:49,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:49,868 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 10:40:49,869 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:50,635 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 10:40:50,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:50,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2018-11-07 10:40:50,655 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:50,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 10:40:50,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 10:40:50,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 10:40:50,656 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 19 states. [2018-11-07 10:40:50,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:50,711 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-11-07 10:40:50,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 10:40:50,718 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2018-11-07 10:40:50,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:50,718 INFO L225 Difference]: With dead ends: 69 [2018-11-07 10:40:50,718 INFO L226 Difference]: Without dead ends: 64 [2018-11-07 10:40:50,719 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 10:40:50,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-07 10:40:50,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-11-07 10:40:50,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-07 10:40:50,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-11-07 10:40:50,723 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 59 [2018-11-07 10:40:50,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:50,723 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-11-07 10:40:50,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 10:40:50,723 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-11-07 10:40:50,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-07 10:40:50,724 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:50,724 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:50,725 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:50,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:50,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1382240675, now seen corresponding path program 17 times [2018-11-07 10:40:50,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:50,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:50,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:50,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:50,726 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:50,962 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 10:40:50,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:50,962 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:50,963 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:50,963 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:50,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:50,963 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 10:40:50,977 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:40:50,977 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:40:51,012 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-07 10:40:51,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:51,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:51,024 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 10:40:51,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:51,856 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 10:40:51,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:51,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 38 [2018-11-07 10:40:51,876 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:51,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 10:40:51,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 10:40:51,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 10:40:51,877 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 20 states. [2018-11-07 10:40:51,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:51,963 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-11-07 10:40:51,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 10:40:51,964 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 62 [2018-11-07 10:40:51,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:51,965 INFO L225 Difference]: With dead ends: 72 [2018-11-07 10:40:51,965 INFO L226 Difference]: Without dead ends: 67 [2018-11-07 10:40:51,966 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 10:40:51,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-07 10:40:51,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-11-07 10:40:51,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-07 10:40:51,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-11-07 10:40:51,969 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 62 [2018-11-07 10:40:51,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:51,970 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-11-07 10:40:51,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 10:40:51,970 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-11-07 10:40:51,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-07 10:40:51,971 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:51,971 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:51,971 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:51,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:51,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1753490855, now seen corresponding path program 18 times [2018-11-07 10:40:51,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:51,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:51,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:51,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:51,973 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:51,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:52,837 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 10:40:52,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:52,838 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:52,838 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:52,838 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:52,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:52,838 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 10:40:52,848 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:40:52,848 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:40:52,863 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:40:52,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:52,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:52,881 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 10:40:52,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:53,589 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 10:40:53,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:53,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2018-11-07 10:40:53,608 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:53,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 10:40:53,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 10:40:53,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 10:40:53,609 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 21 states. [2018-11-07 10:40:53,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:53,678 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-11-07 10:40:53,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 10:40:53,679 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 65 [2018-11-07 10:40:53,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:53,680 INFO L225 Difference]: With dead ends: 75 [2018-11-07 10:40:53,680 INFO L226 Difference]: Without dead ends: 70 [2018-11-07 10:40:53,682 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 10:40:53,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-07 10:40:53,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-11-07 10:40:53,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-07 10:40:53,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-11-07 10:40:53,686 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 65 [2018-11-07 10:40:53,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:53,687 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-11-07 10:40:53,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 10:40:53,687 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-11-07 10:40:53,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-07 10:40:53,688 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:53,688 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:53,688 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:53,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:53,689 INFO L82 PathProgramCache]: Analyzing trace with hash -2126816035, now seen corresponding path program 19 times [2018-11-07 10:40:53,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:53,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:53,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:53,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:53,690 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:53,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:53,972 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 10:40:53,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:53,972 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:53,972 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:53,973 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:53,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:53,973 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 10:40:53,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:53,982 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:40:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:54,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:54,022 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 10:40:54,022 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:54,529 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 10:40:54,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:54,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2018-11-07 10:40:54,549 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:54,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 10:40:54,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 10:40:54,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 10:40:54,551 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 22 states. [2018-11-07 10:40:54,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:54,645 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-11-07 10:40:54,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 10:40:54,646 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2018-11-07 10:40:54,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:54,647 INFO L225 Difference]: With dead ends: 78 [2018-11-07 10:40:54,647 INFO L226 Difference]: Without dead ends: 73 [2018-11-07 10:40:54,648 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 10:40:54,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-07 10:40:54,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-11-07 10:40:54,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-07 10:40:54,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-11-07 10:40:54,652 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 68 [2018-11-07 10:40:54,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:54,653 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-11-07 10:40:54,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 10:40:54,653 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-11-07 10:40:54,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-07 10:40:54,654 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:54,654 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:54,654 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:54,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:54,654 INFO L82 PathProgramCache]: Analyzing trace with hash 108043225, now seen corresponding path program 20 times [2018-11-07 10:40:54,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:54,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:54,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:54,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:54,656 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:54,945 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 10:40:54,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:54,945 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:54,945 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:54,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:54,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:54,945 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 10:40:54,954 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:40:54,955 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:40:54,975 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-07 10:40:54,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:54,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:54,986 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 10:40:54,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:55,478 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 10:40:55,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:55,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 44 [2018-11-07 10:40:55,499 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:55,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 10:40:55,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 10:40:55,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 10:40:55,501 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 23 states. [2018-11-07 10:40:55,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:55,570 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-11-07 10:40:55,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 10:40:55,572 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 71 [2018-11-07 10:40:55,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:55,573 INFO L225 Difference]: With dead ends: 81 [2018-11-07 10:40:55,573 INFO L226 Difference]: Without dead ends: 76 [2018-11-07 10:40:55,575 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 10:40:55,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-07 10:40:55,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-11-07 10:40:55,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-07 10:40:55,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-11-07 10:40:55,578 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 71 [2018-11-07 10:40:55,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:55,578 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-11-07 10:40:55,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 10:40:55,578 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-11-07 10:40:55,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-07 10:40:55,579 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:55,579 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:55,579 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:55,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:55,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1782764707, now seen corresponding path program 21 times [2018-11-07 10:40:55,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:55,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:55,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:55,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:55,581 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:56,597 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 10:40:56,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:56,597 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:56,597 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:56,597 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:56,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:56,597 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 10:40:56,606 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:40:56,606 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:40:56,636 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:40:56,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:56,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:56,651 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 10:40:56,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:57,251 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 10:40:57,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:57,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 46 [2018-11-07 10:40:57,272 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:57,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 10:40:57,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 10:40:57,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 10:40:57,273 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 24 states. [2018-11-07 10:40:57,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:57,512 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-11-07 10:40:57,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 10:40:57,513 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 74 [2018-11-07 10:40:57,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:57,514 INFO L225 Difference]: With dead ends: 84 [2018-11-07 10:40:57,514 INFO L226 Difference]: Without dead ends: 79 [2018-11-07 10:40:57,516 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 10:40:57,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-07 10:40:57,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-11-07 10:40:57,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-07 10:40:57,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-11-07 10:40:57,519 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 74 [2018-11-07 10:40:57,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:57,520 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-11-07 10:40:57,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 10:40:57,520 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-11-07 10:40:57,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-07 10:40:57,521 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:57,521 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:57,521 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:57,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:57,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1949187417, now seen corresponding path program 22 times [2018-11-07 10:40:57,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:57,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:57,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:57,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:57,523 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:57,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:57,822 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 10:40:57,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:57,822 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:57,822 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:57,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:57,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:57,823 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 10:40:57,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:57,831 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:40:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:57,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:57,861 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 10:40:57,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:59,075 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 10:40:59,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:59,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2018-11-07 10:40:59,095 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:59,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 10:40:59,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 10:40:59,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 10:40:59,097 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 25 states. [2018-11-07 10:40:59,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:59,200 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-11-07 10:40:59,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 10:40:59,203 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2018-11-07 10:40:59,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:59,204 INFO L225 Difference]: With dead ends: 87 [2018-11-07 10:40:59,204 INFO L226 Difference]: Without dead ends: 82 [2018-11-07 10:40:59,205 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 10:40:59,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-07 10:40:59,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-11-07 10:40:59,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-07 10:40:59,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-11-07 10:40:59,212 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 77 [2018-11-07 10:40:59,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:59,212 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-11-07 10:40:59,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 10:40:59,212 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-11-07 10:40:59,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-07 10:40:59,213 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:59,213 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:59,213 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:59,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:59,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1011489245, now seen corresponding path program 23 times [2018-11-07 10:40:59,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:59,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:59,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:59,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:59,218 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:59,549 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 10:40:59,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:59,550 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:59,550 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:59,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:59,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:59,550 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 10:40:59,560 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:40:59,560 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:40:59,579 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-11-07 10:40:59,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:59,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:59,593 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 10:40:59,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:00,319 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 10:41:00,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:00,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 50 [2018-11-07 10:41:00,338 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:00,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 10:41:00,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 10:41:00,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 10:41:00,340 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 26 states. [2018-11-07 10:41:00,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:00,421 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-11-07 10:41:00,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 10:41:00,421 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 80 [2018-11-07 10:41:00,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:00,422 INFO L225 Difference]: With dead ends: 90 [2018-11-07 10:41:00,422 INFO L226 Difference]: Without dead ends: 85 [2018-11-07 10:41:00,424 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 10:41:00,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-07 10:41:00,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-11-07 10:41:00,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-07 10:41:00,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-11-07 10:41:00,428 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 80 [2018-11-07 10:41:00,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:00,428 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-11-07 10:41:00,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 10:41:00,428 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-11-07 10:41:00,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-07 10:41:00,429 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:00,429 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:00,430 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:00,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:00,430 INFO L82 PathProgramCache]: Analyzing trace with hash 512540377, now seen corresponding path program 24 times [2018-11-07 10:41:00,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:00,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:00,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:41:00,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:00,431 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:00,747 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 10:41:00,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:00,747 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:00,747 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:00,747 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:00,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:00,748 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 10:41:00,757 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:41:00,757 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:41:00,772 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:41:00,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:41:00,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:00,791 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 10:41:00,791 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:01,549 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 10:41:01,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:01,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 52 [2018-11-07 10:41:01,568 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:01,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 10:41:01,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 10:41:01,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:41:01,570 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 27 states. [2018-11-07 10:41:01,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:01,704 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-11-07 10:41:01,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 10:41:01,706 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 83 [2018-11-07 10:41:01,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:01,707 INFO L225 Difference]: With dead ends: 93 [2018-11-07 10:41:01,707 INFO L226 Difference]: Without dead ends: 88 [2018-11-07 10:41:01,708 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:41:01,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-07 10:41:01,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-11-07 10:41:01,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-07 10:41:01,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-11-07 10:41:01,711 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 83 [2018-11-07 10:41:01,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:01,711 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-11-07 10:41:01,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 10:41:01,711 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-11-07 10:41:01,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-07 10:41:01,712 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:01,712 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:01,712 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:01,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:01,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1208625245, now seen corresponding path program 25 times [2018-11-07 10:41:01,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:01,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:01,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:41:01,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:01,714 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:01,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:02,137 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 10:41:02,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:02,137 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:02,138 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:02,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:02,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:02,138 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 10:41:02,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:41:02,146 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:41:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:02,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:02,176 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 10:41:02,177 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:04,144 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 10:41:04,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:04,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 54 [2018-11-07 10:41:04,164 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:04,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 10:41:04,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 10:41:04,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-11-07 10:41:04,166 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 28 states. [2018-11-07 10:41:04,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:04,246 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-11-07 10:41:04,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 10:41:04,247 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 86 [2018-11-07 10:41:04,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:04,248 INFO L225 Difference]: With dead ends: 96 [2018-11-07 10:41:04,248 INFO L226 Difference]: Without dead ends: 91 [2018-11-07 10:41:04,250 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-11-07 10:41:04,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-07 10:41:04,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-11-07 10:41:04,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-07 10:41:04,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-11-07 10:41:04,254 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 86 [2018-11-07 10:41:04,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:04,254 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-11-07 10:41:04,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 10:41:04,255 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-11-07 10:41:04,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-07 10:41:04,255 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:04,256 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:04,256 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:04,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:04,256 INFO L82 PathProgramCache]: Analyzing trace with hash -2124144551, now seen corresponding path program 26 times [2018-11-07 10:41:04,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:04,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:04,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:41:04,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:04,258 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:04,993 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 10:41:04,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:04,993 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:04,994 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:04,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:04,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:04,994 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 10:41:05,002 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:41:05,003 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:41:05,026 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-11-07 10:41:05,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:41:05,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:05,042 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 10:41:05,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:05,862 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 10:41:05,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:05,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 56 [2018-11-07 10:41:05,882 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:05,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-07 10:41:05,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-07 10:41:05,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-11-07 10:41:05,884 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 29 states. [2018-11-07 10:41:05,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:05,971 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-11-07 10:41:05,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 10:41:05,973 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 89 [2018-11-07 10:41:05,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:05,974 INFO L225 Difference]: With dead ends: 99 [2018-11-07 10:41:05,974 INFO L226 Difference]: Without dead ends: 94 [2018-11-07 10:41:05,975 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-11-07 10:41:05,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-07 10:41:05,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-11-07 10:41:05,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-07 10:41:05,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-11-07 10:41:05,978 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 89 [2018-11-07 10:41:05,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:05,979 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-11-07 10:41:05,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-07 10:41:05,979 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-11-07 10:41:05,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-07 10:41:05,979 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:05,979 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:05,980 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:05,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:05,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1910155555, now seen corresponding path program 27 times [2018-11-07 10:41:05,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:05,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:05,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:41:05,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:05,981 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:06,402 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 10:41:06,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:06,402 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:06,402 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:06,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:06,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:06,403 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 10:41:06,412 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:41:06,412 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:41:06,428 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:41:06,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:41:06,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:06,446 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 10:41:06,446 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:07,482 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 10:41:07,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:07,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 58 [2018-11-07 10:41:07,502 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:07,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 10:41:07,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 10:41:07,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-11-07 10:41:07,504 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 30 states. [2018-11-07 10:41:07,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:07,596 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-11-07 10:41:07,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-07 10:41:07,597 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 92 [2018-11-07 10:41:07,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:07,598 INFO L225 Difference]: With dead ends: 102 [2018-11-07 10:41:07,598 INFO L226 Difference]: Without dead ends: 97 [2018-11-07 10:41:07,599 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-11-07 10:41:07,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-07 10:41:07,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-11-07 10:41:07,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-07 10:41:07,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-11-07 10:41:07,603 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 92 [2018-11-07 10:41:07,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:07,603 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-11-07 10:41:07,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 10:41:07,603 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-11-07 10:41:07,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-07 10:41:07,604 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:07,604 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:07,604 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:07,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:07,605 INFO L82 PathProgramCache]: Analyzing trace with hash -695442983, now seen corresponding path program 28 times [2018-11-07 10:41:07,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:07,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:07,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:41:07,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:07,606 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:08,031 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 10:41:08,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:08,032 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:08,032 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:08,032 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:08,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:08,032 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 10:41:08,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:41:08,041 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:41:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:08,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:08,076 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 10:41:08,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:09,681 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 10:41:09,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:09,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 60 [2018-11-07 10:41:09,701 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:09,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-07 10:41:09,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-07 10:41:09,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-11-07 10:41:09,703 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 31 states. [2018-11-07 10:41:09,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:09,849 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-11-07 10:41:09,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 10:41:09,850 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 95 [2018-11-07 10:41:09,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:09,851 INFO L225 Difference]: With dead ends: 105 [2018-11-07 10:41:09,851 INFO L226 Difference]: Without dead ends: 100 [2018-11-07 10:41:09,853 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-11-07 10:41:09,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-07 10:41:09,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2018-11-07 10:41:09,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-07 10:41:09,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-11-07 10:41:09,856 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 95 [2018-11-07 10:41:09,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:09,857 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-11-07 10:41:09,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-07 10:41:09,857 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-11-07 10:41:09,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-07 10:41:09,857 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:09,857 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:09,858 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:09,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:09,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1707320669, now seen corresponding path program 29 times [2018-11-07 10:41:09,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:09,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:09,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:41:09,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:09,859 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:10,537 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 10:41:10,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:10,538 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:10,538 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:10,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 10:41:10,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:10,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 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 10:41:10,546 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:41:10,546 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:41:10,573 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-11-07 10:41:10,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:41:10,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:10,597 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 10:41:10,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:11,718 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 10:41:11,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:11,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 62 [2018-11-07 10:41:11,738 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:11,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 10:41:11,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 10:41:11,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-11-07 10:41:11,739 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 32 states. [2018-11-07 10:41:12,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:12,003 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-11-07 10:41:12,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 10:41:12,003 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 98 [2018-11-07 10:41:12,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:12,004 INFO L225 Difference]: With dead ends: 108 [2018-11-07 10:41:12,004 INFO L226 Difference]: Without dead ends: 103 [2018-11-07 10:41:12,005 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-11-07 10:41:12,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-07 10:41:12,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-11-07 10:41:12,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-07 10:41:12,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-11-07 10:41:12,008 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 98 [2018-11-07 10:41:12,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:12,008 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-11-07 10:41:12,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 10:41:12,008 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-11-07 10:41:12,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-07 10:41:12,009 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:12,009 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:12,009 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:12,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:12,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1780645031, now seen corresponding path program 30 times [2018-11-07 10:41:12,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:12,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:12,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:41:12,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:12,010 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:12,554 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 10:41:12,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:12,555 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:12,555 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:12,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:12,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:12,555 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 10:41:12,563 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:41:12,563 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:41:12,579 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:41:12,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:41:12,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:12,599 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 10:41:12,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:13,975 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 10:41:13,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:13,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 64 [2018-11-07 10:41:13,995 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:13,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 10:41:13,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 10:41:13,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-11-07 10:41:13,997 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 33 states. [2018-11-07 10:41:14,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:14,147 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-11-07 10:41:14,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 10:41:14,148 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 101 [2018-11-07 10:41:14,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:14,149 INFO L225 Difference]: With dead ends: 111 [2018-11-07 10:41:14,149 INFO L226 Difference]: Without dead ends: 106 [2018-11-07 10:41:14,151 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-11-07 10:41:14,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-07 10:41:14,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-11-07 10:41:14,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-07 10:41:14,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-11-07 10:41:14,155 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 101 [2018-11-07 10:41:14,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:14,155 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-11-07 10:41:14,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 10:41:14,155 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-11-07 10:41:14,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-07 10:41:14,156 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:14,156 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:14,156 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:14,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:14,157 INFO L82 PathProgramCache]: Analyzing trace with hash 671945693, now seen corresponding path program 31 times [2018-11-07 10:41:14,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:14,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:14,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:41:14,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:14,158 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:14,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:15,852 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 10:41:15,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:15,853 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:15,853 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:15,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:15,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:15,853 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 10:41:15,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:41:15,863 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:41:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:15,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:15,897 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 10:41:15,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:17,038 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 10:41:17,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:17,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 66 [2018-11-07 10:41:17,059 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:17,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 10:41:17,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 10:41:17,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-11-07 10:41:17,061 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 34 states. [2018-11-07 10:41:17,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:17,196 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-11-07 10:41:17,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-07 10:41:17,197 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 104 [2018-11-07 10:41:17,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:17,198 INFO L225 Difference]: With dead ends: 114 [2018-11-07 10:41:17,198 INFO L226 Difference]: Without dead ends: 109 [2018-11-07 10:41:17,199 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-11-07 10:41:17,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-07 10:41:17,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2018-11-07 10:41:17,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-07 10:41:17,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-11-07 10:41:17,203 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 104 [2018-11-07 10:41:17,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:17,203 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-11-07 10:41:17,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-07 10:41:17,203 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-11-07 10:41:17,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-07 10:41:17,205 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:17,206 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:17,206 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:17,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:17,206 INFO L82 PathProgramCache]: Analyzing trace with hash -181435175, now seen corresponding path program 32 times [2018-11-07 10:41:17,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:17,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:17,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:41:17,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:17,207 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:17,731 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 10:41:17,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:17,731 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:17,731 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:17,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:17,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:17,732 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 10:41:17,740 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:41:17,740 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:41:17,768 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-11-07 10:41:17,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:41:17,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:17,786 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 10:41:17,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:19,308 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 10:41:19,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:19,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 68 [2018-11-07 10:41:19,330 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:19,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 10:41:19,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 10:41:19,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-11-07 10:41:19,331 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 35 states. [2018-11-07 10:41:19,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:19,465 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-11-07 10:41:19,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 10:41:19,466 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 107 [2018-11-07 10:41:19,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:19,467 INFO L225 Difference]: With dead ends: 117 [2018-11-07 10:41:19,467 INFO L226 Difference]: Without dead ends: 112 [2018-11-07 10:41:19,468 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-11-07 10:41:19,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-07 10:41:19,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2018-11-07 10:41:19,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-07 10:41:19,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-11-07 10:41:19,471 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 107 [2018-11-07 10:41:19,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:19,472 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-11-07 10:41:19,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-07 10:41:19,472 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-11-07 10:41:19,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-07 10:41:19,472 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:19,472 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:19,472 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:19,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:19,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1339448739, now seen corresponding path program 33 times [2018-11-07 10:41:19,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:19,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:19,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:41:19,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:19,474 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:20,135 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 10:41:20,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:20,136 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:20,136 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:20,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:20,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:20,136 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 10:41:20,145 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:41:20,145 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:41:20,163 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:41:20,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:41:20,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:20,185 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 10:41:20,185 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:21,682 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 10:41:21,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:21,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 70 [2018-11-07 10:41:21,702 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:21,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 10:41:21,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 10:41:21,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-11-07 10:41:21,703 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 36 states. [2018-11-07 10:41:21,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:21,860 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-11-07 10:41:21,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-07 10:41:21,861 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 110 [2018-11-07 10:41:21,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:21,862 INFO L225 Difference]: With dead ends: 120 [2018-11-07 10:41:21,862 INFO L226 Difference]: Without dead ends: 115 [2018-11-07 10:41:21,863 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-11-07 10:41:21,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-07 10:41:21,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2018-11-07 10:41:21,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-07 10:41:21,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-11-07 10:41:21,866 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 110 [2018-11-07 10:41:21,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:21,867 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-11-07 10:41:21,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 10:41:21,867 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-11-07 10:41:21,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-07 10:41:21,867 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:21,868 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:21,868 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:21,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:21,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1750754905, now seen corresponding path program 34 times [2018-11-07 10:41:21,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:21,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:21,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:41:21,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:21,869 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:22,423 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 10:41:22,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:22,423 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:22,423 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:22,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:22,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:22,423 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 10:41:22,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:41:22,431 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:41:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:22,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:22,468 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 10:41:22,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:24,117 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 10:41:24,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:24,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 72 [2018-11-07 10:41:24,139 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:24,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-07 10:41:24,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-07 10:41:24,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-11-07 10:41:24,140 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 37 states. [2018-11-07 10:41:24,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:24,257 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-11-07 10:41:24,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-07 10:41:24,257 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 113 [2018-11-07 10:41:24,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:24,259 INFO L225 Difference]: With dead ends: 123 [2018-11-07 10:41:24,259 INFO L226 Difference]: Without dead ends: 118 [2018-11-07 10:41:24,259 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-11-07 10:41:24,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-07 10:41:24,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-11-07 10:41:24,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-07 10:41:24,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-11-07 10:41:24,263 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 113 [2018-11-07 10:41:24,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:24,263 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-11-07 10:41:24,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-07 10:41:24,264 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-11-07 10:41:24,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-07 10:41:24,264 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:24,265 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:24,265 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:24,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:24,265 INFO L82 PathProgramCache]: Analyzing trace with hash -616476451, now seen corresponding path program 35 times [2018-11-07 10:41:24,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:24,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:24,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:41:24,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:24,266 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:24,961 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 10:41:24,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:24,962 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:24,962 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:24,962 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:24,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:24,962 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 10:41:24,970 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:41:24,970 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:41:25,012 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-11-07 10:41:25,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:41:25,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:25,037 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 10:41:25,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:26,448 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 10:41:26,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:26,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 74 [2018-11-07 10:41:26,468 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:26,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 10:41:26,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 10:41:26,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 10:41:26,469 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 38 states. [2018-11-07 10:41:26,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:26,601 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-11-07 10:41:26,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-07 10:41:26,608 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 116 [2018-11-07 10:41:26,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:26,609 INFO L225 Difference]: With dead ends: 126 [2018-11-07 10:41:26,609 INFO L226 Difference]: Without dead ends: 121 [2018-11-07 10:41:26,610 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 10:41:26,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-07 10:41:26,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2018-11-07 10:41:26,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-07 10:41:26,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-11-07 10:41:26,613 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 116 [2018-11-07 10:41:26,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:26,613 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-11-07 10:41:26,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 10:41:26,614 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-11-07 10:41:26,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 10:41:26,614 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:26,614 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:26,615 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:26,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:26,615 INFO L82 PathProgramCache]: Analyzing trace with hash 557197273, now seen corresponding path program 36 times [2018-11-07 10:41:26,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:26,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:26,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:41:26,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:26,616 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:27,184 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 10:41:27,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:27,185 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:27,185 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:27,185 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:27,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:27,185 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 10:41:27,193 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:41:27,193 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:41:27,215 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:41:27,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:41:27,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:27,240 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 10:41:27,241 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:29,282 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 10:41:29,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:29,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 76 [2018-11-07 10:41:29,302 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:29,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 10:41:29,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 10:41:29,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-11-07 10:41:29,304 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 39 states. [2018-11-07 10:41:29,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:29,453 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-11-07 10:41:29,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 10:41:29,454 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 119 [2018-11-07 10:41:29,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:29,455 INFO L225 Difference]: With dead ends: 129 [2018-11-07 10:41:29,456 INFO L226 Difference]: Without dead ends: 124 [2018-11-07 10:41:29,456 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-11-07 10:41:29,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-07 10:41:29,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2018-11-07 10:41:29,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-07 10:41:29,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-11-07 10:41:29,460 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 119 [2018-11-07 10:41:29,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:29,460 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-11-07 10:41:29,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 10:41:29,460 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-11-07 10:41:29,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-07 10:41:29,461 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:29,461 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:29,461 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:29,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:29,462 INFO L82 PathProgramCache]: Analyzing trace with hash 142352221, now seen corresponding path program 37 times [2018-11-07 10:41:29,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:29,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:29,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:41:29,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:29,463 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:30,254 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 10:41:30,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:30,255 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:30,255 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:30,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:30,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:30,255 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 10:41:30,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:41:30,264 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:41:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:30,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:30,325 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 10:41:30,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:31,926 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 10:41:31,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:31,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 78 [2018-11-07 10:41:31,948 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:31,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-07 10:41:31,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-07 10:41:31,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-11-07 10:41:31,949 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 40 states. [2018-11-07 10:41:32,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:32,089 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-11-07 10:41:32,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-07 10:41:32,092 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 122 [2018-11-07 10:41:32,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:32,093 INFO L225 Difference]: With dead ends: 132 [2018-11-07 10:41:32,093 INFO L226 Difference]: Without dead ends: 127 [2018-11-07 10:41:32,093 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-11-07 10:41:32,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-07 10:41:32,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2018-11-07 10:41:32,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-07 10:41:32,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-11-07 10:41:32,097 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 122 [2018-11-07 10:41:32,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:32,097 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-11-07 10:41:32,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-07 10:41:32,097 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-11-07 10:41:32,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-07 10:41:32,098 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:32,098 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:32,098 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:32,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:32,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1885681319, now seen corresponding path program 38 times [2018-11-07 10:41:32,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:32,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:32,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:41:32,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:32,100 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:32,775 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 10:41:32,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:32,775 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:32,775 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:32,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:32,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:32,775 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 10:41:32,784 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:41:32,784 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:41:32,818 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-11-07 10:41:32,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:41:32,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:32,842 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 10:41:32,843 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:34,785 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 10:41:34,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:34,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 80 [2018-11-07 10:41:34,805 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:34,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-07 10:41:34,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-07 10:41:34,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-11-07 10:41:34,806 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 41 states. [2018-11-07 10:41:35,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:35,019 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-11-07 10:41:35,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 10:41:35,020 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 125 [2018-11-07 10:41:35,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:35,021 INFO L225 Difference]: With dead ends: 135 [2018-11-07 10:41:35,021 INFO L226 Difference]: Without dead ends: 130 [2018-11-07 10:41:35,022 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-11-07 10:41:35,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-07 10:41:35,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-11-07 10:41:35,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-07 10:41:35,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-11-07 10:41:35,026 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 125 [2018-11-07 10:41:35,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:35,026 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-11-07 10:41:35,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-07 10:41:35,026 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-11-07 10:41:35,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-07 10:41:35,027 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:35,027 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:35,027 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:35,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:35,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1727918627, now seen corresponding path program 39 times [2018-11-07 10:41:35,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:35,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:35,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:41:35,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:35,029 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:36,049 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 10:41:36,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:36,050 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:36,050 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:36,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:36,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:36,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 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 10:41:36,058 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:41:36,058 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:41:36,077 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:41:36,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:41:36,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:36,097 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 10:41:36,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:37,898 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 10:41:37,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:37,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 82 [2018-11-07 10:41:37,927 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:37,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 10:41:37,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 10:41:37,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-11-07 10:41:37,929 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 42 states. [2018-11-07 10:41:38,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:38,352 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-11-07 10:41:38,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-07 10:41:38,355 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 128 [2018-11-07 10:41:38,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:38,356 INFO L225 Difference]: With dead ends: 138 [2018-11-07 10:41:38,357 INFO L226 Difference]: Without dead ends: 133 [2018-11-07 10:41:38,358 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-11-07 10:41:38,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-07 10:41:38,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2018-11-07 10:41:38,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-07 10:41:38,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-11-07 10:41:38,362 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 128 [2018-11-07 10:41:38,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:38,362 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-11-07 10:41:38,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 10:41:38,362 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-11-07 10:41:38,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-07 10:41:38,363 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:38,363 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:38,363 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:38,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:38,364 INFO L82 PathProgramCache]: Analyzing trace with hash -513783079, now seen corresponding path program 40 times [2018-11-07 10:41:38,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:38,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:38,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:41:38,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:38,365 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:39,578 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 10:41:39,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:39,578 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:39,578 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:39,578 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:39,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:39,579 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 10:41:39,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:41:39,588 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:41:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:39,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:39,638 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 10:41:39,638 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:41,478 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 10:41:41,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:41,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 84 [2018-11-07 10:41:41,508 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:41,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-07 10:41:41,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-07 10:41:41,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-11-07 10:41:41,510 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 43 states. [2018-11-07 10:41:41,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:41,722 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-11-07 10:41:41,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-07 10:41:41,722 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 131 [2018-11-07 10:41:41,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:41,723 INFO L225 Difference]: With dead ends: 141 [2018-11-07 10:41:41,724 INFO L226 Difference]: Without dead ends: 136 [2018-11-07 10:41:41,724 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-11-07 10:41:41,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-07 10:41:41,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2018-11-07 10:41:41,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-07 10:41:41,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-11-07 10:41:41,728 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 131 [2018-11-07 10:41:41,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:41,729 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-11-07 10:41:41,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-07 10:41:41,729 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-11-07 10:41:41,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-07 10:41:41,730 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:41,730 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:41,730 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:41,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:41,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1878727773, now seen corresponding path program 41 times [2018-11-07 10:41:41,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:41,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:41,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:41:41,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:41,732 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:42,540 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 10:41:42,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:42,540 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:42,540 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:42,540 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:42,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:42,540 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 10:41:42,550 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:41:42,550 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:41:42,763 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-11-07 10:41:42,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:41:42,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:42,784 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 10:41:42,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:45,078 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 10:41:45,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:45,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 86 [2018-11-07 10:41:45,099 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:45,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-07 10:41:45,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-07 10:41:45,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-11-07 10:41:45,101 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 44 states. [2018-11-07 10:41:45,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:45,611 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-11-07 10:41:45,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 10:41:45,614 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 134 [2018-11-07 10:41:45,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:45,615 INFO L225 Difference]: With dead ends: 144 [2018-11-07 10:41:45,615 INFO L226 Difference]: Without dead ends: 139 [2018-11-07 10:41:45,616 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-11-07 10:41:45,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-07 10:41:45,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2018-11-07 10:41:45,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-07 10:41:45,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-11-07 10:41:45,619 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 134 [2018-11-07 10:41:45,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:45,620 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-11-07 10:41:45,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-07 10:41:45,620 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-11-07 10:41:45,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-07 10:41:45,621 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:45,621 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:45,621 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:45,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:45,621 INFO L82 PathProgramCache]: Analyzing trace with hash -2107724711, now seen corresponding path program 42 times [2018-11-07 10:41:45,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:45,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:45,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:41:45,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:45,622 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:46,425 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 10:41:46,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:46,425 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:46,425 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:46,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 10:41:46,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:46,426 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 10:41:46,436 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:41:46,436 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:41:46,457 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:41:46,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:41:46,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:46,489 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 10:41:46,489 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:50,063 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 10:41:50,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:50,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 88 [2018-11-07 10:41:50,083 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:50,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-07 10:41:50,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-07 10:41:50,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-11-07 10:41:50,085 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 45 states. [2018-11-07 10:41:50,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:50,214 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-11-07 10:41:50,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-07 10:41:50,215 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 137 [2018-11-07 10:41:50,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:50,216 INFO L225 Difference]: With dead ends: 147 [2018-11-07 10:41:50,216 INFO L226 Difference]: Without dead ends: 142 [2018-11-07 10:41:50,217 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-11-07 10:41:50,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-07 10:41:50,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-11-07 10:41:50,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-07 10:41:50,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-11-07 10:41:50,221 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 137 [2018-11-07 10:41:50,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:50,222 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-11-07 10:41:50,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-07 10:41:50,222 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-11-07 10:41:50,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-07 10:41:50,223 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:50,223 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:50,223 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:50,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:50,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1921993437, now seen corresponding path program 43 times [2018-11-07 10:41:50,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:50,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:50,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:41:50,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:50,225 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:51,053 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 10:41:51,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:51,053 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:51,053 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:51,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:51,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:51,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 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 10:41:51,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:41:51,064 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:41:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:51,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:51,111 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 10:41:51,111 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:53,193 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 10:41:53,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:53,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 90 [2018-11-07 10:41:53,214 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:53,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-07 10:41:53,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-07 10:41:53,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-11-07 10:41:53,216 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 46 states. [2018-11-07 10:41:53,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:53,359 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-11-07 10:41:53,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-07 10:41:53,360 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 140 [2018-11-07 10:41:53,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:53,362 INFO L225 Difference]: With dead ends: 150 [2018-11-07 10:41:53,362 INFO L226 Difference]: Without dead ends: 145 [2018-11-07 10:41:53,363 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-11-07 10:41:53,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-07 10:41:53,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2018-11-07 10:41:53,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-07 10:41:53,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-11-07 10:41:53,367 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 140 [2018-11-07 10:41:53,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:53,367 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-11-07 10:41:53,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-07 10:41:53,367 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-11-07 10:41:53,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-07 10:41:53,368 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:53,368 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:53,368 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:53,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:53,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1670517287, now seen corresponding path program 44 times [2018-11-07 10:41:53,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:53,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:53,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:41:53,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:53,370 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:54,913 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 10:41:54,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:54,913 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:54,913 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:54,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:54,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:54,914 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 10:41:54,923 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:41:54,923 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:41:54,981 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-11-07 10:41:54,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:41:54,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:55,005 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 10:41:55,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:57,295 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 10:41:57,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:57,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 92 [2018-11-07 10:41:57,316 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:57,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-07 10:41:57,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-07 10:41:57,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-11-07 10:41:57,317 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 47 states. [2018-11-07 10:41:57,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:57,449 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-11-07 10:41:57,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-07 10:41:57,449 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 143 [2018-11-07 10:41:57,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:57,451 INFO L225 Difference]: With dead ends: 153 [2018-11-07 10:41:57,451 INFO L226 Difference]: Without dead ends: 148 [2018-11-07 10:41:57,452 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-11-07 10:41:57,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-07 10:41:57,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2018-11-07 10:41:57,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-07 10:41:57,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-11-07 10:41:57,456 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 143 [2018-11-07 10:41:57,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:57,456 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-11-07 10:41:57,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-07 10:41:57,456 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-11-07 10:41:57,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-07 10:41:57,457 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:41:57,457 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:41:57,457 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:41:57,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:41:57,458 INFO L82 PathProgramCache]: Analyzing trace with hash 132553053, now seen corresponding path program 45 times [2018-11-07 10:41:57,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:41:57,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:57,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:41:57,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:41:57,459 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:41:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:58,414 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 10:41:58,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:58,414 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:58,414 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:58,415 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:58,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:58,415 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 10:41:58,425 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:41:58,425 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:41:58,450 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:41:58,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:41:58,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:58,476 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 10:41:58,476 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:01,052 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 10:42:01,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:01,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 94 [2018-11-07 10:42:01,072 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:01,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-07 10:42:01,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-07 10:42:01,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-11-07 10:42:01,073 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 48 states. [2018-11-07 10:42:01,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:01,212 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-11-07 10:42:01,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-07 10:42:01,212 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 146 [2018-11-07 10:42:01,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:01,213 INFO L225 Difference]: With dead ends: 156 [2018-11-07 10:42:01,213 INFO L226 Difference]: Without dead ends: 151 [2018-11-07 10:42:01,214 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-11-07 10:42:01,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-07 10:42:01,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2018-11-07 10:42:01,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-07 10:42:01,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-11-07 10:42:01,218 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 146 [2018-11-07 10:42:01,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:01,218 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-11-07 10:42:01,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-07 10:42:01,218 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-11-07 10:42:01,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-07 10:42:01,219 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:01,219 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:01,219 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:01,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:01,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1754919079, now seen corresponding path program 46 times [2018-11-07 10:42:01,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:01,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:01,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:42:01,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:01,221 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:02,226 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 10:42:02,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:02,226 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:02,226 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:02,226 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:02,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:02,227 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 10:42:02,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:02,238 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:42:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:02,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:02,291 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 10:42:02,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:04,913 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 10:42:04,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:04,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 96 [2018-11-07 10:42:04,933 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:04,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-07 10:42:04,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-07 10:42:04,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-11-07 10:42:04,934 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 49 states. [2018-11-07 10:42:05,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:05,109 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-11-07 10:42:05,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-07 10:42:05,110 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 149 [2018-11-07 10:42:05,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:05,111 INFO L225 Difference]: With dead ends: 159 [2018-11-07 10:42:05,111 INFO L226 Difference]: Without dead ends: 154 [2018-11-07 10:42:05,112 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-11-07 10:42:05,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-07 10:42:05,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-11-07 10:42:05,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-07 10:42:05,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-11-07 10:42:05,119 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 149 [2018-11-07 10:42:05,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:05,119 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-11-07 10:42:05,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-07 10:42:05,120 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-11-07 10:42:05,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-07 10:42:05,120 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:05,120 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:05,121 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:05,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:05,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1725364259, now seen corresponding path program 47 times [2018-11-07 10:42:05,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:05,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:05,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:05,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:05,125 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:06,066 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 10:42:06,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:06,067 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:06,067 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:06,067 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:06,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:06,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 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 10:42:06,075 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:42:06,076 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:42:06,128 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-11-07 10:42:06,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:42:06,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:06,161 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 10:42:06,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:08,580 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 10:42:08,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:08,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 98 [2018-11-07 10:42:08,600 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:08,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-07 10:42:08,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-07 10:42:08,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-11-07 10:42:08,601 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 50 states. [2018-11-07 10:42:09,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:09,013 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-11-07 10:42:09,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-07 10:42:09,013 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 152 [2018-11-07 10:42:09,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:09,014 INFO L225 Difference]: With dead ends: 162 [2018-11-07 10:42:09,014 INFO L226 Difference]: Without dead ends: 157 [2018-11-07 10:42:09,015 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-11-07 10:42:09,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-07 10:42:09,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2018-11-07 10:42:09,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-07 10:42:09,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-11-07 10:42:09,019 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 152 [2018-11-07 10:42:09,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:09,019 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-11-07 10:42:09,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-07 10:42:09,019 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-11-07 10:42:09,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-07 10:42:09,020 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:09,020 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:09,020 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:09,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:09,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1726017319, now seen corresponding path program 48 times [2018-11-07 10:42:09,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:09,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:09,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:42:09,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:09,021 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:10,530 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 10:42:10,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:10,531 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:10,531 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:10,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:10,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:10,531 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 10:42:10,539 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:42:10,540 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:42:10,564 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:42:10,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:42:10,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:10,591 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 10:42:10,591 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:13,117 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 10:42:13,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:13,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 100 [2018-11-07 10:42:13,137 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:13,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-07 10:42:13,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-07 10:42:13,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-11-07 10:42:13,138 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 51 states. [2018-11-07 10:42:13,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:13,306 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-11-07 10:42:13,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-07 10:42:13,306 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 155 [2018-11-07 10:42:13,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:13,307 INFO L225 Difference]: With dead ends: 165 [2018-11-07 10:42:13,307 INFO L226 Difference]: Without dead ends: 160 [2018-11-07 10:42:13,308 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-11-07 10:42:13,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-07 10:42:13,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2018-11-07 10:42:13,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-07 10:42:13,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-11-07 10:42:13,310 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 155 [2018-11-07 10:42:13,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:13,311 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-11-07 10:42:13,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-07 10:42:13,311 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-11-07 10:42:13,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-07 10:42:13,311 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:13,312 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:13,312 INFO L423 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:13,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:13,312 INFO L82 PathProgramCache]: Analyzing trace with hash 293508701, now seen corresponding path program 49 times [2018-11-07 10:42:13,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:13,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:13,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:42:13,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:13,313 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:16,167 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 10:42:16,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:16,167 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:16,167 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:16,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:16,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:16,168 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 10:42:16,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:16,176 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:42:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:16,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:16,230 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 10:42:16,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:18,819 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 10:42:18,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:18,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 102 [2018-11-07 10:42:18,840 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:18,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-07 10:42:18,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-07 10:42:18,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 10:42:18,842 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 52 states. [2018-11-07 10:42:18,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:18,995 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-11-07 10:42:18,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-07 10:42:18,996 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 158 [2018-11-07 10:42:18,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:18,997 INFO L225 Difference]: With dead ends: 168 [2018-11-07 10:42:18,997 INFO L226 Difference]: Without dead ends: 163 [2018-11-07 10:42:18,998 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 10:42:18,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-07 10:42:19,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2018-11-07 10:42:19,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-07 10:42:19,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-11-07 10:42:19,001 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 158 [2018-11-07 10:42:19,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:19,002 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-11-07 10:42:19,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-07 10:42:19,002 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-11-07 10:42:19,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-07 10:42:19,003 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:19,003 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:19,003 INFO L423 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:19,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:19,004 INFO L82 PathProgramCache]: Analyzing trace with hash 91288153, now seen corresponding path program 50 times [2018-11-07 10:42:19,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:19,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:19,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:19,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:19,005 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:20,287 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 10:42:20,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:20,287 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:20,287 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:20,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:20,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:20,288 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 10:42:20,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:42:20,298 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:42:20,345 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2018-11-07 10:42:20,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:42:20,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:20,382 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 10:42:20,383 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:23,275 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 10:42:23,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:23,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 104 [2018-11-07 10:42:23,295 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:23,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-07 10:42:23,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-07 10:42:23,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-11-07 10:42:23,297 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 53 states. [2018-11-07 10:42:23,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:23,494 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-11-07 10:42:23,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-07 10:42:23,494 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 161 [2018-11-07 10:42:23,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:23,495 INFO L225 Difference]: With dead ends: 171 [2018-11-07 10:42:23,495 INFO L226 Difference]: Without dead ends: 166 [2018-11-07 10:42:23,496 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-11-07 10:42:23,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-07 10:42:23,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-11-07 10:42:23,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-07 10:42:23,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-11-07 10:42:23,499 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 161 [2018-11-07 10:42:23,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:23,499 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-11-07 10:42:23,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-07 10:42:23,500 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-11-07 10:42:23,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-07 10:42:23,500 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:23,500 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:23,500 INFO L423 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:23,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:23,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1578058973, now seen corresponding path program 51 times [2018-11-07 10:42:23,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:23,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:23,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:42:23,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:23,502 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:25,883 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 10:42:25,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:25,883 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:25,884 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:25,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:25,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:25,884 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 10:42:25,893 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:42:25,893 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:42:25,919 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:42:25,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:42:25,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:25,957 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 10:42:25,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:28,733 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 10:42:28,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:28,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 106 [2018-11-07 10:42:28,752 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:28,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-07 10:42:28,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-07 10:42:28,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-11-07 10:42:28,754 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 54 states. [2018-11-07 10:42:28,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:28,941 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-11-07 10:42:28,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-07 10:42:28,941 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 164 [2018-11-07 10:42:28,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:28,942 INFO L225 Difference]: With dead ends: 174 [2018-11-07 10:42:28,942 INFO L226 Difference]: Without dead ends: 169 [2018-11-07 10:42:28,944 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-11-07 10:42:28,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-07 10:42:28,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2018-11-07 10:42:28,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-07 10:42:28,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-11-07 10:42:28,947 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 164 [2018-11-07 10:42:28,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:28,947 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-11-07 10:42:28,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-07 10:42:28,947 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-11-07 10:42:28,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-07 10:42:28,948 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:28,948 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:28,949 INFO L423 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:28,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:28,949 INFO L82 PathProgramCache]: Analyzing trace with hash -30166055, now seen corresponding path program 52 times [2018-11-07 10:42:28,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:28,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:28,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:42:28,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:28,950 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:35,223 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 10:42:35,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:35,223 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:35,223 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:35,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:35,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:35,224 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 10:42:35,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:35,232 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:42:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:35,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:35,299 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 10:42:35,299 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:38,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 10:42:38,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:38,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 108 [2018-11-07 10:42:38,464 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:38,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-07 10:42:38,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-07 10:42:38,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-11-07 10:42:38,465 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 55 states. [2018-11-07 10:42:38,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:38,670 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-11-07 10:42:38,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-07 10:42:38,670 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 167 [2018-11-07 10:42:38,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:38,671 INFO L225 Difference]: With dead ends: 177 [2018-11-07 10:42:38,671 INFO L226 Difference]: Without dead ends: 172 [2018-11-07 10:42:38,672 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-11-07 10:42:38,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-07 10:42:38,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2018-11-07 10:42:38,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-07 10:42:38,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-11-07 10:42:38,674 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 167 [2018-11-07 10:42:38,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:38,675 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-11-07 10:42:38,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-07 10:42:38,675 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-11-07 10:42:38,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-07 10:42:38,675 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:38,675 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:38,676 INFO L423 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:38,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:38,676 INFO L82 PathProgramCache]: Analyzing trace with hash -301788323, now seen corresponding path program 53 times [2018-11-07 10:42:38,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:38,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:38,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:38,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:38,677 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:40,994 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 10:42:40,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:40,995 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:40,995 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:40,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:40,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:40,995 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 10:42:41,004 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:42:41,004 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:42:41,052 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2018-11-07 10:42:41,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:42:41,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:41,083 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 10:42:41,083 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:44,141 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 10:42:44,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:44,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 110 [2018-11-07 10:42:44,161 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:44,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-11-07 10:42:44,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-07 10:42:44,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-11-07 10:42:44,163 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 56 states. [2018-11-07 10:42:44,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:44,361 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-11-07 10:42:44,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-11-07 10:42:44,361 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 170 [2018-11-07 10:42:44,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:44,363 INFO L225 Difference]: With dead ends: 180 [2018-11-07 10:42:44,363 INFO L226 Difference]: Without dead ends: 175 [2018-11-07 10:42:44,364 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-11-07 10:42:44,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-07 10:42:44,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2018-11-07 10:42:44,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-07 10:42:44,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-11-07 10:42:44,368 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 170 [2018-11-07 10:42:44,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:44,368 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-11-07 10:42:44,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-11-07 10:42:44,368 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-11-07 10:42:44,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-07 10:42:44,369 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:44,369 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:44,369 INFO L423 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:44,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:44,369 INFO L82 PathProgramCache]: Analyzing trace with hash -482388647, now seen corresponding path program 54 times [2018-11-07 10:42:44,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:44,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:44,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:42:44,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:44,370 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:45,772 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 10:42:45,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:45,773 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:45,773 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:45,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:45,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:45,773 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 10:42:45,783 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:42:45,783 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:42:45,817 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:42:45,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:42:45,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:45,861 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 10:42:45,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:49,235 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 10:42:49,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:49,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 112 [2018-11-07 10:42:49,255 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:49,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-11-07 10:42:49,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-07 10:42:49,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-11-07 10:42:49,256 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 57 states. [2018-11-07 10:42:49,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:49,462 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-11-07 10:42:49,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-11-07 10:42:49,462 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 173 [2018-11-07 10:42:49,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:49,463 INFO L225 Difference]: With dead ends: 183 [2018-11-07 10:42:49,463 INFO L226 Difference]: Without dead ends: 178 [2018-11-07 10:42:49,464 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-11-07 10:42:49,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-11-07 10:42:49,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-11-07 10:42:49,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-07 10:42:49,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-11-07 10:42:49,467 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 173 [2018-11-07 10:42:49,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:49,468 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-11-07 10:42:49,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-11-07 10:42:49,468 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-11-07 10:42:49,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-07 10:42:49,469 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:49,469 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:49,469 INFO L423 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:49,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:49,469 INFO L82 PathProgramCache]: Analyzing trace with hash 847380957, now seen corresponding path program 55 times [2018-11-07 10:42:49,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:49,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:49,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:42:49,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:49,470 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:51,143 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 10:42:51,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:51,143 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:51,143 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:51,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:51,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:51,144 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 10:42:51,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:51,152 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:42:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:51,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:51,225 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 10:42:51,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:54,607 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 10:42:54,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:54,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 114 [2018-11-07 10:42:54,627 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:54,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-07 10:42:54,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-07 10:42:54,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-11-07 10:42:54,628 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 58 states. [2018-11-07 10:42:54,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:54,864 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-11-07 10:42:54,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-11-07 10:42:54,864 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 176 [2018-11-07 10:42:54,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:54,865 INFO L225 Difference]: With dead ends: 186 [2018-11-07 10:42:54,865 INFO L226 Difference]: Without dead ends: 181 [2018-11-07 10:42:54,866 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-11-07 10:42:54,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-11-07 10:42:54,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2018-11-07 10:42:54,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-11-07 10:42:54,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-11-07 10:42:54,870 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 176 [2018-11-07 10:42:54,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:54,870 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-11-07 10:42:54,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-07 10:42:54,870 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-11-07 10:42:54,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-07 10:42:54,871 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:54,871 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:54,872 INFO L423 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:54,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:54,872 INFO L82 PathProgramCache]: Analyzing trace with hash -764684583, now seen corresponding path program 56 times [2018-11-07 10:42:54,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:54,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:54,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:54,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:54,873 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:56,571 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 10:42:56,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:56,571 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:56,571 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:56,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:56,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:56,572 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 10:42:56,581 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:42:56,581 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:42:56,635 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2018-11-07 10:42:56,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:42:56,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:56,677 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 10:42:56,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:43:00,012 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 10:43:00,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:43:00,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 116 [2018-11-07 10:43:00,031 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:43:00,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-11-07 10:43:00,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-11-07 10:43:00,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-11-07 10:43:00,033 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 59 states. [2018-11-07 10:43:00,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:43:00,263 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-11-07 10:43:00,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-07 10:43:00,264 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 179 [2018-11-07 10:43:00,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:43:00,265 INFO L225 Difference]: With dead ends: 189 [2018-11-07 10:43:00,265 INFO L226 Difference]: Without dead ends: 184 [2018-11-07 10:43:00,266 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-11-07 10:43:00,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-11-07 10:43:00,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2018-11-07 10:43:00,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-11-07 10:43:00,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-11-07 10:43:00,270 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 179 [2018-11-07 10:43:00,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:43:00,270 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-11-07 10:43:00,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-11-07 10:43:00,270 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-11-07 10:43:00,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-07 10:43:00,271 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:43:00,271 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:43:00,271 INFO L423 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:43:00,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:43:00,272 INFO L82 PathProgramCache]: Analyzing trace with hash 515117149, now seen corresponding path program 57 times [2018-11-07 10:43:00,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:43:00,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:00,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:43:00,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:00,273 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:43:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:01,916 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 10:43:01,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:01,916 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:43:01,917 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:43:01,917 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:43:01,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:01,917 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 10:43:01,925 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:43:01,926 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:43:01,957 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:43:01,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:43:01,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:43:02,002 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 10:43:02,002 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:43:05,462 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 10:43:05,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:43:05,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 118 [2018-11-07 10:43:05,490 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:43:05,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-11-07 10:43:05,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-11-07 10:43:05,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-11-07 10:43:05,492 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 60 states. [2018-11-07 10:43:05,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:43:05,721 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-11-07 10:43:05,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-11-07 10:43:05,722 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 182 [2018-11-07 10:43:05,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:43:05,723 INFO L225 Difference]: With dead ends: 192 [2018-11-07 10:43:05,723 INFO L226 Difference]: Without dead ends: 187 [2018-11-07 10:43:05,724 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-11-07 10:43:05,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-07 10:43:05,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2018-11-07 10:43:05,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-11-07 10:43:05,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-11-07 10:43:05,727 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 182 [2018-11-07 10:43:05,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:43:05,727 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-11-07 10:43:05,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-11-07 10:43:05,728 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-11-07 10:43:05,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-07 10:43:05,729 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:43:05,729 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:43:05,729 INFO L423 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:43:05,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:43:05,729 INFO L82 PathProgramCache]: Analyzing trace with hash 663828569, now seen corresponding path program 58 times [2018-11-07 10:43:05,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:43:05,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:05,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:43:05,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:05,730 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:43:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:07,395 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 10:43:07,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:07,395 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:43:07,396 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:43:07,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:43:07,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:07,396 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 10:43:07,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:43:07,405 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:43:07,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:07,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:43:07,488 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 10:43:07,488 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:43:11,361 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 10:43:11,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:43:11,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 120 [2018-11-07 10:43:11,381 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:43:11,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-11-07 10:43:11,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-11-07 10:43:11,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-11-07 10:43:11,382 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 61 states. [2018-11-07 10:43:11,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:43:11,581 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-11-07 10:43:11,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-11-07 10:43:11,581 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 185 [2018-11-07 10:43:11,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:43:11,583 INFO L225 Difference]: With dead ends: 195 [2018-11-07 10:43:11,583 INFO L226 Difference]: Without dead ends: 190 [2018-11-07 10:43:11,585 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-11-07 10:43:11,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-07 10:43:11,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2018-11-07 10:43:11,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-07 10:43:11,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-11-07 10:43:11,588 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 185 [2018-11-07 10:43:11,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:43:11,589 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-11-07 10:43:11,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-11-07 10:43:11,589 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-11-07 10:43:11,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-07 10:43:11,590 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:43:11,590 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:43:11,590 INFO L423 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:43:11,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:43:11,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1480507683, now seen corresponding path program 59 times [2018-11-07 10:43:11,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:43:11,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:11,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:43:11,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:11,592 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:43:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:12,948 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 10:43:12,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:12,949 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:43:12,949 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:43:12,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:43:12,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:12,949 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 10:43:12,958 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:43:12,958 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:43:13,013 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2018-11-07 10:43:13,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:43:13,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:43:13,059 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 10:43:13,059 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:43:17,051 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 10:43:17,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:43:17,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 122 [2018-11-07 10:43:17,071 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:43:17,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-11-07 10:43:17,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-11-07 10:43:17,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-11-07 10:43:17,073 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 62 states. [2018-11-07 10:43:17,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:43:17,310 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-11-07 10:43:17,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-11-07 10:43:17,310 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 188 [2018-11-07 10:43:17,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:43:17,311 INFO L225 Difference]: With dead ends: 198 [2018-11-07 10:43:17,312 INFO L226 Difference]: Without dead ends: 193 [2018-11-07 10:43:17,312 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-11-07 10:43:17,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-07 10:43:17,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2018-11-07 10:43:17,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-11-07 10:43:17,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-11-07 10:43:17,316 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 188 [2018-11-07 10:43:17,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:43:17,316 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-11-07 10:43:17,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-11-07 10:43:17,316 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-11-07 10:43:17,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-07 10:43:17,317 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:43:17,317 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:43:17,317 INFO L423 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:43:17,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:43:17,317 INFO L82 PathProgramCache]: Analyzing trace with hash -58230311, now seen corresponding path program 60 times [2018-11-07 10:43:17,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:43:17,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:17,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:43:17,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:17,318 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:43:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:18,661 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 10:43:18,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:18,662 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:43:18,662 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:43:18,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:43:18,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:18,662 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 10:43:18,672 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:43:18,672 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:43:18,701 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:43:18,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:43:18,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:43:18,735 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 10:43:18,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:43:22,774 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 10:43:22,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:43:22,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 124 [2018-11-07 10:43:22,794 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:43:22,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-11-07 10:43:22,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-11-07 10:43:22,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-11-07 10:43:22,796 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 63 states. [2018-11-07 10:43:24,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:43:24,007 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-11-07 10:43:24,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-11-07 10:43:24,007 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 191 [2018-11-07 10:43:24,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:43:24,008 INFO L225 Difference]: With dead ends: 201 [2018-11-07 10:43:24,009 INFO L226 Difference]: Without dead ends: 196 [2018-11-07 10:43:24,010 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-11-07 10:43:24,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-11-07 10:43:24,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2018-11-07 10:43:24,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-11-07 10:43:24,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-11-07 10:43:24,014 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 191 [2018-11-07 10:43:24,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:43:24,014 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-11-07 10:43:24,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-11-07 10:43:24,014 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-11-07 10:43:24,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-07 10:43:24,015 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:43:24,016 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:43:24,016 INFO L423 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:43:24,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:43:24,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1154583901, now seen corresponding path program 61 times [2018-11-07 10:43:24,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:43:24,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:24,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:43:24,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:24,017 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:43:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:27,169 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 10:43:27,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:27,170 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:43:27,170 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:43:27,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:43:27,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:27,170 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 10:43:27,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:43:27,179 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:43:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:27,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:43:27,244 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 10:43:27,245 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:43:31,207 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 10:43:31,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:43:31,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 126 [2018-11-07 10:43:31,226 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:43:31,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-11-07 10:43:31,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-11-07 10:43:31,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-11-07 10:43:31,228 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 64 states. [2018-11-07 10:43:31,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:43:31,481 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2018-11-07 10:43:31,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-11-07 10:43:31,481 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 194 [2018-11-07 10:43:31,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:43:31,482 INFO L225 Difference]: With dead ends: 204 [2018-11-07 10:43:31,482 INFO L226 Difference]: Without dead ends: 199 [2018-11-07 10:43:31,483 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-11-07 10:43:31,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-07 10:43:31,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2018-11-07 10:43:31,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-11-07 10:43:31,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-11-07 10:43:31,486 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 194 [2018-11-07 10:43:31,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:43:31,486 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-11-07 10:43:31,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-11-07 10:43:31,487 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-11-07 10:43:31,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-07 10:43:31,488 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:43:31,488 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:43:31,488 INFO L423 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:43:31,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:43:31,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1457087655, now seen corresponding path program 62 times [2018-11-07 10:43:31,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:43:31,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:31,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:43:31,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:31,489 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:43:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:33,205 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 10:43:33,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:33,206 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:43:33,206 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:43:33,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:43:33,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:33,206 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 10:43:33,224 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:43:33,224 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:43:33,285 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2018-11-07 10:43:33,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:43:33,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:43:33,321 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 10:43:33,321 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:43:37,721 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 10:43:37,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:43:37,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 128 [2018-11-07 10:43:37,741 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:43:37,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-11-07 10:43:37,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-11-07 10:43:37,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-11-07 10:43:37,743 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 65 states. [2018-11-07 10:43:38,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:43:38,018 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-11-07 10:43:38,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-11-07 10:43:38,018 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 197 [2018-11-07 10:43:38,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:43:38,020 INFO L225 Difference]: With dead ends: 207 [2018-11-07 10:43:38,020 INFO L226 Difference]: Without dead ends: 202 [2018-11-07 10:43:38,021 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-11-07 10:43:38,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-07 10:43:38,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2018-11-07 10:43:38,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-07 10:43:38,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-11-07 10:43:38,024 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 197 [2018-11-07 10:43:38,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:43:38,025 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-11-07 10:43:38,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-11-07 10:43:38,025 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-11-07 10:43:38,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-07 10:43:38,026 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:43:38,026 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:43:38,026 INFO L423 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:43:38,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:43:38,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1863121885, now seen corresponding path program 63 times [2018-11-07 10:43:38,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:43:38,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:38,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:43:38,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:38,028 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:43:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:39,576 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 10:43:39,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:39,577 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:43:39,577 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:43:39,577 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:43:39,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:39,577 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 10:43:39,588 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:43:39,588 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:43:39,618 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:43:39,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:43:39,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:43:39,688 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 10:43:39,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:43:45,148 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 10:43:45,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:43:45,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 130 [2018-11-07 10:43:45,167 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:43:45,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-11-07 10:43:45,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-11-07 10:43:45,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-11-07 10:43:45,169 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 66 states. [2018-11-07 10:43:45,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:43:45,452 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2018-11-07 10:43:45,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-11-07 10:43:45,452 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 200 [2018-11-07 10:43:45,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:43:45,453 INFO L225 Difference]: With dead ends: 210 [2018-11-07 10:43:45,453 INFO L226 Difference]: Without dead ends: 205 [2018-11-07 10:43:45,454 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-11-07 10:43:45,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-11-07 10:43:45,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2018-11-07 10:43:45,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-07 10:43:45,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2018-11-07 10:43:45,457 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 200 [2018-11-07 10:43:45,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:43:45,457 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2018-11-07 10:43:45,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-11-07 10:43:45,457 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2018-11-07 10:43:45,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-07 10:43:45,458 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:43:45,458 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:43:45,458 INFO L423 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:43:45,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:43:45,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1128701145, now seen corresponding path program 64 times [2018-11-07 10:43:45,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:43:45,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:45,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:43:45,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:45,459 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:43:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:47,474 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 10:43:47,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:47,474 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:43:47,474 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:43:47,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:43:47,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:47,475 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 10:43:47,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:43:47,483 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:43:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:47,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:43:47,563 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 10:43:47,563 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:43:51,827 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 10:43:51,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:43:51,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 132 [2018-11-07 10:43:51,846 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:43:51,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-11-07 10:43:51,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-11-07 10:43:51,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-11-07 10:43:51,848 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 67 states. [2018-11-07 10:43:52,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:43:52,069 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-11-07 10:43:52,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-11-07 10:43:52,069 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 203 [2018-11-07 10:43:52,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:43:52,070 INFO L225 Difference]: With dead ends: 213 [2018-11-07 10:43:52,070 INFO L226 Difference]: Without dead ends: 208 [2018-11-07 10:43:52,071 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-11-07 10:43:52,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-11-07 10:43:52,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 207. [2018-11-07 10:43:52,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-11-07 10:43:52,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-11-07 10:43:52,075 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 203 [2018-11-07 10:43:52,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:43:52,075 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-11-07 10:43:52,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-11-07 10:43:52,075 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-11-07 10:43:52,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-07 10:43:52,076 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:43:52,076 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:43:52,076 INFO L423 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:43:52,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:43:52,076 INFO L82 PathProgramCache]: Analyzing trace with hash 563841629, now seen corresponding path program 65 times [2018-11-07 10:43:52,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:43:52,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:52,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:43:52,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:52,077 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:43:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:53,849 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 10:43:53,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:53,850 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:43:53,850 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:43:53,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 10:43:53,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:53,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 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 10:43:53,860 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:43:53,860 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:43:53,925 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2018-11-07 10:43:53,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:43:53,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:43:53,965 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 10:43:53,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:43:58,778 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 10:43:58,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:43:58,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 134 [2018-11-07 10:43:58,798 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:43:58,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-11-07 10:43:58,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-11-07 10:43:58,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-11-07 10:43:58,800 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 68 states. [2018-11-07 10:43:59,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:43:59,007 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-11-07 10:43:59,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-11-07 10:43:59,007 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 206 [2018-11-07 10:43:59,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:43:59,009 INFO L225 Difference]: With dead ends: 216 [2018-11-07 10:43:59,009 INFO L226 Difference]: Without dead ends: 211 [2018-11-07 10:43:59,010 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-11-07 10:43:59,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-11-07 10:43:59,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 210. [2018-11-07 10:43:59,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-07 10:43:59,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2018-11-07 10:43:59,014 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 206 [2018-11-07 10:43:59,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:43:59,015 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2018-11-07 10:43:59,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-11-07 10:43:59,015 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2018-11-07 10:43:59,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-11-07 10:43:59,016 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:43:59,016 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:43:59,016 INFO L423 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:43:59,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:43:59,016 INFO L82 PathProgramCache]: Analyzing trace with hash 515866201, now seen corresponding path program 66 times [2018-11-07 10:43:59,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:43:59,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:59,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:43:59,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:59,017 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:43:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:44:00,624 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 10:44:00,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:00,624 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:44:00,624 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:44:00,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:44:00,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:00,625 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 10:44:00,633 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:44:00,633 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:44:00,662 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:44:00,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:44:00,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:44:00,706 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 10:44:00,706 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:44:05,692 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 10:44:05,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:44:05,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 136 [2018-11-07 10:44:05,713 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:44:05,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-11-07 10:44:05,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-11-07 10:44:05,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-11-07 10:44:05,715 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 69 states. [2018-11-07 10:44:06,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:44:06,237 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-11-07 10:44:06,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-11-07 10:44:06,237 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 209 [2018-11-07 10:44:06,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:44:06,238 INFO L225 Difference]: With dead ends: 219 [2018-11-07 10:44:06,238 INFO L226 Difference]: Without dead ends: 214 [2018-11-07 10:44:06,239 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-11-07 10:44:06,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-11-07 10:44:06,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2018-11-07 10:44:06,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-11-07 10:44:06,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-11-07 10:44:06,243 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 209 [2018-11-07 10:44:06,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:44:06,243 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-11-07 10:44:06,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-11-07 10:44:06,244 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-11-07 10:44:06,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-07 10:44:06,245 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:44:06,245 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:44:06,245 INFO L423 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:44:06,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:44:06,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1504000221, now seen corresponding path program 67 times [2018-11-07 10:44:06,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:44:06,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:06,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:44:06,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:06,247 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:44:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:44:08,284 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 10:44:08,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:08,285 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:44:08,285 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:44:08,285 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:44:08,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:08,285 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 10:44:08,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:44:08,293 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:44:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:44:08,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:44:08,366 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 10:44:08,367 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:44:13,388 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 10:44:13,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:44:13,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 138 [2018-11-07 10:44:13,409 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:44:13,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-11-07 10:44:13,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-11-07 10:44:13,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-11-07 10:44:13,411 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 70 states. [2018-11-07 10:44:13,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:44:13,711 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2018-11-07 10:44:13,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-11-07 10:44:13,712 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 212 [2018-11-07 10:44:13,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:44:13,713 INFO L225 Difference]: With dead ends: 222 [2018-11-07 10:44:13,713 INFO L226 Difference]: Without dead ends: 217 [2018-11-07 10:44:13,714 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-11-07 10:44:13,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-11-07 10:44:13,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 216. [2018-11-07 10:44:13,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-11-07 10:44:13,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-11-07 10:44:13,719 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 212 [2018-11-07 10:44:13,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:44:13,719 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-11-07 10:44:13,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-11-07 10:44:13,719 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-11-07 10:44:13,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-07 10:44:13,720 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:44:13,721 INFO L375 BasicCegarLoop]: trace histogram [69, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:44:13,721 INFO L423 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:44:13,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:44:13,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1298743257, now seen corresponding path program 68 times [2018-11-07 10:44:13,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:44:13,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:13,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:44:13,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:13,722 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:44:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:44:15,482 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 10:44:15,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:15,483 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:44:15,483 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:44:15,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:44:15,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:15,483 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 10:44:15,491 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:44:15,491 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:44:15,558 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2018-11-07 10:44:15,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:44:15,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:44:15,602 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 10:44:15,602 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:44:20,735 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 10:44:20,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:44:20,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 140 [2018-11-07 10:44:20,754 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:44:20,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-11-07 10:44:20,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-11-07 10:44:20,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-11-07 10:44:20,756 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 71 states. [2018-11-07 10:44:20,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:44:20,998 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-11-07 10:44:20,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-11-07 10:44:20,999 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 215 [2018-11-07 10:44:20,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:44:21,000 INFO L225 Difference]: With dead ends: 225 [2018-11-07 10:44:21,000 INFO L226 Difference]: Without dead ends: 220 [2018-11-07 10:44:21,000 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-11-07 10:44:21,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-11-07 10:44:21,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 219. [2018-11-07 10:44:21,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-11-07 10:44:21,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-11-07 10:44:21,003 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 215 [2018-11-07 10:44:21,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:44:21,004 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-11-07 10:44:21,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-11-07 10:44:21,004 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-11-07 10:44:21,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-07 10:44:21,005 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:44:21,005 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:44:21,005 INFO L423 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:44:21,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:44:21,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1773009059, now seen corresponding path program 69 times [2018-11-07 10:44:21,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:44:21,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:21,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:44:21,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:21,006 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:44:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:44:22,772 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 10:44:22,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:22,772 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:44:22,773 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:44:22,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:44:22,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:22,773 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 10:44:22,782 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:44:22,782 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:44:22,814 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:44:22,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:44:22,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:44:22,860 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 10:44:22,860 INFO L316 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-11-07 10:44:28,094 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-07 10:44:28,295 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 70 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:44:28,295 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 10:44:28,301 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 10:44:28,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:44:28 BoogieIcfgContainer [2018-11-07 10:44:28,301 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 10:44:28,302 INFO L168 Benchmark]: Toolchain (without parser) took 229936.38 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 660.6 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -165.5 MB). Peak memory consumption was 495.1 MB. Max. memory is 7.1 GB. [2018-11-07 10:44:28,303 INFO L168 Benchmark]: CDTParser took 0.19 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 10:44:28,303 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.00 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 10:44:28,304 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.10 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 10:44:28,304 INFO L168 Benchmark]: Boogie Preprocessor took 19.36 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 10:44:28,304 INFO L168 Benchmark]: RCFGBuilder took 309.12 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 706.2 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -757.5 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-07 10:44:28,305 INFO L168 Benchmark]: TraceAbstraction took 229296.34 ms. Allocated memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -45.6 MB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 581.4 MB). Peak memory consumption was 535.8 MB. Max. memory is 7.1 GB. [2018-11-07 10:44:28,308 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.19 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. * CACSL2BoogieTranslator took 289.00 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 18.10 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 19.36 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 309.12 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 706.2 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -757.5 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 229296.34 ms. Allocated memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -45.6 MB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 581.4 MB). Peak memory consumption was 535.8 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 141 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. TIMEOUT Result, 229.2s OverallTime, 71 OverallIterations, 70 TraceHistogramMax, 12.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 779 SDtfs, 2415 SDslu, 16575 SDs, 0 SdLazy, 6738 SolverSat, 102 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18059 GetRequests, 13230 SyntacticMatches, 0 SemanticMatches, 4829 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 197.3s 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.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 70 MinimizatonAttempts, 69 StatesRemovedByMinimization, 69 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 202.5s InterpolantComputationTime, 15593 NumberOfCodeBlocks, 15593 NumberOfCodeBlocksAsserted, 965 NumberOfCheckSat, 23173 ConstructedInterpolants, 0 QuantifiedInterpolants, 9635651 SizeOfPredicates, 68 NumberOfNonLiveVariables, 10948 ConjunctsInSsa, 2482 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