java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono4_false-unreach-call1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 05:10:05,706 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 05:10:05,710 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 05:10:05,725 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 05:10:05,725 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 05:10:05,727 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 05:10:05,732 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 05:10:05,735 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 05:10:05,737 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 05:10:05,743 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 05:10:05,744 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 05:10:05,747 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 05:10:05,749 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 05:10:05,749 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 05:10:05,750 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 05:10:05,751 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 05:10:05,755 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 05:10:05,756 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 05:10:05,763 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 05:10:05,767 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 05:10:05,768 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 05:10:05,769 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 05:10:05,776 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 05:10:05,776 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 05:10:05,776 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 05:10:05,777 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 05:10:05,778 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 05:10:05,781 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 05:10:05,782 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 05:10:05,784 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 05:10:05,784 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 05:10:05,784 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 05:10:05,786 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 05:10:05,787 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 05:10:05,788 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 05:10:05,789 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 05:10:05,789 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 05:10:05,821 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 05:10:05,821 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 05:10:05,822 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 05:10:05,822 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 05:10:05,823 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 05:10:05,823 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 05:10:05,823 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 05:10:05,823 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 05:10:05,823 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 05:10:05,824 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 05:10:05,824 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 05:10:05,824 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 05:10:05,825 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 05:10:05,825 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 05:10:05,825 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 05:10:05,825 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 05:10:05,826 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 05:10:05,826 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 05:10:05,826 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 05:10:05,826 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 05:10:05,826 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 05:10:05,827 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 05:10:05,827 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 05:10:05,827 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 05:10:05,827 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 05:10:05,827 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 05:10:05,828 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 05:10:05,828 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 05:10:05,828 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 05:10:05,828 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 05:10:05,828 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 05:10:05,829 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 05:10:05,829 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 05:10:05,829 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 05:10:05,878 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 05:10:05,891 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 05:10:05,896 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 05:10:05,897 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 05:10:05,898 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 05:10:05,899 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono4_false-unreach-call1.c [2018-11-07 05:10:05,959 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f998f91a/65faad24247246f18d2556ba79e8fcf4/FLAGb5a7bcd1e [2018-11-07 05:10:06,384 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 05:10:06,384 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono4_false-unreach-call1.c [2018-11-07 05:10:06,390 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f998f91a/65faad24247246f18d2556ba79e8fcf4/FLAGb5a7bcd1e [2018-11-07 05:10:06,407 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f998f91a/65faad24247246f18d2556ba79e8fcf4 [2018-11-07 05:10:06,420 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 05:10:06,422 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 05:10:06,423 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 05:10:06,423 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 05:10:06,427 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 05:10:06,428 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:10:06" (1/1) ... [2018-11-07 05:10:06,431 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@567b4d96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:10:06, skipping insertion in model container [2018-11-07 05:10:06,431 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:10:06" (1/1) ... [2018-11-07 05:10:06,442 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 05:10:06,463 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 05:10:06,679 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 05:10:06,685 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 05:10:06,706 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 05:10:06,723 INFO L193 MainTranslator]: Completed translation [2018-11-07 05:10:06,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:10:06 WrapperNode [2018-11-07 05:10:06,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 05:10:06,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 05:10:06,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 05:10:06,725 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 05:10:06,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:10:06" (1/1) ... [2018-11-07 05:10:06,743 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:10:06" (1/1) ... [2018-11-07 05:10:06,749 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 05:10:06,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 05:10:06,750 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 05:10:06,750 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 05:10:06,758 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:10:06" (1/1) ... [2018-11-07 05:10:06,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:10:06" (1/1) ... [2018-11-07 05:10:06,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:10:06" (1/1) ... [2018-11-07 05:10:06,760 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:10:06" (1/1) ... [2018-11-07 05:10:06,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:10:06" (1/1) ... [2018-11-07 05:10:06,768 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:10:06" (1/1) ... [2018-11-07 05:10:06,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:10:06" (1/1) ... [2018-11-07 05:10:06,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 05:10:06,771 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 05:10:06,771 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 05:10:06,771 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 05:10:06,772 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:10:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 05:10:06,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 05:10:06,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 05:10:06,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 05:10:06,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 05:10:06,910 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 05:10:06,911 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 05:10:06,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 05:10:06,911 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 05:10:07,115 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 05:10:07,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:10:07 BoogieIcfgContainer [2018-11-07 05:10:07,116 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 05:10:07,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 05:10:07,117 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 05:10:07,120 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 05:10:07,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:10:06" (1/3) ... [2018-11-07 05:10:07,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be30c85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:10:07, skipping insertion in model container [2018-11-07 05:10:07,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:10:06" (2/3) ... [2018-11-07 05:10:07,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be30c85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:10:07, skipping insertion in model container [2018-11-07 05:10:07,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:10:07" (3/3) ... [2018-11-07 05:10:07,124 INFO L112 eAbstractionObserver]: Analyzing ICFG Mono4_false-unreach-call1.c [2018-11-07 05:10:07,134 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 05:10:07,143 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 05:10:07,160 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 05:10:07,195 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 05:10:07,196 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 05:10:07,196 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 05:10:07,196 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 05:10:07,196 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 05:10:07,196 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 05:10:07,196 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 05:10:07,197 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 05:10:07,216 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-07 05:10:07,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-07 05:10:07,223 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:07,224 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:07,226 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:07,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:07,232 INFO L82 PathProgramCache]: Analyzing trace with hash -147882559, now seen corresponding path program 1 times [2018-11-07 05:10:07,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:07,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:07,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:07,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:07,280 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:07,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:07,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:10:07,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 05:10:07,346 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:10:07,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 05:10:07,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 05:10:07,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 05:10:07,366 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-07 05:10:07,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:07,390 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-07 05:10:07,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 05:10:07,391 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-07 05:10:07,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:07,401 INFO L225 Difference]: With dead ends: 32 [2018-11-07 05:10:07,401 INFO L226 Difference]: Without dead ends: 13 [2018-11-07 05:10:07,405 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 05:10:07,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-07 05:10:07,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-07 05:10:07,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-07 05:10:07,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-07 05:10:07,448 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-07 05:10:07,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:07,449 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-07 05:10:07,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 05:10:07,450 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-07 05:10:07,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-07 05:10:07,450 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:07,450 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:07,451 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:07,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:07,452 INFO L82 PathProgramCache]: Analyzing trace with hash -717461825, now seen corresponding path program 1 times [2018-11-07 05:10:07,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:07,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:07,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:07,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:07,454 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:07,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:07,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:10:07,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 05:10:07,551 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:10:07,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 05:10:07,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 05:10:07,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 05:10:07,556 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2018-11-07 05:10:07,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:07,652 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-07 05:10:07,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 05:10:07,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-07 05:10:07,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:07,653 INFO L225 Difference]: With dead ends: 24 [2018-11-07 05:10:07,653 INFO L226 Difference]: Without dead ends: 16 [2018-11-07 05:10:07,654 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 05:10:07,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-07 05:10:07,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-07 05:10:07,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-07 05:10:07,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-07 05:10:07,660 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2018-11-07 05:10:07,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:07,660 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-07 05:10:07,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 05:10:07,661 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-07 05:10:07,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-07 05:10:07,661 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:07,662 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:07,662 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:07,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:07,663 INFO L82 PathProgramCache]: Analyzing trace with hash 64649018, now seen corresponding path program 1 times [2018-11-07 05:10:07,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:07,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:07,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:07,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:07,665 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:07,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:07,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:07,737 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:07,738 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-11-07 05:10:07,740 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [27], [30], [32], [38], [39], [40], [42] [2018-11-07 05:10:07,793 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:10:07,794 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:10:07,987 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 05:10:07,989 INFO L272 AbstractInterpreter]: Visited 9 different actions 41 times. Merged at 3 different actions 24 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2018-11-07 05:10:08,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:08,034 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 05:10:08,104 INFO L219 lantSequenceWeakener]: Could never weaken! [2018-11-07 05:10:08,104 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 05:10:08,136 INFO L415 sIntCurrentIteration]: We unified 13 AI predicates to 13 [2018-11-07 05:10:08,136 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 05:10:08,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 05:10:08,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-07 05:10:08,138 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:10:08,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 05:10:08,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 05:10:08,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 05:10:08,139 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 3 states. [2018-11-07 05:10:08,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:08,230 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-07 05:10:08,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 05:10:08,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-07 05:10:08,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:08,232 INFO L225 Difference]: With dead ends: 24 [2018-11-07 05:10:08,232 INFO L226 Difference]: Without dead ends: 19 [2018-11-07 05:10:08,233 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 05:10:08,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-07 05:10:08,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-07 05:10:08,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-07 05:10:08,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-07 05:10:08,239 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2018-11-07 05:10:08,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:08,239 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-07 05:10:08,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 05:10:08,239 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-07 05:10:08,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 05:10:08,240 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:08,240 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:08,241 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:08,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:08,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1506199393, now seen corresponding path program 1 times [2018-11-07 05:10:08,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:08,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:08,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:08,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:08,243 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:08,315 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:08,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:08,315 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:08,316 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2018-11-07 05:10:08,316 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [19], [27], [30], [32], [38], [39], [40], [42] [2018-11-07 05:10:08,321 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:10:08,325 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:10:08,429 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 05:10:08,429 INFO L272 AbstractInterpreter]: Visited 14 different actions 68 times. Merged at 5 different actions 31 times. Widened at 2 different actions 6 times. Found 4 fixpoints after 2 different actions. Largest state had 2 variables. [2018-11-07 05:10:08,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:08,461 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 05:10:08,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:08,461 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:08,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:08,474 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:10:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:08,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:08,520 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:08,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:08,628 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:08,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:08,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-07 05:10:08,652 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:08,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 05:10:08,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 05:10:08,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-07 05:10:08,653 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 4 states. [2018-11-07 05:10:08,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:08,732 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-07 05:10:08,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 05:10:08,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-07 05:10:08,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:08,734 INFO L225 Difference]: With dead ends: 30 [2018-11-07 05:10:08,734 INFO L226 Difference]: Without dead ends: 22 [2018-11-07 05:10:08,734 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 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 05:10:08,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-07 05:10:08,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-07 05:10:08,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-07 05:10:08,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-07 05:10:08,741 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 17 [2018-11-07 05:10:08,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:08,741 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-07 05:10:08,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 05:10:08,742 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-07 05:10:08,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-07 05:10:08,742 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:08,743 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:08,743 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:08,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:08,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1748455324, now seen corresponding path program 2 times [2018-11-07 05:10:08,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:08,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:08,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:08,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:08,745 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:08,900 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:08,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:08,901 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:08,902 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:08,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:08,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:08,902 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:08,913 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:10:08,913 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:10:08,958 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 05:10:08,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:10:08,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:09,101 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-07 05:10:09,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:09,513 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-07 05:10:09,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:09,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2018-11-07 05:10:09,534 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:09,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 05:10:09,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 05:10:09,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-11-07 05:10:09,536 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 10 states. [2018-11-07 05:10:09,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:09,679 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2018-11-07 05:10:09,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 05:10:09,680 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-11-07 05:10:09,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:09,681 INFO L225 Difference]: With dead ends: 39 [2018-11-07 05:10:09,682 INFO L226 Difference]: Without dead ends: 28 [2018-11-07 05:10:09,683 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2018-11-07 05:10:09,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-07 05:10:09,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-07 05:10:09,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-07 05:10:09,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-07 05:10:09,690 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 20 [2018-11-07 05:10:09,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:09,691 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-07 05:10:09,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 05:10:09,691 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-07 05:10:09,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-07 05:10:09,692 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:09,692 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:09,693 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:09,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:09,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1522422854, now seen corresponding path program 3 times [2018-11-07 05:10:09,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:09,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:09,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:10:09,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:09,695 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:09,783 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 05:10:09,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:09,784 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:09,784 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:09,785 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:09,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:09,785 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:09,803 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:10:09,804 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:10:09,825 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:10:09,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:10:09,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:10,277 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:10,278 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:10,410 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:10:10,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:10,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2018-11-07 05:10:10,432 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:10,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 05:10:10,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 05:10:10,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-07 05:10:10,433 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 11 states. [2018-11-07 05:10:10,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:10,542 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2018-11-07 05:10:10,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 05:10:10,543 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-11-07 05:10:10,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:10,546 INFO L225 Difference]: With dead ends: 60 [2018-11-07 05:10:10,546 INFO L226 Difference]: Without dead ends: 49 [2018-11-07 05:10:10,547 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-07 05:10:10,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-07 05:10:10,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2018-11-07 05:10:10,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-07 05:10:10,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-07 05:10:10,556 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 26 [2018-11-07 05:10:10,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:10,557 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-07 05:10:10,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 05:10:10,557 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-07 05:10:10,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-07 05:10:10,558 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:10,558 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:10,559 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:10,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:10,559 INFO L82 PathProgramCache]: Analyzing trace with hash -702778436, now seen corresponding path program 4 times [2018-11-07 05:10:10,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:10,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:10,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:10:10,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:10,561 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:10,639 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 70 proven. 30 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 05:10:10,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:10,640 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:10,640 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:10,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:10,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:10,640 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:10,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:10,649 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:10:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:10,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:10,678 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 70 proven. 30 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 05:10:10,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:10,882 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 70 proven. 30 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 05:10:10,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:10,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-07 05:10:10,905 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:10,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 05:10:10,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 05:10:10,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-07 05:10:10,906 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 7 states. [2018-11-07 05:10:10,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:10,984 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2018-11-07 05:10:10,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 05:10:10,987 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-11-07 05:10:10,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:10,988 INFO L225 Difference]: With dead ends: 64 [2018-11-07 05:10:10,989 INFO L226 Difference]: Without dead ends: 42 [2018-11-07 05:10:10,989 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 72 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 05:10:10,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-07 05:10:10,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-07 05:10:10,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-07 05:10:10,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-07 05:10:11,000 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 38 [2018-11-07 05:10:11,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:11,000 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-07 05:10:11,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 05:10:11,000 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-07 05:10:11,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 05:10:11,002 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:11,002 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:11,002 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:11,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:11,004 INFO L82 PathProgramCache]: Analyzing trace with hash 966979169, now seen corresponding path program 5 times [2018-11-07 05:10:11,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:11,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:11,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:11,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:11,007 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:11,158 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 84 proven. 45 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 05:10:11,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:11,159 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:11,159 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:11,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 05:10:11,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:11,160 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:11,175 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:10:11,176 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:10:11,192 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-07 05:10:11,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:10:11,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:11,363 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 05:10:11,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:11,591 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 05:10:11,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:11,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 26 [2018-11-07 05:10:11,613 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:11,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 05:10:11,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 05:10:11,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2018-11-07 05:10:11,615 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 17 states. [2018-11-07 05:10:12,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:12,010 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2018-11-07 05:10:12,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 05:10:12,012 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2018-11-07 05:10:12,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:12,014 INFO L225 Difference]: With dead ends: 132 [2018-11-07 05:10:12,014 INFO L226 Difference]: Without dead ends: 107 [2018-11-07 05:10:12,015 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=266, Invalid=790, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 05:10:12,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-07 05:10:12,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 48. [2018-11-07 05:10:12,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 05:10:12,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-11-07 05:10:12,027 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 41 [2018-11-07 05:10:12,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:12,027 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-07 05:10:12,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 05:10:12,028 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-07 05:10:12,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-07 05:10:12,029 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:12,029 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:12,029 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:12,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:12,030 INFO L82 PathProgramCache]: Analyzing trace with hash 483382719, now seen corresponding path program 6 times [2018-11-07 05:10:12,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:12,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:12,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:10:12,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:12,031 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:12,171 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 119 proven. 63 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 05:10:12,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:12,172 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:12,172 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:12,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:12,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:12,173 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:12,181 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:10:12,182 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:10:12,197 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:10:12,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:10:12,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:12,211 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 119 proven. 63 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 05:10:12,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:12,367 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 119 proven. 63 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 05:10:12,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:12,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-11-07 05:10:12,387 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:12,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 05:10:12,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 05:10:12,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-07 05:10:12,389 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 9 states. [2018-11-07 05:10:12,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:12,522 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2018-11-07 05:10:12,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 05:10:12,523 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-11-07 05:10:12,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:12,525 INFO L225 Difference]: With dead ends: 73 [2018-11-07 05:10:12,525 INFO L226 Difference]: Without dead ends: 51 [2018-11-07 05:10:12,526 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 88 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 05:10:12,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-07 05:10:12,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-07 05:10:12,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-07 05:10:12,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-11-07 05:10:12,545 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 47 [2018-11-07 05:10:12,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:12,549 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-11-07 05:10:12,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 05:10:12,549 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-11-07 05:10:12,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-07 05:10:12,551 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:12,551 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:12,552 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:12,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:12,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1018657606, now seen corresponding path program 7 times [2018-11-07 05:10:12,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:12,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:12,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:10:12,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:12,557 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:12,690 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 136 proven. 84 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 05:10:12,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:12,691 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:12,691 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:12,691 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:12,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:12,691 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:12,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:12,702 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:10:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:12,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:12,740 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 136 proven. 84 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 05:10:12,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:13,031 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 136 proven. 84 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 05:10:13,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:13,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2018-11-07 05:10:13,053 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:13,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 05:10:13,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 05:10:13,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-07 05:10:13,054 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 10 states. [2018-11-07 05:10:13,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:13,137 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2018-11-07 05:10:13,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 05:10:13,137 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-11-07 05:10:13,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:13,138 INFO L225 Difference]: With dead ends: 76 [2018-11-07 05:10:13,138 INFO L226 Difference]: Without dead ends: 54 [2018-11-07 05:10:13,139 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-07 05:10:13,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-07 05:10:13,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-07 05:10:13,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-07 05:10:13,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-11-07 05:10:13,148 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 50 [2018-11-07 05:10:13,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:13,149 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-11-07 05:10:13,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 05:10:13,149 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-11-07 05:10:13,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-07 05:10:13,150 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:13,150 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:13,151 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:13,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:13,151 INFO L82 PathProgramCache]: Analyzing trace with hash 962277343, now seen corresponding path program 8 times [2018-11-07 05:10:13,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:13,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:13,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:13,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:13,153 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:13,279 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 153 proven. 108 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 05:10:13,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:13,280 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:13,280 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:13,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:13,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:13,280 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:13,289 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:10:13,290 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:10:13,306 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 05:10:13,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:10:13,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:13,471 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 193 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-07 05:10:13,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:13,880 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 193 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-07 05:10:13,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:13,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 31 [2018-11-07 05:10:13,903 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:13,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 05:10:13,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 05:10:13,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=733, Unknown=0, NotChecked=0, Total=930 [2018-11-07 05:10:13,907 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 21 states. [2018-11-07 05:10:14,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:14,220 INFO L93 Difference]: Finished difference Result 144 states and 177 transitions. [2018-11-07 05:10:14,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 05:10:14,220 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 53 [2018-11-07 05:10:14,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:14,221 INFO L225 Difference]: With dead ends: 144 [2018-11-07 05:10:14,221 INFO L226 Difference]: Without dead ends: 119 [2018-11-07 05:10:14,223 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=428, Invalid=1212, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 05:10:14,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-07 05:10:14,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 60. [2018-11-07 05:10:14,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-07 05:10:14,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2018-11-07 05:10:14,235 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 53 [2018-11-07 05:10:14,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:14,236 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2018-11-07 05:10:14,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 05:10:14,236 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2018-11-07 05:10:14,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 05:10:14,237 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:14,238 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:14,238 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:14,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:14,238 INFO L82 PathProgramCache]: Analyzing trace with hash 396561409, now seen corresponding path program 9 times [2018-11-07 05:10:14,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:14,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:14,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:10:14,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:14,240 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:14,543 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 200 proven. 135 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 05:10:14,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:14,544 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:14,544 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:14,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:14,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:14,544 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:14,553 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:10:14,554 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:10:14,575 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:10:14,575 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:10:14,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:14,592 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 200 proven. 135 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 05:10:14,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:14,917 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 200 proven. 135 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 05:10:14,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:14,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-11-07 05:10:14,939 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:14,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 05:10:14,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 05:10:14,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-07 05:10:14,940 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand 12 states. [2018-11-07 05:10:15,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:15,000 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2018-11-07 05:10:15,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 05:10:15,000 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-11-07 05:10:15,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:15,001 INFO L225 Difference]: With dead ends: 88 [2018-11-07 05:10:15,001 INFO L226 Difference]: Without dead ends: 63 [2018-11-07 05:10:15,003 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-07 05:10:15,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-07 05:10:15,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-11-07 05:10:15,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-07 05:10:15,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2018-11-07 05:10:15,013 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 59 [2018-11-07 05:10:15,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:15,014 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2018-11-07 05:10:15,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 05:10:15,014 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-11-07 05:10:15,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-07 05:10:15,015 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:15,015 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 10, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:15,016 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:15,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:15,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1291969924, now seen corresponding path program 10 times [2018-11-07 05:10:15,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:15,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:15,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:10:15,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:15,017 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:15,178 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 220 proven. 165 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 05:10:15,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:15,178 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:15,178 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:15,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 05:10:15,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:15,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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:15,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:15,187 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:10:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:15,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:15,213 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 220 proven. 165 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 05:10:15,213 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:15,443 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 220 proven. 165 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 05:10:15,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:15,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-11-07 05:10:15,463 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:15,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 05:10:15,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 05:10:15,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-07 05:10:15,465 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 13 states. [2018-11-07 05:10:15,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:15,602 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2018-11-07 05:10:15,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 05:10:15,603 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-11-07 05:10:15,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:15,604 INFO L225 Difference]: With dead ends: 91 [2018-11-07 05:10:15,604 INFO L226 Difference]: Without dead ends: 66 [2018-11-07 05:10:15,605 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-07 05:10:15,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-07 05:10:15,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-07 05:10:15,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-07 05:10:15,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-11-07 05:10:15,615 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 62 [2018-11-07 05:10:15,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:15,616 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-11-07 05:10:15,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 05:10:15,616 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-11-07 05:10:15,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-07 05:10:15,617 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:15,617 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 11, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:15,617 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:15,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:15,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1671940575, now seen corresponding path program 11 times [2018-11-07 05:10:15,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:15,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:15,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:15,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:15,619 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:15,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:15,897 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 240 proven. 198 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 05:10:15,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:15,897 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:15,898 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:15,898 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:15,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:15,898 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:15,906 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:10:15,906 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:10:15,929 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-07 05:10:15,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:10:15,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:16,080 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-11-07 05:10:16,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:16,320 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-11-07 05:10:16,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:16,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 36 [2018-11-07 05:10:16,340 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:16,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 05:10:16,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 05:10:16,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=993, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 05:10:16,341 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 25 states. [2018-11-07 05:10:16,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:16,848 INFO L93 Difference]: Finished difference Result 159 states and 194 transitions. [2018-11-07 05:10:16,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 05:10:16,849 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 65 [2018-11-07 05:10:16,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:16,850 INFO L225 Difference]: With dead ends: 159 [2018-11-07 05:10:16,850 INFO L226 Difference]: Without dead ends: 131 [2018-11-07 05:10:16,851 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=633, Invalid=1719, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 05:10:16,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-07 05:10:16,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 72. [2018-11-07 05:10:16,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-07 05:10:16,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2018-11-07 05:10:16,862 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 65 [2018-11-07 05:10:16,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:16,863 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2018-11-07 05:10:16,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 05:10:16,863 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2018-11-07 05:10:16,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-07 05:10:16,864 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:16,864 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 12, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:16,864 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:16,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:16,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1232033535, now seen corresponding path program 12 times [2018-11-07 05:10:16,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:16,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:16,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:10:16,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:16,866 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:17,039 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 299 proven. 234 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-07 05:10:17,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:17,040 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:17,040 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:17,040 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:17,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:17,040 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:17,048 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:10:17,048 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:10:17,079 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:10:17,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:10:17,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:17,091 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 299 proven. 234 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-07 05:10:17,092 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:17,392 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 299 proven. 234 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-07 05:10:17,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:17,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2018-11-07 05:10:17,412 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:17,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 05:10:17,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 05:10:17,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-07 05:10:17,414 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 15 states. [2018-11-07 05:10:17,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:17,484 INFO L93 Difference]: Finished difference Result 103 states and 119 transitions. [2018-11-07 05:10:17,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 05:10:17,485 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 71 [2018-11-07 05:10:17,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:17,486 INFO L225 Difference]: With dead ends: 103 [2018-11-07 05:10:17,487 INFO L226 Difference]: Without dead ends: 75 [2018-11-07 05:10:17,488 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-07 05:10:17,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-07 05:10:17,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-07 05:10:17,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-07 05:10:17,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2018-11-07 05:10:17,498 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 71 [2018-11-07 05:10:17,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:17,498 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2018-11-07 05:10:17,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 05:10:17,498 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2018-11-07 05:10:17,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-07 05:10:17,500 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:17,500 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:17,500 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:17,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:17,500 INFO L82 PathProgramCache]: Analyzing trace with hash 2006549754, now seen corresponding path program 13 times [2018-11-07 05:10:17,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:17,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:17,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:10:17,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:17,502 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:17,861 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 322 proven. 273 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-07 05:10:17,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:17,861 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:17,861 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:17,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:17,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:17,861 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:17,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:17,870 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:10:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:17,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:17,900 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 322 proven. 273 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-07 05:10:17,901 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:18,757 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 322 proven. 273 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-07 05:10:18,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:18,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2018-11-07 05:10:18,778 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:18,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 05:10:18,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 05:10:18,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-07 05:10:18,779 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 16 states. [2018-11-07 05:10:19,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:19,240 INFO L93 Difference]: Finished difference Result 106 states and 122 transitions. [2018-11-07 05:10:19,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 05:10:19,240 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 74 [2018-11-07 05:10:19,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:19,241 INFO L225 Difference]: With dead ends: 106 [2018-11-07 05:10:19,241 INFO L226 Difference]: Without dead ends: 78 [2018-11-07 05:10:19,242 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-07 05:10:19,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-07 05:10:19,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-07 05:10:19,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-07 05:10:19,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2018-11-07 05:10:19,253 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 74 [2018-11-07 05:10:19,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:19,253 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2018-11-07 05:10:19,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 05:10:19,254 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2018-11-07 05:10:19,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-07 05:10:19,255 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:19,255 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 14, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:19,255 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:19,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:19,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1240051425, now seen corresponding path program 14 times [2018-11-07 05:10:19,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:19,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:19,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:19,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:19,257 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:19,536 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 345 proven. 315 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-07 05:10:19,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:19,537 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:19,537 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:19,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:19,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:19,537 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:19,546 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:10:19,546 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:10:19,575 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 05:10:19,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:10:19,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:19,771 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 422 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-11-07 05:10:19,771 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:20,271 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 422 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-11-07 05:10:20,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:20,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 41 [2018-11-07 05:10:20,291 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:20,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-07 05:10:20,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-07 05:10:20,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=1290, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 05:10:20,293 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 29 states. [2018-11-07 05:10:20,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:20,848 INFO L93 Difference]: Finished difference Result 174 states and 211 transitions. [2018-11-07 05:10:20,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 05:10:20,849 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 77 [2018-11-07 05:10:20,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:20,850 INFO L225 Difference]: With dead ends: 174 [2018-11-07 05:10:20,850 INFO L226 Difference]: Without dead ends: 143 [2018-11-07 05:10:20,852 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=881, Invalid=2311, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 05:10:20,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-07 05:10:20,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 84. [2018-11-07 05:10:20,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-07 05:10:20,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2018-11-07 05:10:20,866 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 77 [2018-11-07 05:10:20,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:20,867 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2018-11-07 05:10:20,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-07 05:10:20,867 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2018-11-07 05:10:20,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-07 05:10:20,868 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:20,869 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 15, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:20,876 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:20,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:20,876 INFO L82 PathProgramCache]: Analyzing trace with hash 716358593, now seen corresponding path program 15 times [2018-11-07 05:10:20,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:20,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:20,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:10:20,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:20,878 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:21,254 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 416 proven. 360 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-07 05:10:21,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:21,255 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:21,255 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:21,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 05:10:21,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:21,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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:21,264 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:10:21,264 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:10:21,284 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:10:21,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:10:21,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:21,298 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 416 proven. 360 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-07 05:10:21,298 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:21,805 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 416 proven. 360 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-07 05:10:21,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:21,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2018-11-07 05:10:21,825 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:21,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 05:10:21,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 05:10:21,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 05:10:21,826 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 18 states. [2018-11-07 05:10:21,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:21,996 INFO L93 Difference]: Finished difference Result 118 states and 136 transitions. [2018-11-07 05:10:21,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 05:10:21,996 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 83 [2018-11-07 05:10:21,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:21,997 INFO L225 Difference]: With dead ends: 118 [2018-11-07 05:10:21,997 INFO L226 Difference]: Without dead ends: 87 [2018-11-07 05:10:21,999 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 05:10:22,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-07 05:10:22,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-11-07 05:10:22,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-07 05:10:22,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2018-11-07 05:10:22,009 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 83 [2018-11-07 05:10:22,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:22,010 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2018-11-07 05:10:22,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 05:10:22,010 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2018-11-07 05:10:22,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-07 05:10:22,011 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:22,011 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 16, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:22,011 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:22,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:22,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1282986300, now seen corresponding path program 16 times [2018-11-07 05:10:22,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:22,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:22,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:10:22,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:22,013 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:22,437 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 442 proven. 408 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-07 05:10:22,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:22,437 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:22,437 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:22,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:22,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:22,437 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:22,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:22,446 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:10:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:22,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:22,477 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 442 proven. 408 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-07 05:10:22,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:22,834 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 442 proven. 408 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-07 05:10:22,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:22,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2018-11-07 05:10:22,854 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:22,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 05:10:22,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 05:10:22,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 05:10:22,855 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand 19 states. [2018-11-07 05:10:22,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:22,924 INFO L93 Difference]: Finished difference Result 121 states and 139 transitions. [2018-11-07 05:10:22,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 05:10:22,924 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 86 [2018-11-07 05:10:22,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:22,925 INFO L225 Difference]: With dead ends: 121 [2018-11-07 05:10:22,925 INFO L226 Difference]: Without dead ends: 90 [2018-11-07 05:10:22,927 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 05:10:22,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-07 05:10:22,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-11-07 05:10:22,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-07 05:10:22,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2018-11-07 05:10:22,938 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 86 [2018-11-07 05:10:22,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:22,938 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2018-11-07 05:10:22,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 05:10:22,939 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2018-11-07 05:10:22,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-07 05:10:22,940 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:22,940 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 17, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:22,940 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:22,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:22,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1827435039, now seen corresponding path program 17 times [2018-11-07 05:10:22,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:22,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:22,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:22,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:22,941 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:23,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 468 proven. 459 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-07 05:10:23,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:23,553 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:23,554 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:23,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:23,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:23,554 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:23,566 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:10:23,566 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:10:23,593 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-11-07 05:10:23,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:10:23,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:23,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 568 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2018-11-07 05:10:23,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:24,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 568 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2018-11-07 05:10:24,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:24,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 15] total 46 [2018-11-07 05:10:24,067 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:24,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 05:10:24,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 05:10:24,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=446, Invalid=1624, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 05:10:24,069 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 33 states. [2018-11-07 05:10:24,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:24,489 INFO L93 Difference]: Finished difference Result 189 states and 228 transitions. [2018-11-07 05:10:24,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 05:10:24,490 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 89 [2018-11-07 05:10:24,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:24,492 INFO L225 Difference]: With dead ends: 189 [2018-11-07 05:10:24,492 INFO L226 Difference]: Without dead ends: 155 [2018-11-07 05:10:24,493 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1172, Invalid=2988, Unknown=0, NotChecked=0, Total=4160 [2018-11-07 05:10:24,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-07 05:10:24,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 96. [2018-11-07 05:10:24,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-07 05:10:24,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2018-11-07 05:10:24,508 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 89 [2018-11-07 05:10:24,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:24,508 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2018-11-07 05:10:24,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 05:10:24,508 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-11-07 05:10:24,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-07 05:10:24,509 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:24,509 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 18, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:24,510 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:24,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:24,510 INFO L82 PathProgramCache]: Analyzing trace with hash -180631489, now seen corresponding path program 18 times [2018-11-07 05:10:24,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:24,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:24,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:10:24,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:24,511 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:24,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 551 proven. 513 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-07 05:10:24,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:24,794 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:24,794 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:24,794 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:24,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:24,795 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:24,803 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:10:24,803 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:10:24,826 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:10:24,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:10:24,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:24,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 551 proven. 513 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-07 05:10:24,842 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:25,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 551 proven. 513 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-07 05:10:25,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:25,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2018-11-07 05:10:25,332 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:25,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 05:10:25,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 05:10:25,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 05:10:25,333 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 21 states. [2018-11-07 05:10:25,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:25,488 INFO L93 Difference]: Finished difference Result 133 states and 153 transitions. [2018-11-07 05:10:25,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 05:10:25,488 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 95 [2018-11-07 05:10:25,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:25,490 INFO L225 Difference]: With dead ends: 133 [2018-11-07 05:10:25,490 INFO L226 Difference]: Without dead ends: 99 [2018-11-07 05:10:25,491 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 05:10:25,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-07 05:10:25,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-11-07 05:10:25,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-07 05:10:25,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2018-11-07 05:10:25,505 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 95 [2018-11-07 05:10:25,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:25,506 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2018-11-07 05:10:25,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 05:10:25,506 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2018-11-07 05:10:25,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-07 05:10:25,507 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:25,507 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 19, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:25,507 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:25,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:25,508 INFO L82 PathProgramCache]: Analyzing trace with hash -565545670, now seen corresponding path program 19 times [2018-11-07 05:10:25,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:25,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:25,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:10:25,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:25,509 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:25,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 580 proven. 570 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-07 05:10:25,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:25,898 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:25,898 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:25,898 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:25,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:25,899 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:25,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:25,909 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:10:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:25,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:25,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 580 proven. 570 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-07 05:10:25,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:26,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 580 proven. 570 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-07 05:10:26,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:26,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2018-11-07 05:10:26,549 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:26,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 05:10:26,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 05:10:26,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 05:10:26,551 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 22 states. [2018-11-07 05:10:26,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:26,681 INFO L93 Difference]: Finished difference Result 136 states and 156 transitions. [2018-11-07 05:10:26,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 05:10:26,685 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 98 [2018-11-07 05:10:26,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:26,686 INFO L225 Difference]: With dead ends: 136 [2018-11-07 05:10:26,686 INFO L226 Difference]: Without dead ends: 102 [2018-11-07 05:10:26,687 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 05:10:26,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-07 05:10:26,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-11-07 05:10:26,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-07 05:10:26,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2018-11-07 05:10:26,699 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 98 [2018-11-07 05:10:26,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:26,699 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2018-11-07 05:10:26,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 05:10:26,700 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2018-11-07 05:10:26,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-07 05:10:26,700 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:26,701 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 20, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:26,701 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:26,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:26,701 INFO L82 PathProgramCache]: Analyzing trace with hash 18768479, now seen corresponding path program 20 times [2018-11-07 05:10:26,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:26,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:26,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:26,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:26,702 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:27,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 609 proven. 630 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-07 05:10:27,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:27,042 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:27,042 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:27,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:27,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:27,042 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:27,052 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:10:27,052 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:10:27,074 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-07 05:10:27,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:10:27,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:27,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 735 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-11-07 05:10:27,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:27,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 735 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-11-07 05:10:27,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:27,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 16, 16] total 51 [2018-11-07 05:10:27,616 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:27,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-07 05:10:27,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-07 05:10:27,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=555, Invalid=1995, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 05:10:27,617 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 37 states. [2018-11-07 05:10:28,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:28,126 INFO L93 Difference]: Finished difference Result 204 states and 245 transitions. [2018-11-07 05:10:28,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-07 05:10:28,127 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 101 [2018-11-07 05:10:28,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:28,128 INFO L225 Difference]: With dead ends: 204 [2018-11-07 05:10:28,128 INFO L226 Difference]: Without dead ends: 167 [2018-11-07 05:10:28,130 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1506, Invalid=3750, Unknown=0, NotChecked=0, Total=5256 [2018-11-07 05:10:28,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-07 05:10:28,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 108. [2018-11-07 05:10:28,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-07 05:10:28,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2018-11-07 05:10:28,146 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 101 [2018-11-07 05:10:28,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:28,147 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2018-11-07 05:10:28,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-07 05:10:28,147 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2018-11-07 05:10:28,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-07 05:10:28,148 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:28,148 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 21, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:28,148 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:28,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:28,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1597803393, now seen corresponding path program 21 times [2018-11-07 05:10:28,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:28,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:28,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:10:28,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:28,150 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:28,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:28,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 704 proven. 693 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-07 05:10:28,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:28,633 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:28,633 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:28,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:28,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:28,633 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:28,641 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:10:28,641 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:10:28,665 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:10:28,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:10:28,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:28,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 704 proven. 693 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-07 05:10:28,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:29,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 704 proven. 693 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-07 05:10:29,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:29,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 46 [2018-11-07 05:10:29,280 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:29,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 05:10:29,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 05:10:29,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 05:10:29,282 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand 24 states. [2018-11-07 05:10:29,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:29,379 INFO L93 Difference]: Finished difference Result 148 states and 170 transitions. [2018-11-07 05:10:29,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 05:10:29,379 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 107 [2018-11-07 05:10:29,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:29,380 INFO L225 Difference]: With dead ends: 148 [2018-11-07 05:10:29,380 INFO L226 Difference]: Without dead ends: 111 [2018-11-07 05:10:29,381 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 05:10:29,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-07 05:10:29,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-11-07 05:10:29,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-07 05:10:29,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2018-11-07 05:10:29,399 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 107 [2018-11-07 05:10:29,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:29,399 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2018-11-07 05:10:29,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 05:10:29,400 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2018-11-07 05:10:29,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-07 05:10:29,400 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:29,401 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 22, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:29,401 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:29,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:29,401 INFO L82 PathProgramCache]: Analyzing trace with hash 102799356, now seen corresponding path program 22 times [2018-11-07 05:10:29,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:29,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:29,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:10:29,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:29,402 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:29,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 736 proven. 759 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-07 05:10:29,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:29,734 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:29,734 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:29,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:29,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:29,734 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:29,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:29,742 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:10:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:29,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:29,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 736 proven. 759 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-07 05:10:29,796 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:30,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 736 proven. 759 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-07 05:10:30,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:30,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2018-11-07 05:10:30,472 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:30,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 05:10:30,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 05:10:30,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 05:10:30,473 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand 25 states. [2018-11-07 05:10:30,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:30,581 INFO L93 Difference]: Finished difference Result 151 states and 173 transitions. [2018-11-07 05:10:30,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 05:10:30,584 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 110 [2018-11-07 05:10:30,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:30,585 INFO L225 Difference]: With dead ends: 151 [2018-11-07 05:10:30,585 INFO L226 Difference]: Without dead ends: 114 [2018-11-07 05:10:30,587 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 05:10:30,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-07 05:10:30,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-11-07 05:10:30,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-07 05:10:30,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2018-11-07 05:10:30,604 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 110 [2018-11-07 05:10:30,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:30,604 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2018-11-07 05:10:30,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 05:10:30,605 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2018-11-07 05:10:30,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-07 05:10:30,605 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:30,605 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 23, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:30,606 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:30,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:30,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1248392609, now seen corresponding path program 23 times [2018-11-07 05:10:30,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:30,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:30,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:30,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:30,607 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:30,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 768 proven. 828 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-07 05:10:30,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:30,906 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:30,906 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:30,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:30,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:30,906 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:30,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:10:30,914 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:10:30,941 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-11-07 05:10:30,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:10:30,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:31,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 923 refuted. 0 times theorem prover too weak. 828 trivial. 0 not checked. [2018-11-07 05:10:31,209 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:31,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 923 refuted. 0 times theorem prover too weak. 828 trivial. 0 not checked. [2018-11-07 05:10:31,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:31,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 17, 17] total 56 [2018-11-07 05:10:31,598 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:31,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-07 05:10:31,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-07 05:10:31,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=677, Invalid=2403, Unknown=0, NotChecked=0, Total=3080 [2018-11-07 05:10:31,603 INFO L87 Difference]: Start difference. First operand 114 states and 125 transitions. Second operand 41 states. [2018-11-07 05:10:32,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:32,412 INFO L93 Difference]: Finished difference Result 219 states and 262 transitions. [2018-11-07 05:10:32,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 05:10:32,416 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 113 [2018-11-07 05:10:32,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:32,417 INFO L225 Difference]: With dead ends: 219 [2018-11-07 05:10:32,417 INFO L226 Difference]: Without dead ends: 179 [2018-11-07 05:10:32,419 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1883, Invalid=4597, Unknown=0, NotChecked=0, Total=6480 [2018-11-07 05:10:32,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-07 05:10:32,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 120. [2018-11-07 05:10:32,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-07 05:10:32,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2018-11-07 05:10:32,435 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 113 [2018-11-07 05:10:32,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:32,436 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2018-11-07 05:10:32,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-07 05:10:32,436 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2018-11-07 05:10:32,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 05:10:32,437 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:32,437 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 24, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:32,437 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:32,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:32,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1004459649, now seen corresponding path program 24 times [2018-11-07 05:10:32,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:32,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:32,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:10:32,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:32,438 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:33,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 875 proven. 900 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-07 05:10:33,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:33,714 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:33,714 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:33,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:33,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:33,714 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:33,724 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:10:33,724 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:10:33,751 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:10:33,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:10:33,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:33,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 875 proven. 900 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-07 05:10:33,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:34,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 875 proven. 900 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-07 05:10:34,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:34,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 52 [2018-11-07 05:10:34,514 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:34,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 05:10:34,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 05:10:34,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 05:10:34,515 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 27 states. [2018-11-07 05:10:34,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:34,631 INFO L93 Difference]: Finished difference Result 163 states and 187 transitions. [2018-11-07 05:10:34,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 05:10:34,634 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 119 [2018-11-07 05:10:34,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:34,635 INFO L225 Difference]: With dead ends: 163 [2018-11-07 05:10:34,635 INFO L226 Difference]: Without dead ends: 123 [2018-11-07 05:10:34,636 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 05:10:34,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-07 05:10:34,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-11-07 05:10:34,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-07 05:10:34,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 135 transitions. [2018-11-07 05:10:34,658 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 135 transitions. Word has length 119 [2018-11-07 05:10:34,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:34,659 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 135 transitions. [2018-11-07 05:10:34,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 05:10:34,659 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 135 transitions. [2018-11-07 05:10:34,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-07 05:10:34,660 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:34,660 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 25, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:34,660 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:34,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:34,660 INFO L82 PathProgramCache]: Analyzing trace with hash -230206086, now seen corresponding path program 25 times [2018-11-07 05:10:34,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:34,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:34,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:10:34,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:34,662 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:35,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 910 proven. 975 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-07 05:10:35,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:35,100 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:35,100 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:35,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:35,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:35,100 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:35,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:35,111 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:10:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:35,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:35,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 910 proven. 975 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-07 05:10:35,159 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:36,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 910 proven. 975 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-07 05:10:36,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:36,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 54 [2018-11-07 05:10:36,267 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:36,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 05:10:36,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 05:10:36,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-11-07 05:10:36,268 INFO L87 Difference]: Start difference. First operand 123 states and 135 transitions. Second operand 28 states. [2018-11-07 05:10:37,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:37,039 INFO L93 Difference]: Finished difference Result 166 states and 190 transitions. [2018-11-07 05:10:37,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 05:10:37,040 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 122 [2018-11-07 05:10:37,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:37,041 INFO L225 Difference]: With dead ends: 166 [2018-11-07 05:10:37,041 INFO L226 Difference]: Without dead ends: 126 [2018-11-07 05:10:37,042 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-11-07 05:10:37,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-07 05:10:37,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-11-07 05:10:37,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-07 05:10:37,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2018-11-07 05:10:37,067 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 122 [2018-11-07 05:10:37,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:37,068 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2018-11-07 05:10:37,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 05:10:37,068 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2018-11-07 05:10:37,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-07 05:10:37,069 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:37,069 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 26, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:37,069 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:37,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:37,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1583309727, now seen corresponding path program 26 times [2018-11-07 05:10:37,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:37,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:37,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:37,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:37,071 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:38,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 945 proven. 1053 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-07 05:10:38,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:38,889 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:38,889 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:38,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:38,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:38,889 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:38,897 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:10:38,898 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:10:38,927 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-07 05:10:38,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:10:38,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:39,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 1132 refuted. 0 times theorem prover too weak. 1053 trivial. 0 not checked. [2018-11-07 05:10:39,209 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:39,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 1132 refuted. 0 times theorem prover too weak. 1053 trivial. 0 not checked. [2018-11-07 05:10:39,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:39,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 18, 18] total 61 [2018-11-07 05:10:39,649 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:39,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-07 05:10:39,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-07 05:10:39,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=812, Invalid=2848, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 05:10:39,650 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand 45 states. [2018-11-07 05:10:40,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:40,481 INFO L93 Difference]: Finished difference Result 234 states and 279 transitions. [2018-11-07 05:10:40,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-07 05:10:40,482 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 125 [2018-11-07 05:10:40,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:40,484 INFO L225 Difference]: With dead ends: 234 [2018-11-07 05:10:40,484 INFO L226 Difference]: Without dead ends: 191 [2018-11-07 05:10:40,485 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1355 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2303, Invalid=5529, Unknown=0, NotChecked=0, Total=7832 [2018-11-07 05:10:40,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-11-07 05:10:40,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 132. [2018-11-07 05:10:40,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-07 05:10:40,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 145 transitions. [2018-11-07 05:10:40,512 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 145 transitions. Word has length 125 [2018-11-07 05:10:40,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:40,512 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 145 transitions. [2018-11-07 05:10:40,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-07 05:10:40,513 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 145 transitions. [2018-11-07 05:10:40,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-07 05:10:40,513 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:40,514 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 27, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:40,514 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:40,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:40,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1658086209, now seen corresponding path program 27 times [2018-11-07 05:10:40,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:40,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:40,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:10:40,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:40,516 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:42,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 1064 proven. 1134 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-07 05:10:42,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:42,032 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:42,032 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:42,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 05:10:42,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:42,033 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:42,043 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:10:42,044 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:10:42,081 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:10:42,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:10:42,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:42,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 1064 proven. 1134 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-07 05:10:42,103 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:42,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 1064 proven. 1134 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-07 05:10:42,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:42,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 58 [2018-11-07 05:10:42,980 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:42,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 05:10:42,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 05:10:42,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-11-07 05:10:42,982 INFO L87 Difference]: Start difference. First operand 132 states and 145 transitions. Second operand 30 states. [2018-11-07 05:10:43,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:43,202 INFO L93 Difference]: Finished difference Result 178 states and 204 transitions. [2018-11-07 05:10:43,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-07 05:10:43,202 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 131 [2018-11-07 05:10:43,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:43,203 INFO L225 Difference]: With dead ends: 178 [2018-11-07 05:10:43,203 INFO L226 Difference]: Without dead ends: 135 [2018-11-07 05:10:43,204 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-11-07 05:10:43,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-07 05:10:43,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-11-07 05:10:43,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-07 05:10:43,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 148 transitions. [2018-11-07 05:10:43,226 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 148 transitions. Word has length 131 [2018-11-07 05:10:43,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:43,226 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 148 transitions. [2018-11-07 05:10:43,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 05:10:43,227 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 148 transitions. [2018-11-07 05:10:43,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-07 05:10:43,227 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:43,228 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 28, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:43,228 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:43,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:43,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1686728380, now seen corresponding path program 28 times [2018-11-07 05:10:43,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:43,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:43,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:10:43,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:43,229 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:43,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:43,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 1102 proven. 1218 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-07 05:10:43,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:43,963 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:43,963 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:43,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 05:10:43,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:43,964 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:43,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:43,979 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:10:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:44,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:44,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 1102 proven. 1218 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-07 05:10:44,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:44,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 1102 proven. 1218 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-07 05:10:44,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:44,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 60 [2018-11-07 05:10:44,975 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:44,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-07 05:10:44,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-07 05:10:44,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-11-07 05:10:44,977 INFO L87 Difference]: Start difference. First operand 135 states and 148 transitions. Second operand 31 states. [2018-11-07 05:10:45,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:45,109 INFO L93 Difference]: Finished difference Result 181 states and 207 transitions. [2018-11-07 05:10:45,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 05:10:45,109 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 134 [2018-11-07 05:10:45,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:45,111 INFO L225 Difference]: With dead ends: 181 [2018-11-07 05:10:45,111 INFO L226 Difference]: Without dead ends: 138 [2018-11-07 05:10:45,112 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-11-07 05:10:45,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-07 05:10:45,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-11-07 05:10:45,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-07 05:10:45,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 151 transitions. [2018-11-07 05:10:45,132 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 151 transitions. Word has length 134 [2018-11-07 05:10:45,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:45,132 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 151 transitions. [2018-11-07 05:10:45,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-07 05:10:45,132 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 151 transitions. [2018-11-07 05:10:45,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-07 05:10:45,133 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:45,133 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 29, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:45,133 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:45,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:45,134 INFO L82 PathProgramCache]: Analyzing trace with hash 267152737, now seen corresponding path program 29 times [2018-11-07 05:10:45,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:45,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:45,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:45,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:45,135 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:45,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 1140 proven. 1305 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-07 05:10:45,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:45,624 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:45,624 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:45,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:45,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:45,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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:45,632 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:10:45,633 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:10:45,666 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-11-07 05:10:45,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:10:45,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:46,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 1362 refuted. 0 times theorem prover too weak. 1305 trivial. 0 not checked. [2018-11-07 05:10:46,033 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:46,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 1362 refuted. 0 times theorem prover too weak. 1305 trivial. 0 not checked. [2018-11-07 05:10:46,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:46,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 19, 19] total 66 [2018-11-07 05:10:46,593 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:46,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-07 05:10:46,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-07 05:10:46,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=3330, Unknown=0, NotChecked=0, Total=4290 [2018-11-07 05:10:46,594 INFO L87 Difference]: Start difference. First operand 138 states and 151 transitions. Second operand 49 states. [2018-11-07 05:10:47,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:47,627 INFO L93 Difference]: Finished difference Result 249 states and 296 transitions. [2018-11-07 05:10:47,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-07 05:10:47,628 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 137 [2018-11-07 05:10:47,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:47,629 INFO L225 Difference]: With dead ends: 249 [2018-11-07 05:10:47,629 INFO L226 Difference]: Without dead ends: 203 [2018-11-07 05:10:47,631 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1607 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2766, Invalid=6546, Unknown=0, NotChecked=0, Total=9312 [2018-11-07 05:10:47,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-11-07 05:10:47,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 144. [2018-11-07 05:10:47,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-07 05:10:47,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 158 transitions. [2018-11-07 05:10:47,661 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 158 transitions. Word has length 137 [2018-11-07 05:10:47,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:47,662 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 158 transitions. [2018-11-07 05:10:47,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-07 05:10:47,662 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 158 transitions. [2018-11-07 05:10:47,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-07 05:10:47,663 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:47,663 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 30, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:47,663 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:47,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:47,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1727300929, now seen corresponding path program 30 times [2018-11-07 05:10:47,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:47,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:47,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:10:47,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:47,664 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:48,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 1271 proven. 1395 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-07 05:10:48,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:48,151 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:48,151 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:48,151 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:48,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:48,151 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:48,166 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:10:48,167 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:10:48,221 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:10:48,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:10:48,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:48,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 1271 proven. 1395 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-07 05:10:48,258 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:49,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 1271 proven. 1395 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-07 05:10:49,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:49,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 64 [2018-11-07 05:10:49,850 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:49,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 05:10:49,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 05:10:49,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-11-07 05:10:49,852 INFO L87 Difference]: Start difference. First operand 144 states and 158 transitions. Second operand 33 states. [2018-11-07 05:10:49,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:50,000 INFO L93 Difference]: Finished difference Result 193 states and 221 transitions. [2018-11-07 05:10:50,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 05:10:50,000 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 143 [2018-11-07 05:10:50,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:50,002 INFO L225 Difference]: With dead ends: 193 [2018-11-07 05:10:50,002 INFO L226 Difference]: Without dead ends: 147 [2018-11-07 05:10:50,002 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-11-07 05:10:50,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-07 05:10:50,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-11-07 05:10:50,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-07 05:10:50,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2018-11-07 05:10:50,034 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 143 [2018-11-07 05:10:50,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:50,034 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2018-11-07 05:10:50,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 05:10:50,035 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2018-11-07 05:10:50,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-07 05:10:50,036 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:50,036 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 31, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:50,036 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:50,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:50,036 INFO L82 PathProgramCache]: Analyzing trace with hash -310630982, now seen corresponding path program 31 times [2018-11-07 05:10:50,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:50,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:50,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:10:50,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:50,037 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:51,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 1312 proven. 1488 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-07 05:10:51,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:51,061 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:51,062 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:51,062 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:51,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:51,062 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:51,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:51,080 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:10:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:51,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:51,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 1312 proven. 1488 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-07 05:10:51,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:52,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 1312 proven. 1488 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-07 05:10:52,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:52,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 66 [2018-11-07 05:10:52,279 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:52,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 05:10:52,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 05:10:52,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-11-07 05:10:52,281 INFO L87 Difference]: Start difference. First operand 147 states and 161 transitions. Second operand 34 states. [2018-11-07 05:10:52,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:52,418 INFO L93 Difference]: Finished difference Result 196 states and 224 transitions. [2018-11-07 05:10:52,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-07 05:10:52,419 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 146 [2018-11-07 05:10:52,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:52,420 INFO L225 Difference]: With dead ends: 196 [2018-11-07 05:10:52,420 INFO L226 Difference]: Without dead ends: 150 [2018-11-07 05:10:52,421 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-11-07 05:10:52,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-07 05:10:52,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-11-07 05:10:52,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-07 05:10:52,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 164 transitions. [2018-11-07 05:10:52,449 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 164 transitions. Word has length 146 [2018-11-07 05:10:52,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:52,450 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 164 transitions. [2018-11-07 05:10:52,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-07 05:10:52,450 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 164 transitions. [2018-11-07 05:10:52,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-07 05:10:52,451 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:52,451 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 32, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:52,451 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:52,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:52,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1355109599, now seen corresponding path program 32 times [2018-11-07 05:10:52,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:52,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:52,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:52,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:52,452 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:52,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 1353 proven. 1584 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-07 05:10:52,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:52,989 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:52,989 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:52,989 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:52,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:52,989 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:52,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:10:52,998 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:10:53,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-07 05:10:53,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:10:53,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:53,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 1613 refuted. 0 times theorem prover too weak. 1584 trivial. 0 not checked. [2018-11-07 05:10:53,405 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:54,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 1613 refuted. 0 times theorem prover too weak. 1584 trivial. 0 not checked. [2018-11-07 05:10:54,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:54,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 20, 20] total 71 [2018-11-07 05:10:54,420 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:54,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-07 05:10:54,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-07 05:10:54,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1121, Invalid=3849, Unknown=0, NotChecked=0, Total=4970 [2018-11-07 05:10:54,422 INFO L87 Difference]: Start difference. First operand 150 states and 164 transitions. Second operand 53 states. [2018-11-07 05:10:55,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:55,452 INFO L93 Difference]: Finished difference Result 264 states and 313 transitions. [2018-11-07 05:10:55,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-07 05:10:55,455 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 149 [2018-11-07 05:10:55,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:55,456 INFO L225 Difference]: With dead ends: 264 [2018-11-07 05:10:55,456 INFO L226 Difference]: Without dead ends: 215 [2018-11-07 05:10:55,458 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1880 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3272, Invalid=7648, Unknown=0, NotChecked=0, Total=10920 [2018-11-07 05:10:55,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-11-07 05:10:55,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 156. [2018-11-07 05:10:55,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-07 05:10:55,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 171 transitions. [2018-11-07 05:10:55,494 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 171 transitions. Word has length 149 [2018-11-07 05:10:55,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:55,495 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 171 transitions. [2018-11-07 05:10:55,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-07 05:10:55,495 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 171 transitions. [2018-11-07 05:10:55,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-07 05:10:55,497 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:55,497 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 33, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:55,497 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:55,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:55,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1141787393, now seen corresponding path program 33 times [2018-11-07 05:10:55,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:55,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:55,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:10:55,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:55,499 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:56,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 1496 proven. 1683 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-07 05:10:56,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:56,142 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:56,142 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:56,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:56,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:56,142 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:56,150 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:10:56,150 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:10:56,209 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:10:56,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:10:56,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:56,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 1496 proven. 1683 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-07 05:10:56,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:10:57,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 1496 proven. 1683 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-07 05:10:57,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:10:57,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 70 [2018-11-07 05:10:57,588 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:10:57,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 05:10:57,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 05:10:57,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-11-07 05:10:57,589 INFO L87 Difference]: Start difference. First operand 156 states and 171 transitions. Second operand 36 states. [2018-11-07 05:10:57,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:10:57,750 INFO L93 Difference]: Finished difference Result 208 states and 238 transitions. [2018-11-07 05:10:57,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-07 05:10:57,753 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 155 [2018-11-07 05:10:57,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:10:57,754 INFO L225 Difference]: With dead ends: 208 [2018-11-07 05:10:57,754 INFO L226 Difference]: Without dead ends: 159 [2018-11-07 05:10:57,755 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-11-07 05:10:57,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-07 05:10:57,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-11-07 05:10:57,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-07 05:10:57,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 174 transitions. [2018-11-07 05:10:57,791 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 174 transitions. Word has length 155 [2018-11-07 05:10:57,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:10:57,791 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 174 transitions. [2018-11-07 05:10:57,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 05:10:57,791 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 174 transitions. [2018-11-07 05:10:57,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-07 05:10:57,792 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:10:57,792 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 34, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:10:57,793 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:10:57,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:10:57,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1296520572, now seen corresponding path program 34 times [2018-11-07 05:10:57,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:10:57,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:57,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:10:57,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:10:57,794 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:10:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:59,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 1540 proven. 1785 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-07 05:10:59,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:59,235 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:10:59,236 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:10:59,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:10:59,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:10:59,236 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:10:59,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:10:59,243 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:10:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:10:59,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:10:59,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 1540 proven. 1785 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-07 05:10:59,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:11:00,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 1540 proven. 1785 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-07 05:11:00,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:11:00,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 72 [2018-11-07 05:11:00,840 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:11:00,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-07 05:11:00,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-07 05:11:00,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-11-07 05:11:00,841 INFO L87 Difference]: Start difference. First operand 159 states and 174 transitions. Second operand 37 states. [2018-11-07 05:11:01,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:11:01,002 INFO L93 Difference]: Finished difference Result 211 states and 241 transitions. [2018-11-07 05:11:01,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-07 05:11:01,003 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 158 [2018-11-07 05:11:01,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:11:01,004 INFO L225 Difference]: With dead ends: 211 [2018-11-07 05:11:01,004 INFO L226 Difference]: Without dead ends: 162 [2018-11-07 05:11:01,005 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-11-07 05:11:01,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-07 05:11:01,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-11-07 05:11:01,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-07 05:11:01,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 177 transitions. [2018-11-07 05:11:01,043 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 177 transitions. Word has length 158 [2018-11-07 05:11:01,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:11:01,044 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 177 transitions. [2018-11-07 05:11:01,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-07 05:11:01,044 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 177 transitions. [2018-11-07 05:11:01,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-07 05:11:01,045 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:11:01,045 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 35, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:11:01,045 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:11:01,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:11:01,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1842219743, now seen corresponding path program 35 times [2018-11-07 05:11:01,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:11:01,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:01,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:11:01,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:01,047 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:11:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:11:02,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 1584 proven. 1890 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-07 05:11:02,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:02,251 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:11:02,251 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:11:02,252 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:11:02,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:02,252 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:11:02,260 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:11:02,260 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:11:02,308 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-11-07 05:11:02,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:11:02,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:11:02,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 1885 refuted. 0 times theorem prover too weak. 1890 trivial. 0 not checked. [2018-11-07 05:11:02,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:11:03,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 1885 refuted. 0 times theorem prover too weak. 1890 trivial. 0 not checked. [2018-11-07 05:11:03,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:11:03,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 21, 21] total 76 [2018-11-07 05:11:03,447 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:11:03,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-11-07 05:11:03,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-07 05:11:03,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=4405, Unknown=0, NotChecked=0, Total=5700 [2018-11-07 05:11:03,449 INFO L87 Difference]: Start difference. First operand 162 states and 177 transitions. Second operand 57 states. [2018-11-07 05:11:04,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:11:04,803 INFO L93 Difference]: Finished difference Result 279 states and 330 transitions. [2018-11-07 05:11:04,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-11-07 05:11:04,803 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 161 [2018-11-07 05:11:04,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:11:04,805 INFO L225 Difference]: With dead ends: 279 [2018-11-07 05:11:04,805 INFO L226 Difference]: Without dead ends: 227 [2018-11-07 05:11:04,806 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2174 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3821, Invalid=8835, Unknown=0, NotChecked=0, Total=12656 [2018-11-07 05:11:04,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-11-07 05:11:04,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 168. [2018-11-07 05:11:04,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-07 05:11:04,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 184 transitions. [2018-11-07 05:11:04,849 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 184 transitions. Word has length 161 [2018-11-07 05:11:04,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:11:04,849 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 184 transitions. [2018-11-07 05:11:04,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-11-07 05:11:04,850 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 184 transitions. [2018-11-07 05:11:04,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-07 05:11:04,851 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:11:04,851 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 36, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:11:04,851 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:11:04,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:11:04,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1441184767, now seen corresponding path program 36 times [2018-11-07 05:11:04,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:11:04,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:04,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:11:04,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:04,852 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:11:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:11:05,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 1739 proven. 1998 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-07 05:11:05,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:05,586 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:11:05,586 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:11:05,586 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:11:05,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:05,586 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:11:05,596 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:11:05,597 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:11:05,632 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:11:05,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:11:05,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:11:05,668 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 1739 proven. 1998 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-07 05:11:05,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:11:08,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 1739 proven. 1998 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-07 05:11:08,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:11:08,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 76 [2018-11-07 05:11:08,434 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:11:08,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 05:11:08,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 05:11:08,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-11-07 05:11:08,435 INFO L87 Difference]: Start difference. First operand 168 states and 184 transitions. Second operand 39 states. [2018-11-07 05:11:08,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:11:08,590 INFO L93 Difference]: Finished difference Result 223 states and 255 transitions. [2018-11-07 05:11:08,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 05:11:08,591 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 167 [2018-11-07 05:11:08,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:11:08,593 INFO L225 Difference]: With dead ends: 223 [2018-11-07 05:11:08,593 INFO L226 Difference]: Without dead ends: 171 [2018-11-07 05:11:08,594 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-11-07 05:11:08,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-11-07 05:11:08,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-11-07 05:11:08,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-07 05:11:08,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 187 transitions. [2018-11-07 05:11:08,624 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 187 transitions. Word has length 167 [2018-11-07 05:11:08,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:11:08,624 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 187 transitions. [2018-11-07 05:11:08,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 05:11:08,624 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 187 transitions. [2018-11-07 05:11:08,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-07 05:11:08,625 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:11:08,625 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 37, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:11:08,626 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:11:08,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:11:08,626 INFO L82 PathProgramCache]: Analyzing trace with hash 148170234, now seen corresponding path program 37 times [2018-11-07 05:11:08,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:11:08,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:08,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:11:08,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:08,627 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:11:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:11:09,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 1786 proven. 2109 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-07 05:11:09,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:09,682 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:11:09,682 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:11:09,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 05:11:09,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:09,683 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:11:09,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:11:09,691 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:11:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:11:09,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:11:09,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 1786 proven. 2109 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-07 05:11:09,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:11:11,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 1786 proven. 2109 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-07 05:11:11,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:11:11,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 78 [2018-11-07 05:11:11,345 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:11:11,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-07 05:11:11,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-07 05:11:11,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-11-07 05:11:11,346 INFO L87 Difference]: Start difference. First operand 171 states and 187 transitions. Second operand 40 states. [2018-11-07 05:11:11,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:11:11,519 INFO L93 Difference]: Finished difference Result 226 states and 258 transitions. [2018-11-07 05:11:11,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-07 05:11:11,519 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 170 [2018-11-07 05:11:11,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:11:11,521 INFO L225 Difference]: With dead ends: 226 [2018-11-07 05:11:11,521 INFO L226 Difference]: Without dead ends: 174 [2018-11-07 05:11:11,522 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-11-07 05:11:11,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-07 05:11:11,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-11-07 05:11:11,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-07 05:11:11,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 190 transitions. [2018-11-07 05:11:11,556 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 190 transitions. Word has length 170 [2018-11-07 05:11:11,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:11:11,556 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 190 transitions. [2018-11-07 05:11:11,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-07 05:11:11,556 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 190 transitions. [2018-11-07 05:11:11,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-07 05:11:11,557 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:11:11,557 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 38, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:11:11,557 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:11:11,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:11:11,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1513895455, now seen corresponding path program 38 times [2018-11-07 05:11:11,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:11:11,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:11,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:11:11,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:11,559 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:11:11,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:11:12,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 1833 proven. 2223 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-07 05:11:12,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:12,758 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:11:12,758 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:11:12,758 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:11:12,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:12,758 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:11:12,766 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:11:12,766 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:11:12,803 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-11-07 05:11:12,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:11:12,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:11:13,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 2223 trivial. 0 not checked. [2018-11-07 05:11:13,275 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:11:14,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 2223 trivial. 0 not checked. [2018-11-07 05:11:14,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:11:14,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 22, 22] total 81 [2018-11-07 05:11:14,029 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:11:14,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-11-07 05:11:14,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-11-07 05:11:14,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1482, Invalid=4998, Unknown=0, NotChecked=0, Total=6480 [2018-11-07 05:11:14,030 INFO L87 Difference]: Start difference. First operand 174 states and 190 transitions. Second operand 61 states. [2018-11-07 05:11:15,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:11:15,430 INFO L93 Difference]: Finished difference Result 294 states and 347 transitions. [2018-11-07 05:11:15,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-11-07 05:11:15,430 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 173 [2018-11-07 05:11:15,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:11:15,431 INFO L225 Difference]: With dead ends: 294 [2018-11-07 05:11:15,431 INFO L226 Difference]: Without dead ends: 239 [2018-11-07 05:11:15,432 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2489 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4413, Invalid=10107, Unknown=0, NotChecked=0, Total=14520 [2018-11-07 05:11:15,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-11-07 05:11:15,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 180. [2018-11-07 05:11:15,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-11-07 05:11:15,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 197 transitions. [2018-11-07 05:11:15,470 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 197 transitions. Word has length 173 [2018-11-07 05:11:15,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:11:15,470 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 197 transitions. [2018-11-07 05:11:15,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-11-07 05:11:15,471 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 197 transitions. [2018-11-07 05:11:15,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-07 05:11:15,472 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:11:15,472 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 39, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:11:15,472 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:11:15,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:11:15,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1300348223, now seen corresponding path program 39 times [2018-11-07 05:11:15,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:11:15,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:15,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:11:15,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:15,473 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:11:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:11:16,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 2000 proven. 2340 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-07 05:11:16,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:16,173 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:11:16,173 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:11:16,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:11:16,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:16,173 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:11:16,181 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:11:16,181 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:11:16,217 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:11:16,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:11:16,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:11:16,254 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 2000 proven. 2340 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-07 05:11:16,255 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:11:18,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 2000 proven. 2340 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-07 05:11:18,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:11:18,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 82 [2018-11-07 05:11:18,255 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:11:18,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 05:11:18,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 05:11:18,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-11-07 05:11:18,256 INFO L87 Difference]: Start difference. First operand 180 states and 197 transitions. Second operand 42 states. [2018-11-07 05:11:18,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:11:18,482 INFO L93 Difference]: Finished difference Result 238 states and 272 transitions. [2018-11-07 05:11:18,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-07 05:11:18,482 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 179 [2018-11-07 05:11:18,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:11:18,484 INFO L225 Difference]: With dead ends: 238 [2018-11-07 05:11:18,484 INFO L226 Difference]: Without dead ends: 183 [2018-11-07 05:11:18,485 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-11-07 05:11:18,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-07 05:11:18,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-11-07 05:11:18,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-11-07 05:11:18,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 200 transitions. [2018-11-07 05:11:18,533 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 200 transitions. Word has length 179 [2018-11-07 05:11:18,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:11:18,534 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 200 transitions. [2018-11-07 05:11:18,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 05:11:18,534 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 200 transitions. [2018-11-07 05:11:18,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-07 05:11:18,535 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:11:18,535 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 40, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:11:18,535 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:11:18,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:11:18,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1190022204, now seen corresponding path program 40 times [2018-11-07 05:11:18,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:11:18,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:18,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:11:18,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:18,537 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:11:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:11:19,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 2050 proven. 2460 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-07 05:11:19,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:19,298 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:11:19,299 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:11:19,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:11:19,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:19,299 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:11:19,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:11:19,307 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:11:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:11:19,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:11:19,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 2050 proven. 2460 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-07 05:11:19,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:11:21,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 2050 proven. 2460 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-07 05:11:21,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:11:21,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 84 [2018-11-07 05:11:21,379 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:11:21,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-07 05:11:21,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-07 05:11:21,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-11-07 05:11:21,381 INFO L87 Difference]: Start difference. First operand 183 states and 200 transitions. Second operand 43 states. [2018-11-07 05:11:21,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:11:21,617 INFO L93 Difference]: Finished difference Result 241 states and 275 transitions. [2018-11-07 05:11:21,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-07 05:11:21,618 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 182 [2018-11-07 05:11:21,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:11:21,619 INFO L225 Difference]: With dead ends: 241 [2018-11-07 05:11:21,620 INFO L226 Difference]: Without dead ends: 186 [2018-11-07 05:11:21,621 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-11-07 05:11:21,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-07 05:11:21,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-11-07 05:11:21,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-11-07 05:11:21,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 203 transitions. [2018-11-07 05:11:21,669 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 203 transitions. Word has length 182 [2018-11-07 05:11:21,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:11:21,670 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 203 transitions. [2018-11-07 05:11:21,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-07 05:11:21,670 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 203 transitions. [2018-11-07 05:11:21,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-07 05:11:21,671 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:11:21,671 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 41, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:11:21,671 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:11:21,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:11:21,672 INFO L82 PathProgramCache]: Analyzing trace with hash 550341857, now seen corresponding path program 41 times [2018-11-07 05:11:21,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:11:21,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:21,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:11:21,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:21,673 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:11:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:11:22,537 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 2100 proven. 2583 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-07 05:11:22,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:22,537 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:11:22,538 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:11:22,538 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:11:22,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:22,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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:11:22,547 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:11:22,547 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:11:22,591 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-11-07 05:11:22,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:11:22,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:11:23,255 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 2492 refuted. 0 times theorem prover too weak. 2583 trivial. 0 not checked. [2018-11-07 05:11:23,255 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:11:24,057 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 2492 refuted. 0 times theorem prover too weak. 2583 trivial. 0 not checked. [2018-11-07 05:11:24,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:11:24,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 23, 23] total 86 [2018-11-07 05:11:24,077 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:11:24,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-11-07 05:11:24,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-11-07 05:11:24,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1682, Invalid=5628, Unknown=0, NotChecked=0, Total=7310 [2018-11-07 05:11:24,078 INFO L87 Difference]: Start difference. First operand 186 states and 203 transitions. Second operand 65 states. [2018-11-07 05:11:25,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:11:25,854 INFO L93 Difference]: Finished difference Result 309 states and 364 transitions. [2018-11-07 05:11:25,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-11-07 05:11:25,854 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 185 [2018-11-07 05:11:25,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:11:25,855 INFO L225 Difference]: With dead ends: 309 [2018-11-07 05:11:25,855 INFO L226 Difference]: Without dead ends: 251 [2018-11-07 05:11:25,856 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2825 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5048, Invalid=11464, Unknown=0, NotChecked=0, Total=16512 [2018-11-07 05:11:25,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-11-07 05:11:25,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 192. [2018-11-07 05:11:25,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-11-07 05:11:25,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 210 transitions. [2018-11-07 05:11:25,905 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 210 transitions. Word has length 185 [2018-11-07 05:11:25,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:11:25,906 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 210 transitions. [2018-11-07 05:11:25,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-11-07 05:11:25,906 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 210 transitions. [2018-11-07 05:11:25,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-07 05:11:25,907 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:11:25,907 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 42, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:11:25,907 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:11:25,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:11:25,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1684083393, now seen corresponding path program 42 times [2018-11-07 05:11:25,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:11:25,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:25,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:11:25,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:25,909 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:11:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:11:27,480 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 2279 proven. 2709 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-11-07 05:11:27,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:27,481 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:11:27,481 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:11:27,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:11:27,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:27,481 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:11:27,490 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:11:27,490 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:11:27,535 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:11:27,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:11:27,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:11:27,567 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 2279 proven. 2709 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-11-07 05:11:27,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:11:29,549 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 2279 proven. 2709 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-11-07 05:11:29,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:11:29,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 88 [2018-11-07 05:11:29,569 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:11:29,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-07 05:11:29,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-07 05:11:29,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-11-07 05:11:29,570 INFO L87 Difference]: Start difference. First operand 192 states and 210 transitions. Second operand 45 states. [2018-11-07 05:11:29,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:11:29,834 INFO L93 Difference]: Finished difference Result 253 states and 289 transitions. [2018-11-07 05:11:29,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-07 05:11:29,834 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 191 [2018-11-07 05:11:29,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:11:29,835 INFO L225 Difference]: With dead ends: 253 [2018-11-07 05:11:29,835 INFO L226 Difference]: Without dead ends: 195 [2018-11-07 05:11:29,836 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-11-07 05:11:29,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-07 05:11:29,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-11-07 05:11:29,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-11-07 05:11:29,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 213 transitions. [2018-11-07 05:11:29,891 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 213 transitions. Word has length 191 [2018-11-07 05:11:29,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:11:29,891 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 213 transitions. [2018-11-07 05:11:29,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-07 05:11:29,891 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 213 transitions. [2018-11-07 05:11:29,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-07 05:11:29,892 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:11:29,893 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 43, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:11:29,893 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:11:29,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:11:29,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1010669114, now seen corresponding path program 43 times [2018-11-07 05:11:29,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:11:29,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:29,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:11:29,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:29,894 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:11:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:11:31,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 2332 proven. 2838 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-11-07 05:11:31,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:31,123 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:11:31,123 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:11:31,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:11:31,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:31,123 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:11:31,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:11:31,134 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:11:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:11:31,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:11:31,222 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 2332 proven. 2838 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-11-07 05:11:31,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:11:33,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 2332 proven. 2838 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-11-07 05:11:33,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:11:33,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 90 [2018-11-07 05:11:33,496 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:11:33,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-07 05:11:33,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-07 05:11:33,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-11-07 05:11:33,498 INFO L87 Difference]: Start difference. First operand 195 states and 213 transitions. Second operand 46 states. [2018-11-07 05:11:33,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:11:33,705 INFO L93 Difference]: Finished difference Result 256 states and 292 transitions. [2018-11-07 05:11:33,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-07 05:11:33,706 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 194 [2018-11-07 05:11:33,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:11:33,706 INFO L225 Difference]: With dead ends: 256 [2018-11-07 05:11:33,707 INFO L226 Difference]: Without dead ends: 198 [2018-11-07 05:11:33,707 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-11-07 05:11:33,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-11-07 05:11:33,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-11-07 05:11:33,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-11-07 05:11:33,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 216 transitions. [2018-11-07 05:11:33,761 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 216 transitions. Word has length 194 [2018-11-07 05:11:33,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:11:33,762 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 216 transitions. [2018-11-07 05:11:33,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-07 05:11:33,762 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 216 transitions. [2018-11-07 05:11:33,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-07 05:11:33,763 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:11:33,763 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 44, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:11:33,763 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:11:33,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:11:33,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1146091681, now seen corresponding path program 44 times [2018-11-07 05:11:33,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:11:33,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:33,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:11:33,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:33,765 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:11:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:11:35,456 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 2385 proven. 2970 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-11-07 05:11:35,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:35,456 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:11:35,457 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:11:35,457 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:11:35,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:35,457 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:11:35,464 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:11:35,465 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:11:35,513 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-11-07 05:11:35,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:11:35,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:11:36,135 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 2827 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2018-11-07 05:11:36,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:11:37,027 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 2827 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2018-11-07 05:11:37,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:11:37,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 24, 24] total 91 [2018-11-07 05:11:37,047 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:11:37,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-11-07 05:11:37,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-11-07 05:11:37,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1895, Invalid=6295, Unknown=0, NotChecked=0, Total=8190 [2018-11-07 05:11:37,049 INFO L87 Difference]: Start difference. First operand 198 states and 216 transitions. Second operand 69 states. [2018-11-07 05:11:40,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:11:40,856 INFO L93 Difference]: Finished difference Result 324 states and 381 transitions. [2018-11-07 05:11:40,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-11-07 05:11:40,856 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 197 [2018-11-07 05:11:40,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:11:40,857 INFO L225 Difference]: With dead ends: 324 [2018-11-07 05:11:40,857 INFO L226 Difference]: Without dead ends: 263 [2018-11-07 05:11:40,859 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3182 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5726, Invalid=12906, Unknown=0, NotChecked=0, Total=18632 [2018-11-07 05:11:40,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-11-07 05:11:40,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 204. [2018-11-07 05:11:40,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-07 05:11:40,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 223 transitions. [2018-11-07 05:11:40,906 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 223 transitions. Word has length 197 [2018-11-07 05:11:40,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:11:40,907 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 223 transitions. [2018-11-07 05:11:40,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-11-07 05:11:40,907 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 223 transitions. [2018-11-07 05:11:40,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-07 05:11:40,908 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:11:40,908 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 45, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:11:40,908 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:11:40,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:11:40,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1052265089, now seen corresponding path program 45 times [2018-11-07 05:11:40,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:11:40,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:40,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:11:40,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:40,909 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:11:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:11:42,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 2576 proven. 3105 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-11-07 05:11:42,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:42,087 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:11:42,087 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:11:42,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:11:42,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:42,087 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:11:42,096 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:11:42,096 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:11:42,143 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:11:42,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:11:42,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:11:42,188 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 2576 proven. 3105 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-11-07 05:11:42,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:11:44,531 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 2576 proven. 3105 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-11-07 05:11:44,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:11:44,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 94 [2018-11-07 05:11:44,551 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:11:44,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-07 05:11:44,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-07 05:11:44,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-11-07 05:11:44,552 INFO L87 Difference]: Start difference. First operand 204 states and 223 transitions. Second operand 48 states. [2018-11-07 05:11:44,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:11:44,827 INFO L93 Difference]: Finished difference Result 268 states and 306 transitions. [2018-11-07 05:11:44,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-07 05:11:44,827 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 203 [2018-11-07 05:11:44,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:11:44,829 INFO L225 Difference]: With dead ends: 268 [2018-11-07 05:11:44,829 INFO L226 Difference]: Without dead ends: 207 [2018-11-07 05:11:44,830 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 361 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 05:11:44,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-11-07 05:11:44,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-11-07 05:11:44,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-11-07 05:11:44,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 226 transitions. [2018-11-07 05:11:44,875 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 226 transitions. Word has length 203 [2018-11-07 05:11:44,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:11:44,876 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 226 transitions. [2018-11-07 05:11:44,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-07 05:11:44,876 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 226 transitions. [2018-11-07 05:11:44,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-07 05:11:44,877 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:11:44,877 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 46, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:11:44,877 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:11:44,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:11:44,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1189981444, now seen corresponding path program 46 times [2018-11-07 05:11:44,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:11:44,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:44,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:11:44,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:44,878 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:11:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:11:46,084 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 2632 proven. 3243 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-11-07 05:11:46,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:46,085 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:11:46,085 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:11:46,085 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:11:46,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:46,085 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:11:46,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:11:46,093 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:11:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:11:46,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:11:46,195 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 2632 proven. 3243 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-11-07 05:11:46,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:11:48,501 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 2632 proven. 3243 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-11-07 05:11:48,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:11:48,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 96 [2018-11-07 05:11:48,522 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:11:48,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-07 05:11:48,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-07 05:11:48,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-11-07 05:11:48,523 INFO L87 Difference]: Start difference. First operand 207 states and 226 transitions. Second operand 49 states. [2018-11-07 05:11:48,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:11:48,722 INFO L93 Difference]: Finished difference Result 271 states and 309 transitions. [2018-11-07 05:11:48,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-07 05:11:48,723 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 206 [2018-11-07 05:11:48,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:11:48,724 INFO L225 Difference]: With dead ends: 271 [2018-11-07 05:11:48,724 INFO L226 Difference]: Without dead ends: 210 [2018-11-07 05:11:48,725 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-11-07 05:11:48,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-11-07 05:11:48,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-11-07 05:11:48,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-07 05:11:48,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 229 transitions. [2018-11-07 05:11:48,788 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 229 transitions. Word has length 206 [2018-11-07 05:11:48,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:11:48,788 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 229 transitions. [2018-11-07 05:11:48,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-07 05:11:48,788 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 229 transitions. [2018-11-07 05:11:48,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-11-07 05:11:48,790 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:11:48,790 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 47, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:11:48,790 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:11:48,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:11:48,790 INFO L82 PathProgramCache]: Analyzing trace with hash -330091359, now seen corresponding path program 47 times [2018-11-07 05:11:48,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:11:48,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:48,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:11:48,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:48,791 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:11:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:11:49,756 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 2688 proven. 3384 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-11-07 05:11:49,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:49,756 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:11:49,756 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:11:49,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:11:49,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:49,756 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:11:49,764 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:11:49,765 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:11:49,810 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-11-07 05:11:49,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:11:49,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:11:50,715 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 3183 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2018-11-07 05:11:50,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:11:51,681 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 3183 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2018-11-07 05:11:51,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:11:51,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 25, 25] total 96 [2018-11-07 05:11:51,700 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:11:51,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-11-07 05:11:51,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-11-07 05:11:51,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2121, Invalid=6999, Unknown=0, NotChecked=0, Total=9120 [2018-11-07 05:11:51,702 INFO L87 Difference]: Start difference. First operand 210 states and 229 transitions. Second operand 73 states. [2018-11-07 05:11:53,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:11:53,496 INFO L93 Difference]: Finished difference Result 339 states and 398 transitions. [2018-11-07 05:11:53,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-11-07 05:11:53,496 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 209 [2018-11-07 05:11:53,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:11:53,498 INFO L225 Difference]: With dead ends: 339 [2018-11-07 05:11:53,498 INFO L226 Difference]: Without dead ends: 275 [2018-11-07 05:11:53,500 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3560 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6447, Invalid=14433, Unknown=0, NotChecked=0, Total=20880 [2018-11-07 05:11:53,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-11-07 05:11:53,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 216. [2018-11-07 05:11:53,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-11-07 05:11:53,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 236 transitions. [2018-11-07 05:11:53,553 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 236 transitions. Word has length 209 [2018-11-07 05:11:53,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:11:53,553 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 236 transitions. [2018-11-07 05:11:53,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-11-07 05:11:53,554 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 236 transitions. [2018-11-07 05:11:53,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-07 05:11:53,555 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:11:53,555 INFO L375 BasicCegarLoop]: trace histogram [69, 68, 48, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:11:53,555 INFO L423 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:11:53,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:11:53,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1977610625, now seen corresponding path program 48 times [2018-11-07 05:11:53,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:11:53,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:53,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:11:53,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:53,556 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:11:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:11:54,720 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 2891 proven. 3528 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-11-07 05:11:54,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:54,720 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:11:54,720 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:11:54,721 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:11:54,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:54,721 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:11:54,729 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:11:54,729 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:11:54,776 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:11:54,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:11:54,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:11:54,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 2891 proven. 3528 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-11-07 05:11:54,823 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:11:57,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 2891 proven. 3528 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-11-07 05:11:57,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:11:57,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 100 [2018-11-07 05:11:57,576 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:11:57,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-07 05:11:57,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-07 05:11:57,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-11-07 05:11:57,578 INFO L87 Difference]: Start difference. First operand 216 states and 236 transitions. Second operand 51 states. [2018-11-07 05:11:57,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:11:57,842 INFO L93 Difference]: Finished difference Result 283 states and 323 transitions. [2018-11-07 05:11:57,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-07 05:11:57,843 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 215 [2018-11-07 05:11:57,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:11:57,844 INFO L225 Difference]: With dead ends: 283 [2018-11-07 05:11:57,844 INFO L226 Difference]: Without dead ends: 219 [2018-11-07 05:11:57,845 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-11-07 05:11:57,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-11-07 05:11:57,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-11-07 05:11:57,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-11-07 05:11:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 239 transitions. [2018-11-07 05:11:57,899 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 239 transitions. Word has length 215 [2018-11-07 05:11:57,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:11:57,899 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 239 transitions. [2018-11-07 05:11:57,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-07 05:11:57,899 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 239 transitions. [2018-11-07 05:11:57,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-07 05:11:57,900 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:11:57,900 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 49, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:11:57,901 INFO L423 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:11:57,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:11:57,901 INFO L82 PathProgramCache]: Analyzing trace with hash -22923654, now seen corresponding path program 49 times [2018-11-07 05:11:57,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:11:57,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:57,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:11:57,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:11:57,902 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:11:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:11:59,015 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 2950 proven. 3675 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-11-07 05:11:59,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:59,015 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:11:59,015 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:11:59,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:11:59,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:11:59,016 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:11:59,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:11:59,023 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:11:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:11:59,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:11:59,131 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 2950 proven. 3675 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-11-07 05:11:59,131 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:12:02,481 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 2950 proven. 3675 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-11-07 05:12:02,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:12:02,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 102 [2018-11-07 05:12:02,502 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:12:02,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-07 05:12:02,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-07 05:12:02,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 05:12:02,504 INFO L87 Difference]: Start difference. First operand 219 states and 239 transitions. Second operand 52 states. [2018-11-07 05:12:02,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:12:02,780 INFO L93 Difference]: Finished difference Result 286 states and 326 transitions. [2018-11-07 05:12:02,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-07 05:12:02,787 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 218 [2018-11-07 05:12:02,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:12:02,788 INFO L225 Difference]: With dead ends: 286 [2018-11-07 05:12:02,788 INFO L226 Difference]: Without dead ends: 222 [2018-11-07 05:12:02,789 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 05:12:02,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-11-07 05:12:02,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-11-07 05:12:02,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-11-07 05:12:02,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 242 transitions. [2018-11-07 05:12:02,839 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 242 transitions. Word has length 218 [2018-11-07 05:12:02,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:12:02,840 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 242 transitions. [2018-11-07 05:12:02,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-07 05:12:02,840 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 242 transitions. [2018-11-07 05:12:02,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-07 05:12:02,840 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:12:02,841 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 50, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:12:02,841 INFO L423 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:12:02,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:12:02,841 INFO L82 PathProgramCache]: Analyzing trace with hash 890030239, now seen corresponding path program 50 times [2018-11-07 05:12:02,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:12:02,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:02,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:12:02,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:02,842 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:12:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:03,898 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 3009 proven. 3825 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-11-07 05:12:03,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:03,899 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:12:03,899 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:12:03,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:12:03,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:03,899 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:12:03,909 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:12:03,909 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:12:04,235 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-11-07 05:12:04,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:12:04,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:12:04,964 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 3560 refuted. 0 times theorem prover too weak. 3825 trivial. 0 not checked. [2018-11-07 05:12:04,964 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:12:06,318 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 3560 refuted. 0 times theorem prover too weak. 3825 trivial. 0 not checked. [2018-11-07 05:12:06,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:12:06,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 26, 26] total 101 [2018-11-07 05:12:06,338 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:12:06,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-11-07 05:12:06,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-11-07 05:12:06,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2360, Invalid=7740, Unknown=0, NotChecked=0, Total=10100 [2018-11-07 05:12:06,340 INFO L87 Difference]: Start difference. First operand 222 states and 242 transitions. Second operand 77 states. [2018-11-07 05:12:08,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:12:08,300 INFO L93 Difference]: Finished difference Result 354 states and 415 transitions. [2018-11-07 05:12:08,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-11-07 05:12:08,300 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 221 [2018-11-07 05:12:08,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:12:08,302 INFO L225 Difference]: With dead ends: 354 [2018-11-07 05:12:08,302 INFO L226 Difference]: Without dead ends: 287 [2018-11-07 05:12:08,303 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3959 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7211, Invalid=16045, Unknown=0, NotChecked=0, Total=23256 [2018-11-07 05:12:08,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-11-07 05:12:08,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 228. [2018-11-07 05:12:08,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-11-07 05:12:08,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 249 transitions. [2018-11-07 05:12:08,366 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 249 transitions. Word has length 221 [2018-11-07 05:12:08,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:12:08,367 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 249 transitions. [2018-11-07 05:12:08,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-11-07 05:12:08,367 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 249 transitions. [2018-11-07 05:12:08,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-11-07 05:12:08,368 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:12:08,368 INFO L375 BasicCegarLoop]: trace histogram [73, 72, 51, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:12:08,369 INFO L423 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:12:08,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:12:08,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1706007999, now seen corresponding path program 51 times [2018-11-07 05:12:08,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:12:08,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:08,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:12:08,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:08,370 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:12:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:09,479 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 3224 proven. 3978 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2018-11-07 05:12:09,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:09,480 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:12:09,480 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:12:09,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:12:09,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:09,480 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:12:09,490 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:12:09,490 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:12:09,540 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:12:09,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:12:09,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:12:09,608 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 3224 proven. 3978 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2018-11-07 05:12:09,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:12:12,986 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 3224 proven. 3978 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2018-11-07 05:12:13,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:12:13,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 106 [2018-11-07 05:12:13,007 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:12:13,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-07 05:12:13,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-07 05:12:13,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-11-07 05:12:13,009 INFO L87 Difference]: Start difference. First operand 228 states and 249 transitions. Second operand 54 states. [2018-11-07 05:12:13,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:12:13,266 INFO L93 Difference]: Finished difference Result 298 states and 340 transitions. [2018-11-07 05:12:13,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-07 05:12:13,267 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 227 [2018-11-07 05:12:13,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:12:13,268 INFO L225 Difference]: With dead ends: 298 [2018-11-07 05:12:13,268 INFO L226 Difference]: Without dead ends: 231 [2018-11-07 05:12:13,269 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-11-07 05:12:13,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-11-07 05:12:13,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-11-07 05:12:13,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-11-07 05:12:13,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 252 transitions. [2018-11-07 05:12:13,326 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 252 transitions. Word has length 227 [2018-11-07 05:12:13,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:12:13,326 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 252 transitions. [2018-11-07 05:12:13,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-07 05:12:13,326 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 252 transitions. [2018-11-07 05:12:13,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-07 05:12:13,327 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:12:13,327 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 52, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:12:13,328 INFO L423 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:12:13,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:12:13,328 INFO L82 PathProgramCache]: Analyzing trace with hash 742877628, now seen corresponding path program 52 times [2018-11-07 05:12:13,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:12:13,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:13,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:12:13,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:13,329 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:12:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:14,443 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 3286 proven. 4134 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2018-11-07 05:12:14,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:14,444 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:12:14,444 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:12:14,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:12:14,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:14,444 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:12:14,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:12:14,453 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:12:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:14,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:12:14,551 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 3286 proven. 4134 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2018-11-07 05:12:14,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:12:17,773 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 3286 proven. 4134 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2018-11-07 05:12:17,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:12:17,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 108 [2018-11-07 05:12:17,793 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:12:17,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-07 05:12:17,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-07 05:12:17,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-11-07 05:12:17,794 INFO L87 Difference]: Start difference. First operand 231 states and 252 transitions. Second operand 55 states. [2018-11-07 05:12:18,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:12:18,059 INFO L93 Difference]: Finished difference Result 301 states and 343 transitions. [2018-11-07 05:12:18,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-07 05:12:18,060 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 230 [2018-11-07 05:12:18,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:12:18,061 INFO L225 Difference]: With dead ends: 301 [2018-11-07 05:12:18,061 INFO L226 Difference]: Without dead ends: 234 [2018-11-07 05:12:18,062 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-11-07 05:12:18,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-11-07 05:12:18,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2018-11-07 05:12:18,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-11-07 05:12:18,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 255 transitions. [2018-11-07 05:12:18,117 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 255 transitions. Word has length 230 [2018-11-07 05:12:18,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:12:18,117 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 255 transitions. [2018-11-07 05:12:18,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-07 05:12:18,117 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 255 transitions. [2018-11-07 05:12:18,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-11-07 05:12:18,118 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:12:18,119 INFO L375 BasicCegarLoop]: trace histogram [75, 74, 53, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:12:18,119 INFO L423 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:12:18,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:12:18,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1180101729, now seen corresponding path program 53 times [2018-11-07 05:12:18,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:12:18,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:18,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:12:18,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:18,120 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:12:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:19,422 INFO L134 CoverageAnalysis]: Checked inductivity of 8251 backedges. 3348 proven. 4293 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2018-11-07 05:12:19,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:19,423 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:12:19,423 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:12:19,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 05:12:19,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:19,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 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:12:19,432 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:12:19,432 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:12:19,484 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-11-07 05:12:19,484 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:12:19,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:12:20,253 INFO L134 CoverageAnalysis]: Checked inductivity of 8251 backedges. 0 proven. 3958 refuted. 0 times theorem prover too weak. 4293 trivial. 0 not checked. [2018-11-07 05:12:20,254 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:12:21,657 INFO L134 CoverageAnalysis]: Checked inductivity of 8251 backedges. 0 proven. 3958 refuted. 0 times theorem prover too weak. 4293 trivial. 0 not checked. [2018-11-07 05:12:21,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:12:21,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 27, 27] total 106 [2018-11-07 05:12:21,678 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:12:21,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-11-07 05:12:21,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-11-07 05:12:21,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2612, Invalid=8518, Unknown=0, NotChecked=0, Total=11130 [2018-11-07 05:12:21,680 INFO L87 Difference]: Start difference. First operand 234 states and 255 transitions. Second operand 81 states. [2018-11-07 05:12:23,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:12:23,794 INFO L93 Difference]: Finished difference Result 369 states and 432 transitions. [2018-11-07 05:12:23,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-11-07 05:12:23,795 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 233 [2018-11-07 05:12:23,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:12:23,797 INFO L225 Difference]: With dead ends: 369 [2018-11-07 05:12:23,797 INFO L226 Difference]: Without dead ends: 299 [2018-11-07 05:12:23,799 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4379 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=8018, Invalid=17742, Unknown=0, NotChecked=0, Total=25760 [2018-11-07 05:12:23,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-11-07 05:12:23,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 240. [2018-11-07 05:12:23,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-11-07 05:12:23,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 262 transitions. [2018-11-07 05:12:23,874 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 262 transitions. Word has length 233 [2018-11-07 05:12:23,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:12:23,875 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 262 transitions. [2018-11-07 05:12:23,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-11-07 05:12:23,875 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 262 transitions. [2018-11-07 05:12:23,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-11-07 05:12:23,876 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:12:23,876 INFO L375 BasicCegarLoop]: trace histogram [77, 76, 54, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:12:23,876 INFO L423 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:12:23,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:12:23,876 INFO L82 PathProgramCache]: Analyzing trace with hash -2141839425, now seen corresponding path program 54 times [2018-11-07 05:12:23,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:12:23,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:23,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:12:23,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:23,877 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:12:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:25,019 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 3575 proven. 4455 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2018-11-07 05:12:25,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:25,020 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:12:25,020 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:12:25,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:12:25,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:25,020 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:12:25,028 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:12:25,028 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:12:25,081 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:12:25,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:12:25,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:12:25,125 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 3575 proven. 4455 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2018-11-07 05:12:25,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:12:28,554 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 3575 proven. 4455 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2018-11-07 05:12:28,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:12:28,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 112 [2018-11-07 05:12:28,574 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:12:28,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-11-07 05:12:28,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-07 05:12:28,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-11-07 05:12:28,576 INFO L87 Difference]: Start difference. First operand 240 states and 262 transitions. Second operand 57 states. [2018-11-07 05:12:28,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:12:28,874 INFO L93 Difference]: Finished difference Result 313 states and 357 transitions. [2018-11-07 05:12:28,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-11-07 05:12:28,874 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 239 [2018-11-07 05:12:28,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:12:28,876 INFO L225 Difference]: With dead ends: 313 [2018-11-07 05:12:28,876 INFO L226 Difference]: Without dead ends: 243 [2018-11-07 05:12:28,877 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-11-07 05:12:28,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-11-07 05:12:28,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-11-07 05:12:28,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-11-07 05:12:28,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 265 transitions. [2018-11-07 05:12:28,938 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 265 transitions. Word has length 239 [2018-11-07 05:12:28,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:12:28,938 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 265 transitions. [2018-11-07 05:12:28,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-11-07 05:12:28,938 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 265 transitions. [2018-11-07 05:12:28,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-11-07 05:12:28,939 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:12:28,939 INFO L375 BasicCegarLoop]: trace histogram [78, 77, 55, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:12:28,939 INFO L423 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:12:28,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:12:28,939 INFO L82 PathProgramCache]: Analyzing trace with hash 99534522, now seen corresponding path program 55 times [2018-11-07 05:12:28,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:12:28,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:28,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:12:28,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:28,940 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:12:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:30,170 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 3640 proven. 4620 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2018-11-07 05:12:30,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:30,170 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:12:30,170 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:12:30,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 05:12:30,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:30,171 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:12:30,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:12:30,179 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:12:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:30,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:12:30,285 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 3640 proven. 4620 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2018-11-07 05:12:30,285 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:12:33,848 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 3640 proven. 4620 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2018-11-07 05:12:33,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:12:33,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 114 [2018-11-07 05:12:33,867 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:12:33,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-07 05:12:33,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-07 05:12:33,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-11-07 05:12:33,869 INFO L87 Difference]: Start difference. First operand 243 states and 265 transitions. Second operand 58 states. [2018-11-07 05:12:34,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:12:34,176 INFO L93 Difference]: Finished difference Result 316 states and 360 transitions. [2018-11-07 05:12:34,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-11-07 05:12:34,176 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 242 [2018-11-07 05:12:34,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:12:34,177 INFO L225 Difference]: With dead ends: 316 [2018-11-07 05:12:34,177 INFO L226 Difference]: Without dead ends: 246 [2018-11-07 05:12:34,178 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 429 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-11-07 05:12:34,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-11-07 05:12:34,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2018-11-07 05:12:34,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-11-07 05:12:34,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 268 transitions. [2018-11-07 05:12:34,265 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 268 transitions. Word has length 242 [2018-11-07 05:12:34,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:12:34,265 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 268 transitions. [2018-11-07 05:12:34,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-07 05:12:34,265 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 268 transitions. [2018-11-07 05:12:34,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-11-07 05:12:34,267 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:12:34,267 INFO L375 BasicCegarLoop]: trace histogram [79, 78, 56, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:12:34,267 INFO L423 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:12:34,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:12:34,267 INFO L82 PathProgramCache]: Analyzing trace with hash -985761313, now seen corresponding path program 56 times [2018-11-07 05:12:34,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:12:34,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:34,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:12:34,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:34,268 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:12:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:35,550 INFO L134 CoverageAnalysis]: Checked inductivity of 9165 backedges. 3705 proven. 4788 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2018-11-07 05:12:35,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:35,550 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:12:35,550 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:12:35,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 05:12:35,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:35,551 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:12:35,561 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:12:35,561 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:12:35,613 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-11-07 05:12:35,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:12:35,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:12:36,777 INFO L134 CoverageAnalysis]: Checked inductivity of 9165 backedges. 0 proven. 4377 refuted. 0 times theorem prover too weak. 4788 trivial. 0 not checked. [2018-11-07 05:12:36,777 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:12:38,044 INFO L134 CoverageAnalysis]: Checked inductivity of 9165 backedges. 0 proven. 4377 refuted. 0 times theorem prover too weak. 4788 trivial. 0 not checked. [2018-11-07 05:12:38,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:12:38,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 28, 28] total 111 [2018-11-07 05:12:38,064 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:12:38,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-11-07 05:12:38,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-11-07 05:12:38,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2877, Invalid=9333, Unknown=0, NotChecked=0, Total=12210 [2018-11-07 05:12:38,066 INFO L87 Difference]: Start difference. First operand 246 states and 268 transitions. Second operand 85 states. [2018-11-07 05:12:40,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:12:40,534 INFO L93 Difference]: Finished difference Result 384 states and 449 transitions. [2018-11-07 05:12:40,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-11-07 05:12:40,535 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 245 [2018-11-07 05:12:40,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:12:40,536 INFO L225 Difference]: With dead ends: 384 [2018-11-07 05:12:40,536 INFO L226 Difference]: Without dead ends: 311 [2018-11-07 05:12:40,539 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 439 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4820 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8868, Invalid=19524, Unknown=0, NotChecked=0, Total=28392 [2018-11-07 05:12:40,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-11-07 05:12:40,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 252. [2018-11-07 05:12:40,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-11-07 05:12:40,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 275 transitions. [2018-11-07 05:12:40,610 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 275 transitions. Word has length 245 [2018-11-07 05:12:40,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:12:40,610 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 275 transitions. [2018-11-07 05:12:40,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-11-07 05:12:40,611 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 275 transitions. [2018-11-07 05:12:40,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-11-07 05:12:40,612 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:12:40,612 INFO L375 BasicCegarLoop]: trace histogram [81, 80, 57, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:12:40,612 INFO L423 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:12:40,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:12:40,613 INFO L82 PathProgramCache]: Analyzing trace with hash -673543679, now seen corresponding path program 57 times [2018-11-07 05:12:40,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:12:40,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:40,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:12:40,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:40,614 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:12:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 9640 backedges. 3944 proven. 4959 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2018-11-07 05:12:42,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:42,197 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:12:42,197 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:12:42,197 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:12:42,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:42,198 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:12:42,208 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:12:42,208 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:12:42,261 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:12:42,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:12:42,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:12:42,309 INFO L134 CoverageAnalysis]: Checked inductivity of 9640 backedges. 3944 proven. 4959 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2018-11-07 05:12:42,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:12:45,741 INFO L134 CoverageAnalysis]: Checked inductivity of 9640 backedges. 3944 proven. 4959 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2018-11-07 05:12:45,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:12:45,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 118 [2018-11-07 05:12:45,761 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:12:45,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-11-07 05:12:45,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-11-07 05:12:45,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-11-07 05:12:45,763 INFO L87 Difference]: Start difference. First operand 252 states and 275 transitions. Second operand 60 states. [2018-11-07 05:12:46,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:12:46,088 INFO L93 Difference]: Finished difference Result 328 states and 374 transitions. [2018-11-07 05:12:46,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-11-07 05:12:46,088 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 251 [2018-11-07 05:12:46,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:12:46,091 INFO L225 Difference]: With dead ends: 328 [2018-11-07 05:12:46,091 INFO L226 Difference]: Without dead ends: 255 [2018-11-07 05:12:46,092 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 445 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-11-07 05:12:46,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-11-07 05:12:46,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-11-07 05:12:46,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-11-07 05:12:46,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 278 transitions. [2018-11-07 05:12:46,168 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 278 transitions. Word has length 251 [2018-11-07 05:12:46,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:12:46,168 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 278 transitions. [2018-11-07 05:12:46,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-11-07 05:12:46,168 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 278 transitions. [2018-11-07 05:12:46,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-11-07 05:12:46,169 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:12:46,169 INFO L375 BasicCegarLoop]: trace histogram [82, 81, 58, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:12:46,170 INFO L423 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:12:46,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:12:46,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1977511812, now seen corresponding path program 58 times [2018-11-07 05:12:46,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:12:46,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:46,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:12:46,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:46,171 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:12:46,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:47,785 INFO L134 CoverageAnalysis]: Checked inductivity of 9882 backedges. 4012 proven. 5133 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2018-11-07 05:12:47,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:47,786 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:12:47,786 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:12:47,786 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:12:47,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:47,786 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:12:47,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:12:47,795 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:12:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:47,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:12:47,917 INFO L134 CoverageAnalysis]: Checked inductivity of 9882 backedges. 4012 proven. 5133 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2018-11-07 05:12:47,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:12:52,503 INFO L134 CoverageAnalysis]: Checked inductivity of 9882 backedges. 4012 proven. 5133 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2018-11-07 05:12:52,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:12:52,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 120 [2018-11-07 05:12:52,524 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:12:52,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-11-07 05:12:52,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-11-07 05:12:52,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-11-07 05:12:52,526 INFO L87 Difference]: Start difference. First operand 255 states and 278 transitions. Second operand 61 states. [2018-11-07 05:12:52,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:12:52,818 INFO L93 Difference]: Finished difference Result 331 states and 377 transitions. [2018-11-07 05:12:52,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-11-07 05:12:52,818 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 254 [2018-11-07 05:12:52,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:12:52,820 INFO L225 Difference]: With dead ends: 331 [2018-11-07 05:12:52,820 INFO L226 Difference]: Without dead ends: 258 [2018-11-07 05:12:52,821 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-11-07 05:12:52,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-07 05:12:52,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2018-11-07 05:12:52,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-11-07 05:12:52,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 281 transitions. [2018-11-07 05:12:52,887 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 281 transitions. Word has length 254 [2018-11-07 05:12:52,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:12:52,887 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 281 transitions. [2018-11-07 05:12:52,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-11-07 05:12:52,887 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 281 transitions. [2018-11-07 05:12:52,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-11-07 05:12:52,888 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:12:52,888 INFO L375 BasicCegarLoop]: trace histogram [83, 82, 59, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:12:52,888 INFO L423 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:12:52,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:12:52,889 INFO L82 PathProgramCache]: Analyzing trace with hash -512969695, now seen corresponding path program 59 times [2018-11-07 05:12:52,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:12:52,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:52,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:12:52,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:52,890 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:12:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:54,262 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 4080 proven. 5310 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2018-11-07 05:12:54,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:54,263 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:12:54,263 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:12:54,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:12:54,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:54,263 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:12:54,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:12:54,271 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:12:54,332 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-11-07 05:12:54,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:12:54,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:12:55,230 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 0 proven. 4817 refuted. 0 times theorem prover too weak. 5310 trivial. 0 not checked. [2018-11-07 05:12:55,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:12:56,591 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 0 proven. 4817 refuted. 0 times theorem prover too weak. 5310 trivial. 0 not checked. [2018-11-07 05:12:56,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:12:56,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 29, 29] total 116 [2018-11-07 05:12:56,610 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:12:56,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-11-07 05:12:56,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-11-07 05:12:56,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3155, Invalid=10185, Unknown=0, NotChecked=0, Total=13340 [2018-11-07 05:12:56,612 INFO L87 Difference]: Start difference. First operand 258 states and 281 transitions. Second operand 89 states. [2018-11-07 05:12:59,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:12:59,444 INFO L93 Difference]: Finished difference Result 399 states and 466 transitions. [2018-11-07 05:12:59,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-11-07 05:12:59,444 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 257 [2018-11-07 05:12:59,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:12:59,446 INFO L225 Difference]: With dead ends: 399 [2018-11-07 05:12:59,446 INFO L226 Difference]: Without dead ends: 323 [2018-11-07 05:12:59,448 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 461 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5282 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=9761, Invalid=21391, Unknown=0, NotChecked=0, Total=31152 [2018-11-07 05:12:59,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-11-07 05:12:59,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 264. [2018-11-07 05:12:59,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-11-07 05:12:59,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 288 transitions. [2018-11-07 05:12:59,531 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 288 transitions. Word has length 257 [2018-11-07 05:12:59,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:12:59,531 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 288 transitions. [2018-11-07 05:12:59,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-11-07 05:12:59,531 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 288 transitions. [2018-11-07 05:12:59,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-11-07 05:12:59,533 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:12:59,533 INFO L375 BasicCegarLoop]: trace histogram [85, 84, 60, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:12:59,533 INFO L423 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:12:59,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:12:59,533 INFO L82 PathProgramCache]: Analyzing trace with hash -601022209, now seen corresponding path program 60 times [2018-11-07 05:12:59,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:12:59,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:59,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:12:59,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:59,534 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:12:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:13:00,944 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 4331 proven. 5490 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2018-11-07 05:13:00,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:13:00,945 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:13:00,945 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:13:00,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 05:13:00,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:13:00,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 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:13:00,954 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:13:00,954 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:13:01,016 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:13:01,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:13:01,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:13:01,081 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 4331 proven. 5490 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2018-11-07 05:13:01,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:13:05,092 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 4331 proven. 5490 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2018-11-07 05:13:05,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:13:05,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 124 [2018-11-07 05:13:05,112 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:13:05,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-11-07 05:13:05,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-11-07 05:13:05,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-11-07 05:13:05,114 INFO L87 Difference]: Start difference. First operand 264 states and 288 transitions. Second operand 63 states. [2018-11-07 05:13:05,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:13:05,396 INFO L93 Difference]: Finished difference Result 343 states and 391 transitions. [2018-11-07 05:13:05,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-11-07 05:13:05,397 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 263 [2018-11-07 05:13:05,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:13:05,399 INFO L225 Difference]: With dead ends: 343 [2018-11-07 05:13:05,399 INFO L226 Difference]: Without dead ends: 267 [2018-11-07 05:13:05,400 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 466 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 05:13:05,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-07 05:13:05,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-11-07 05:13:05,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-11-07 05:13:05,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 291 transitions. [2018-11-07 05:13:05,490 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 291 transitions. Word has length 263 [2018-11-07 05:13:05,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:13:05,491 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 291 transitions. [2018-11-07 05:13:05,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-11-07 05:13:05,491 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 291 transitions. [2018-11-07 05:13:05,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-11-07 05:13:05,492 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:13:05,492 INFO L375 BasicCegarLoop]: trace histogram [86, 85, 61, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:13:05,492 INFO L423 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:13:05,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:13:05,493 INFO L82 PathProgramCache]: Analyzing trace with hash 118441722, now seen corresponding path program 61 times [2018-11-07 05:13:05,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:13:05,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:13:05,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:13:05,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:13:05,494 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:13:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:13:07,000 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 4402 proven. 5673 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2018-11-07 05:13:07,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:13:07,000 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:13:07,000 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:13:07,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:13:07,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:13:07,001 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:13:07,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:13:07,009 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:13:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:13:07,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:13:07,121 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 4402 proven. 5673 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2018-11-07 05:13:07,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:13:11,179 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 4402 proven. 5673 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2018-11-07 05:13:11,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:13:11,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 126 [2018-11-07 05:13:11,199 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:13:11,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-11-07 05:13:11,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-11-07 05:13:11,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-11-07 05:13:11,201 INFO L87 Difference]: Start difference. First operand 267 states and 291 transitions. Second operand 64 states. [2018-11-07 05:13:11,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:13:11,553 INFO L93 Difference]: Finished difference Result 346 states and 394 transitions. [2018-11-07 05:13:11,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-11-07 05:13:11,553 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 266 [2018-11-07 05:13:11,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:13:11,555 INFO L225 Difference]: With dead ends: 346 [2018-11-07 05:13:11,555 INFO L226 Difference]: Without dead ends: 270 [2018-11-07 05:13:11,556 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 595 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-11-07 05:13:11,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-11-07 05:13:11,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2018-11-07 05:13:11,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-11-07 05:13:11,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 294 transitions. [2018-11-07 05:13:11,632 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 294 transitions. Word has length 266 [2018-11-07 05:13:11,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:13:11,632 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 294 transitions. [2018-11-07 05:13:11,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-11-07 05:13:11,632 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 294 transitions. [2018-11-07 05:13:11,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-11-07 05:13:11,634 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:13:11,634 INFO L375 BasicCegarLoop]: trace histogram [87, 86, 62, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:13:11,634 INFO L423 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:13:11,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:13:11,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1781603103, now seen corresponding path program 62 times [2018-11-07 05:13:11,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:13:11,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:13:11,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:13:11,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:13:11,636 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:13:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:13:13,337 INFO L134 CoverageAnalysis]: Checked inductivity of 11137 backedges. 4473 proven. 5859 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2018-11-07 05:13:13,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:13:13,338 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:13:13,338 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:13:13,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:13:13,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:13:13,338 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:13:13,348 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:13:13,348 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:13:13,409 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-11-07 05:13:13,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:13:13,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:13:14,377 INFO L134 CoverageAnalysis]: Checked inductivity of 11137 backedges. 0 proven. 5278 refuted. 0 times theorem prover too weak. 5859 trivial. 0 not checked. [2018-11-07 05:13:14,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:13:15,849 INFO L134 CoverageAnalysis]: Checked inductivity of 11137 backedges. 0 proven. 5278 refuted. 0 times theorem prover too weak. 5859 trivial. 0 not checked. [2018-11-07 05:13:15,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:13:15,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 30, 30] total 121 [2018-11-07 05:13:15,869 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:13:15,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-11-07 05:13:15,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-11-07 05:13:15,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3446, Invalid=11074, Unknown=0, NotChecked=0, Total=14520 [2018-11-07 05:13:15,871 INFO L87 Difference]: Start difference. First operand 270 states and 294 transitions. Second operand 93 states. [2018-11-07 05:13:18,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:13:18,694 INFO L93 Difference]: Finished difference Result 414 states and 483 transitions. [2018-11-07 05:13:18,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-11-07 05:13:18,694 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 269 [2018-11-07 05:13:18,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:13:18,695 INFO L225 Difference]: With dead ends: 414 [2018-11-07 05:13:18,696 INFO L226 Difference]: Without dead ends: 335 [2018-11-07 05:13:18,697 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 666 GetRequests, 483 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5765 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=10697, Invalid=23343, Unknown=0, NotChecked=0, Total=34040 [2018-11-07 05:13:18,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-11-07 05:13:18,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 276. [2018-11-07 05:13:18,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-11-07 05:13:18,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 301 transitions. [2018-11-07 05:13:18,781 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 301 transitions. Word has length 269 [2018-11-07 05:13:18,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:13:18,781 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 301 transitions. [2018-11-07 05:13:18,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-11-07 05:13:18,781 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 301 transitions. [2018-11-07 05:13:18,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-11-07 05:13:18,782 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:13:18,782 INFO L375 BasicCegarLoop]: trace histogram [89, 88, 63, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:13:18,782 INFO L423 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:13:18,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:13:18,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1427455551, now seen corresponding path program 63 times [2018-11-07 05:13:18,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:13:18,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:13:18,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:13:18,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:13:18,784 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:13:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:13:20,394 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 4736 proven. 6048 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2018-11-07 05:13:20,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:13:20,394 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:13:20,395 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:13:20,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:13:20,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:13:20,395 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:13:20,405 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:13:20,405 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:13:20,462 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:13:20,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:13:20,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:13:20,535 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 4736 proven. 6048 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2018-11-07 05:13:20,535 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:13:24,776 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 4736 proven. 6048 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2018-11-07 05:13:24,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:13:24,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 130 [2018-11-07 05:13:24,795 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:13:24,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-11-07 05:13:24,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-11-07 05:13:24,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-11-07 05:13:24,797 INFO L87 Difference]: Start difference. First operand 276 states and 301 transitions. Second operand 66 states. [2018-11-07 05:13:25,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:13:25,192 INFO L93 Difference]: Finished difference Result 358 states and 408 transitions. [2018-11-07 05:13:25,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-11-07 05:13:25,193 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 275 [2018-11-07 05:13:25,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:13:25,195 INFO L225 Difference]: With dead ends: 358 [2018-11-07 05:13:25,195 INFO L226 Difference]: Without dead ends: 279 [2018-11-07 05:13:25,196 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-11-07 05:13:25,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-11-07 05:13:25,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-11-07 05:13:25,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-11-07 05:13:25,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 304 transitions. [2018-11-07 05:13:25,280 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 304 transitions. Word has length 275 [2018-11-07 05:13:25,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:13:25,280 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 304 transitions. [2018-11-07 05:13:25,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-11-07 05:13:25,280 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 304 transitions. [2018-11-07 05:13:25,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-11-07 05:13:25,281 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:13:25,281 INFO L375 BasicCegarLoop]: trace histogram [90, 89, 64, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:13:25,282 INFO L423 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:13:25,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:13:25,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1563739964, now seen corresponding path program 64 times [2018-11-07 05:13:25,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:13:25,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:13:25,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:13:25,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:13:25,283 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:13:25,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:13:26,879 INFO L134 CoverageAnalysis]: Checked inductivity of 11926 backedges. 4810 proven. 6240 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2018-11-07 05:13:26,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:13:26,879 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:13:26,879 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:13:26,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:13:26,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:13:26,880 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:13:26,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:13:26,889 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:13:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:13:26,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:13:27,002 INFO L134 CoverageAnalysis]: Checked inductivity of 11926 backedges. 4810 proven. 6240 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2018-11-07 05:13:27,002 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:13:31,304 INFO L134 CoverageAnalysis]: Checked inductivity of 11926 backedges. 4810 proven. 6240 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2018-11-07 05:13:31,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:13:31,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 132 [2018-11-07 05:13:31,324 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:13:31,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-11-07 05:13:31,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-11-07 05:13:31,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-11-07 05:13:31,325 INFO L87 Difference]: Start difference. First operand 279 states and 304 transitions. Second operand 67 states. [2018-11-07 05:13:31,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:13:31,626 INFO L93 Difference]: Finished difference Result 361 states and 411 transitions. [2018-11-07 05:13:31,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-11-07 05:13:31,627 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 278 [2018-11-07 05:13:31,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:13:31,629 INFO L225 Difference]: With dead ends: 361 [2018-11-07 05:13:31,629 INFO L226 Difference]: Without dead ends: 282 [2018-11-07 05:13:31,630 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 492 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-11-07 05:13:31,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-11-07 05:13:31,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2018-11-07 05:13:31,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-11-07 05:13:31,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 307 transitions. [2018-11-07 05:13:31,723 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 307 transitions. Word has length 278 [2018-11-07 05:13:31,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:13:31,723 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 307 transitions. [2018-11-07 05:13:31,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-11-07 05:13:31,723 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 307 transitions. [2018-11-07 05:13:31,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-11-07 05:13:31,724 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:13:31,724 INFO L375 BasicCegarLoop]: trace histogram [91, 90, 65, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:13:31,725 INFO L423 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:13:31,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:13:31,725 INFO L82 PathProgramCache]: Analyzing trace with hash 287869921, now seen corresponding path program 65 times [2018-11-07 05:13:31,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:13:31,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:13:31,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:13:31,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:13:31,726 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:13:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:13:33,324 INFO L134 CoverageAnalysis]: Checked inductivity of 12195 backedges. 4884 proven. 6435 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2018-11-07 05:13:33,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:13:33,324 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:13:33,324 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:13:33,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:13:33,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:13:33,325 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:13:33,333 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:13:33,333 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:13:33,391 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-11-07 05:13:33,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:13:33,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:13:34,457 INFO L134 CoverageAnalysis]: Checked inductivity of 12195 backedges. 0 proven. 5760 refuted. 0 times theorem prover too weak. 6435 trivial. 0 not checked. [2018-11-07 05:13:34,457 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:13:36,013 INFO L134 CoverageAnalysis]: Checked inductivity of 12195 backedges. 0 proven. 5760 refuted. 0 times theorem prover too weak. 6435 trivial. 0 not checked. [2018-11-07 05:13:36,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:13:36,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 31, 31] total 126 [2018-11-07 05:13:36,033 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:13:36,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-11-07 05:13:36,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-11-07 05:13:36,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3750, Invalid=12000, Unknown=0, NotChecked=0, Total=15750 [2018-11-07 05:13:36,035 INFO L87 Difference]: Start difference. First operand 282 states and 307 transitions. Second operand 97 states. [2018-11-07 05:13:39,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:13:39,053 INFO L93 Difference]: Finished difference Result 429 states and 500 transitions. [2018-11-07 05:13:39,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-11-07 05:13:39,053 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 281 [2018-11-07 05:13:39,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:13:39,055 INFO L225 Difference]: With dead ends: 429 [2018-11-07 05:13:39,055 INFO L226 Difference]: Without dead ends: 347 [2018-11-07 05:13:39,057 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 696 GetRequests, 505 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6269 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=11676, Invalid=25380, Unknown=0, NotChecked=0, Total=37056 [2018-11-07 05:13:39,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-11-07 05:13:39,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 288. [2018-11-07 05:13:39,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-11-07 05:13:39,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 314 transitions. [2018-11-07 05:13:39,149 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 314 transitions. Word has length 281 [2018-11-07 05:13:39,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:13:39,149 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 314 transitions. [2018-11-07 05:13:39,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-11-07 05:13:39,149 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 314 transitions. [2018-11-07 05:13:39,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-11-07 05:13:39,151 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:13:39,151 INFO L375 BasicCegarLoop]: trace histogram [93, 92, 66, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:13:39,151 INFO L423 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:13:39,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:13:39,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1164897729, now seen corresponding path program 66 times [2018-11-07 05:13:39,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:13:39,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:13:39,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:13:39,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:13:39,153 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:13:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:13:40,773 INFO L134 CoverageAnalysis]: Checked inductivity of 12742 backedges. 5159 proven. 6633 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2018-11-07 05:13:40,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:13:40,773 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:13:40,774 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:13:40,774 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:13:40,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:13:40,774 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:13:40,781 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:13:40,782 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:13:40,842 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:13:40,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:13:40,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:13:40,903 INFO L134 CoverageAnalysis]: Checked inductivity of 12742 backedges. 5159 proven. 6633 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2018-11-07 05:13:40,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:13:45,487 INFO L134 CoverageAnalysis]: Checked inductivity of 12742 backedges. 5159 proven. 6633 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2018-11-07 05:13:45,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:13:45,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 136 [2018-11-07 05:13:45,507 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:13:45,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-11-07 05:13:45,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-11-07 05:13:45,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-11-07 05:13:45,508 INFO L87 Difference]: Start difference. First operand 288 states and 314 transitions. Second operand 69 states. [2018-11-07 05:13:45,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:13:45,932 INFO L93 Difference]: Finished difference Result 373 states and 425 transitions. [2018-11-07 05:13:45,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-11-07 05:13:45,932 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 287 [2018-11-07 05:13:45,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:13:45,934 INFO L225 Difference]: With dead ends: 373 [2018-11-07 05:13:45,934 INFO L226 Difference]: Without dead ends: 291 [2018-11-07 05:13:45,935 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 642 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-11-07 05:13:45,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-11-07 05:13:46,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2018-11-07 05:13:46,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-11-07 05:13:46,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 317 transitions. [2018-11-07 05:13:46,028 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 317 transitions. Word has length 287 [2018-11-07 05:13:46,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:13:46,028 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 317 transitions. [2018-11-07 05:13:46,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-11-07 05:13:46,028 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 317 transitions. [2018-11-07 05:13:46,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-11-07 05:13:46,029 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:13:46,030 INFO L375 BasicCegarLoop]: trace histogram [94, 93, 67, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:13:46,030 INFO L423 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:13:46,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:13:46,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1978644282, now seen corresponding path program 67 times [2018-11-07 05:13:46,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:13:46,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:13:46,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:13:46,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:13:46,031 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:13:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:13:47,698 INFO L134 CoverageAnalysis]: Checked inductivity of 13020 backedges. 5236 proven. 6834 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2018-11-07 05:13:47,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:13:47,699 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:13:47,699 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:13:47,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:13:47,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:13:47,699 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:13:47,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:13:47,711 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:13:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:13:47,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:13:47,830 INFO L134 CoverageAnalysis]: Checked inductivity of 13020 backedges. 5236 proven. 6834 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2018-11-07 05:13:47,830 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:13:52,514 INFO L134 CoverageAnalysis]: Checked inductivity of 13020 backedges. 5236 proven. 6834 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2018-11-07 05:13:52,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:13:52,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 138 [2018-11-07 05:13:52,534 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:13:52,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-11-07 05:13:52,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-11-07 05:13:52,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-11-07 05:13:52,535 INFO L87 Difference]: Start difference. First operand 291 states and 317 transitions. Second operand 70 states. [2018-11-07 05:13:52,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:13:52,868 INFO L93 Difference]: Finished difference Result 376 states and 428 transitions. [2018-11-07 05:13:52,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-11-07 05:13:52,869 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 290 [2018-11-07 05:13:52,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:13:52,871 INFO L225 Difference]: With dead ends: 376 [2018-11-07 05:13:52,871 INFO L226 Difference]: Without dead ends: 294 [2018-11-07 05:13:52,872 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 513 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-11-07 05:13:52,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-11-07 05:13:52,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2018-11-07 05:13:52,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-11-07 05:13:52,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 320 transitions. [2018-11-07 05:13:52,964 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 320 transitions. Word has length 290 [2018-11-07 05:13:52,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:13:52,964 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 320 transitions. [2018-11-07 05:13:52,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-11-07 05:13:52,964 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 320 transitions. [2018-11-07 05:13:52,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-11-07 05:13:52,965 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:13:52,965 INFO L375 BasicCegarLoop]: trace histogram [95, 94, 68, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:13:52,966 INFO L423 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:13:52,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:13:52,966 INFO L82 PathProgramCache]: Analyzing trace with hash -523195297, now seen corresponding path program 68 times [2018-11-07 05:13:52,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:13:52,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:13:52,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:13:52,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:13:52,967 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:13:52,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:13:54,694 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 5313 proven. 7038 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2018-11-07 05:13:54,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:13:54,694 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:13:54,694 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:13:54,695 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:13:54,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:13:54,695 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:13:54,703 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:13:54,703 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:13:54,767 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-11-07 05:13:54,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:13:54,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:13:55,902 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 0 proven. 6263 refuted. 0 times theorem prover too weak. 7038 trivial. 0 not checked. [2018-11-07 05:13:55,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:13:57,595 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 0 proven. 6263 refuted. 0 times theorem prover too weak. 7038 trivial. 0 not checked. [2018-11-07 05:13:57,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:13:57,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 32, 32] total 131 [2018-11-07 05:13:57,615 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:13:57,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-11-07 05:13:57,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-11-07 05:13:57,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4067, Invalid=12963, Unknown=0, NotChecked=0, Total=17030 [2018-11-07 05:13:57,616 INFO L87 Difference]: Start difference. First operand 294 states and 320 transitions. Second operand 101 states. Received shutdown request... [2018-11-07 05:14:00,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-11-07 05:14:00,499 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 05:14:00,504 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 05:14:00,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:14:00 BoogieIcfgContainer [2018-11-07 05:14:00,504 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 05:14:00,505 INFO L168 Benchmark]: Toolchain (without parser) took 234084.34 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 807.4 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -80.8 MB). Peak memory consumption was 726.6 MB. Max. memory is 7.1 GB. [2018-11-07 05:14:00,506 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 05:14:00,507 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 05:14:00,507 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 05:14:00,507 INFO L168 Benchmark]: Boogie Preprocessor took 20.76 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 05:14:00,507 INFO L168 Benchmark]: RCFGBuilder took 345.25 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 727.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -777.1 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-07 05:14:00,508 INFO L168 Benchmark]: TraceAbstraction took 233387.72 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 79.7 MB). Free memory was 2.2 GB in the beginning and 1.5 GB in the end (delta: 685.7 MB). Peak memory consumption was 765.4 MB. Max. memory is 7.1 GB. [2018-11-07 05:14:00,510 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 301.78 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 24.23 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 20.76 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 345.25 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 727.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -777.1 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 233387.72 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 79.7 MB). Free memory was 2.2 GB in the beginning and 1.5 GB in the end (delta: 685.7 MB). Peak memory consumption was 765.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 2]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 2). Cancelled while BasicCegarLoop was constructing difference of abstraction (294states) and FLOYD_HOARE automaton (currently 85 states, 101 states before enhancement),while ReachableStatesComputation was computing reachable states (290 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. TIMEOUT Result, 233.3s OverallTime, 71 OverallIterations, 95 TraceHistogramMax, 45.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 809 SDtfs, 1878 SDslu, 16588 SDs, 0 SdLazy, 9386 SolverSat, 2172 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.9s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 25054 GetRequests, 19328 SyntacticMatches, 0 SemanticMatches, 5726 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60487 ImplicationChecksByTransitivity, 195.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=294occurred in iteration=70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 0.3076923076923077 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 70 MinimizatonAttempts, 1249 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 177.2s InterpolantComputationTime, 21739 NumberOfCodeBlocks, 19786 NumberOfCodeBlocksAsserted, 657 NumberOfCheckSat, 32384 ConstructedInterpolants, 0 QuantifiedInterpolants, 16065261 SizeOfPredicates, 71 NumberOfNonLiveVariables, 17329 ConjunctsInSsa, 2159 ConjunctsInUnsatCore, 207 InterpolantComputations, 2 PerfectInterpolantSequences, 482608/968900 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown