java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono4_false-unreach-call1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 20:44:51,114 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 20:44:51,119 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 20:44:51,136 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 20:44:51,136 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 20:44:51,137 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 20:44:51,139 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 20:44:51,142 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 20:44:51,144 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 20:44:51,147 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 20:44:51,148 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 20:44:51,148 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 20:44:51,151 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 20:44:51,155 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 20:44:51,156 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 20:44:51,162 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 20:44:51,163 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 20:44:51,168 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 20:44:51,175 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 20:44:51,178 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 20:44:51,183 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 20:44:51,184 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 20:44:51,191 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 20:44:51,191 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 20:44:51,191 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 20:44:51,194 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 20:44:51,195 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 20:44:51,196 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 20:44:51,200 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 20:44:51,201 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 20:44:51,201 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 20:44:51,204 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 20:44:51,204 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 20:44:51,204 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 20:44:51,206 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 20:44:51,206 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 20:44:51,207 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 20:44:51,232 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 20:44:51,232 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 20:44:51,233 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 20:44:51,233 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 20:44:51,234 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 20:44:51,234 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 20:44:51,234 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 20:44:51,234 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 20:44:51,234 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 20:44:51,235 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 20:44:51,235 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 20:44:51,235 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 20:44:51,235 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 20:44:51,236 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 20:44:51,236 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 20:44:51,237 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 20:44:51,237 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 20:44:51,237 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 20:44:51,237 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 20:44:51,237 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 20:44:51,238 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 20:44:51,238 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 20:44:51,238 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 20:44:51,238 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 20:44:51,239 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 20:44:51,239 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:44:51,239 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 20:44:51,239 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 20:44:51,239 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 20:44:51,240 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 20:44:51,240 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 20:44:51,240 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 20:44:51,240 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 20:44:51,240 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 20:44:51,240 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 20:44:51,305 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 20:44:51,318 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 20:44:51,322 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 20:44:51,324 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 20:44:51,324 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 20:44:51,325 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-12 20:44:51,387 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b684e461e/39acf65dbe274924a1267c04eb5d06ea/FLAG18c222a4e [2018-11-12 20:44:51,828 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 20:44:51,829 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono4_false-unreach-call1.c [2018-11-12 20:44:51,835 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b684e461e/39acf65dbe274924a1267c04eb5d06ea/FLAG18c222a4e [2018-11-12 20:44:51,850 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b684e461e/39acf65dbe274924a1267c04eb5d06ea [2018-11-12 20:44:51,864 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 20:44:51,865 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 20:44:51,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 20:44:51,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 20:44:51,870 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 20:44:51,871 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:44:51" (1/1) ... [2018-11-12 20:44:51,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9b82a67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:51, skipping insertion in model container [2018-11-12 20:44:51,875 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:44:51" (1/1) ... [2018-11-12 20:44:51,886 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 20:44:51,915 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 20:44:52,155 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:44:52,160 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 20:44:52,178 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:44:52,196 INFO L193 MainTranslator]: Completed translation [2018-11-12 20:44:52,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:52 WrapperNode [2018-11-12 20:44:52,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 20:44:52,197 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 20:44:52,197 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 20:44:52,197 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 20:44:52,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:52" (1/1) ... [2018-11-12 20:44:52,210 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:52" (1/1) ... [2018-11-12 20:44:52,216 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 20:44:52,216 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 20:44:52,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 20:44:52,217 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 20:44:52,226 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:52" (1/1) ... [2018-11-12 20:44:52,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:52" (1/1) ... [2018-11-12 20:44:52,226 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:52" (1/1) ... [2018-11-12 20:44:52,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:52" (1/1) ... [2018-11-12 20:44:52,231 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:52" (1/1) ... [2018-11-12 20:44:52,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:52" (1/1) ... [2018-11-12 20:44:52,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:52" (1/1) ... [2018-11-12 20:44:52,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 20:44:52,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 20:44:52,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 20:44:52,240 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 20:44:52,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:44:52,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 20:44:52,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 20:44:52,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 20:44:52,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 20:44:52,376 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 20:44:52,377 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 20:44:52,377 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-12 20:44:52,377 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-12 20:44:52,576 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 20:44:52,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:44:52 BoogieIcfgContainer [2018-11-12 20:44:52,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 20:44:52,577 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 20:44:52,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 20:44:52,581 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 20:44:52,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:44:51" (1/3) ... [2018-11-12 20:44:52,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44296be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:44:52, skipping insertion in model container [2018-11-12 20:44:52,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:52" (2/3) ... [2018-11-12 20:44:52,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44296be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:44:52, skipping insertion in model container [2018-11-12 20:44:52,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:44:52" (3/3) ... [2018-11-12 20:44:52,585 INFO L112 eAbstractionObserver]: Analyzing ICFG Mono4_false-unreach-call1.c [2018-11-12 20:44:52,594 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 20:44:52,601 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 20:44:52,616 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 20:44:52,651 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 20:44:52,651 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 20:44:52,651 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 20:44:52,651 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 20:44:52,651 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 20:44:52,652 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 20:44:52,652 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 20:44:52,652 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 20:44:52,673 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-12 20:44:52,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-12 20:44:52,680 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:52,683 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:52,685 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:52,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:52,693 INFO L82 PathProgramCache]: Analyzing trace with hash -147882559, now seen corresponding path program 1 times [2018-11-12 20:44:52,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:52,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:52,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:52,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:52,739 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:52,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:52,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:44:52,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-12 20:44:52,799 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:44:52,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-12 20:44:52,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-12 20:44:52,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:44:52,819 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-12 20:44:52,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:52,841 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-12 20:44:52,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-12 20:44:52,843 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-12 20:44:52,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:52,852 INFO L225 Difference]: With dead ends: 32 [2018-11-12 20:44:52,852 INFO L226 Difference]: Without dead ends: 13 [2018-11-12 20:44:52,856 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-12 20:44:52,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-12 20:44:52,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-12 20:44:52,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-12 20:44:52,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-12 20:44:52,897 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-12 20:44:52,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:52,898 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-12 20:44:52,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-12 20:44:52,898 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-12 20:44:52,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-12 20:44:52,899 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:52,899 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:52,899 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:52,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:52,902 INFO L82 PathProgramCache]: Analyzing trace with hash -717461825, now seen corresponding path program 1 times [2018-11-12 20:44:52,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:52,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:52,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:52,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:52,906 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:53,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:53,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:44:53,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 20:44:53,022 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:44:53,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 20:44:53,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 20:44:53,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:44:53,029 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2018-11-12 20:44:53,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:53,230 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-12 20:44:53,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 20:44:53,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-12 20:44:53,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:53,234 INFO L225 Difference]: With dead ends: 24 [2018-11-12 20:44:53,235 INFO L226 Difference]: Without dead ends: 16 [2018-11-12 20:44:53,237 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:44:53,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-12 20:44:53,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-12 20:44:53,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-12 20:44:53,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-12 20:44:53,246 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2018-11-12 20:44:53,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:53,247 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-12 20:44:53,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 20:44:53,247 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-12 20:44:53,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-12 20:44:53,248 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:53,248 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:53,248 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:53,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:53,249 INFO L82 PathProgramCache]: Analyzing trace with hash 64649018, now seen corresponding path program 1 times [2018-11-12 20:44:53,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:53,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:53,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:53,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:53,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:53,317 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-12 20:44:53,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:53,321 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:53,322 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-11-12 20:44:53,324 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [27], [30], [32], [38], [39], [40], [42] [2018-11-12 20:44:53,355 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:44:53,355 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:44:53,534 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 20:44:53,535 INFO L272 AbstractInterpreter]: Visited 9 different actions 29 times. Merged at 3 different actions 15 times. Widened at 1 different actions 1 times. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2018-11-12 20:44:53,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:53,554 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 20:44:53,606 INFO L219 lantSequenceWeakener]: Could never weaken! [2018-11-12 20:44:53,606 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 20:44:53,636 INFO L415 sIntCurrentIteration]: We unified 13 AI predicates to 13 [2018-11-12 20:44:53,636 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 20:44:53,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 20:44:53,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-12 20:44:53,637 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:44:53,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 20:44:53,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 20:44:53,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:44:53,639 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 3 states. [2018-11-12 20:44:53,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:53,726 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-12 20:44:53,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 20:44:53,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-12 20:44:53,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:53,727 INFO L225 Difference]: With dead ends: 24 [2018-11-12 20:44:53,727 INFO L226 Difference]: Without dead ends: 19 [2018-11-12 20:44:53,727 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-12 20:44:53,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-12 20:44:53,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-12 20:44:53,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-12 20:44:53,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-12 20:44:53,732 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2018-11-12 20:44:53,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:53,733 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-12 20:44:53,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 20:44:53,733 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-12 20:44:53,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-12 20:44:53,734 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:53,734 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:53,734 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:53,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:53,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1506199393, now seen corresponding path program 1 times [2018-11-12 20:44:53,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:53,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:53,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:53,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:53,736 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:53,814 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-12 20:44:53,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:53,814 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:53,814 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2018-11-12 20:44:53,815 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [19], [27], [30], [32], [38], [39], [40], [42] [2018-11-12 20:44:53,816 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:44:53,816 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:44:53,902 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:44:53,902 INFO L272 AbstractInterpreter]: Visited 14 different actions 53 times. Merged at 5 different actions 22 times. Widened at 2 different actions 3 times. Performed 152 root evaluator evaluations with a maximum evaluation depth of 5. Performed 152 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 4 fixpoints after 2 different actions. Largest state had 2 variables. [2018-11-12 20:44:53,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:53,935 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:44:53,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:53,936 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:44:53,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:53,949 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:44:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:53,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:53,997 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-12 20:44:53,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:54,076 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-12 20:44:54,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:54,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-12 20:44:54,100 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:54,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 20:44:54,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 20:44:54,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:44:54,101 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 4 states. [2018-11-12 20:44:54,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:54,170 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-12 20:44:54,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 20:44:54,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-12 20:44:54,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:54,171 INFO L225 Difference]: With dead ends: 30 [2018-11-12 20:44:54,172 INFO L226 Difference]: Without dead ends: 22 [2018-11-12 20:44:54,172 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-12 20:44:54,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-12 20:44:54,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-12 20:44:54,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-12 20:44:54,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-12 20:44:54,178 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 17 [2018-11-12 20:44:54,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:54,178 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-12 20:44:54,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 20:44:54,178 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-12 20:44:54,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-12 20:44:54,179 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:54,179 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:54,180 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:54,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:54,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1748455324, now seen corresponding path program 2 times [2018-11-12 20:44:54,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:54,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:54,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:54,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:54,182 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:54,318 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-12 20:44:54,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:54,319 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:54,319 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:54,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:54,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:54,319 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:44:54,342 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:44:54,342 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:44:54,352 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-12 20:44:54,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:54,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:54,691 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-12 20:44:54,691 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:54,916 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-12 20:44:54,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:54,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2018-11-12 20:44:54,937 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:54,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 20:44:54,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 20:44:54,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-11-12 20:44:54,939 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 10 states. [2018-11-12 20:44:55,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:55,131 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2018-11-12 20:44:55,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-12 20:44:55,131 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-11-12 20:44:55,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:55,132 INFO L225 Difference]: With dead ends: 39 [2018-11-12 20:44:55,132 INFO L226 Difference]: Without dead ends: 28 [2018-11-12 20:44:55,134 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-12 20:44:55,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-12 20:44:55,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-12 20:44:55,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-12 20:44:55,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-12 20:44:55,141 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 20 [2018-11-12 20:44:55,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:55,141 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-12 20:44:55,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 20:44:55,141 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-12 20:44:55,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-12 20:44:55,142 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:55,143 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:55,143 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:55,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:55,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1522422854, now seen corresponding path program 3 times [2018-11-12 20:44:55,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:55,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:55,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:44:55,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:55,145 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:55,224 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-12 20:44:55,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:55,224 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:55,224 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:55,225 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:55,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:55,225 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:44:55,242 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:44:55,243 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:44:55,264 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:44:55,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:55,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:55,683 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-12 20:44:55,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:55,823 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-12 20:44:55,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:55,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2018-11-12 20:44:55,844 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:55,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 20:44:55,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 20:44:55,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-12 20:44:55,845 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 11 states. [2018-11-12 20:44:55,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:55,951 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2018-11-12 20:44:55,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-12 20:44:55,952 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-11-12 20:44:55,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:55,955 INFO L225 Difference]: With dead ends: 60 [2018-11-12 20:44:55,956 INFO L226 Difference]: Without dead ends: 49 [2018-11-12 20:44:55,956 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-12 20:44:55,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-12 20:44:55,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2018-11-12 20:44:55,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-12 20:44:55,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-12 20:44:55,965 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 26 [2018-11-12 20:44:55,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:55,965 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-12 20:44:55,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 20:44:55,965 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-12 20:44:55,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-12 20:44:55,967 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:55,967 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:55,967 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:55,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:55,967 INFO L82 PathProgramCache]: Analyzing trace with hash -702778436, now seen corresponding path program 4 times [2018-11-12 20:44:55,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:55,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:55,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:44:55,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:55,969 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:56,055 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-12 20:44:56,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:56,056 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:56,057 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:56,057 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:56,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:56,057 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:44:56,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:56,069 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:44:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:56,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:56,099 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-12 20:44:56,099 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:56,307 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-12 20:44:56,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:56,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-12 20:44:56,329 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:56,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 20:44:56,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 20:44:56,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-12 20:44:56,330 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 7 states. [2018-11-12 20:44:56,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:56,411 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2018-11-12 20:44:56,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:44:56,412 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-11-12 20:44:56,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:56,413 INFO L225 Difference]: With dead ends: 64 [2018-11-12 20:44:56,413 INFO L226 Difference]: Without dead ends: 42 [2018-11-12 20:44:56,414 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-12 20:44:56,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-12 20:44:56,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-12 20:44:56,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-12 20:44:56,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-12 20:44:56,421 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 38 [2018-11-12 20:44:56,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:56,421 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-12 20:44:56,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 20:44:56,422 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-12 20:44:56,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-12 20:44:56,423 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:56,423 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:56,423 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:56,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:56,424 INFO L82 PathProgramCache]: Analyzing trace with hash 966979169, now seen corresponding path program 5 times [2018-11-12 20:44:56,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:56,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:56,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:56,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:56,425 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:56,573 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-12 20:44:56,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:56,574 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:56,574 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:56,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:56,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:56,574 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:44:56,583 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:44:56,584 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:44:56,608 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-12 20:44:56,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:56,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:56,813 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-12 20:44:56,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:57,027 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-12 20:44:57,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:57,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 26 [2018-11-12 20:44:57,048 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:57,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-12 20:44:57,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-12 20:44:57,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2018-11-12 20:44:57,050 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 17 states. [2018-11-12 20:44:57,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:57,562 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2018-11-12 20:44:57,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 20:44:57,565 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2018-11-12 20:44:57,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:57,566 INFO L225 Difference]: With dead ends: 132 [2018-11-12 20:44:57,566 INFO L226 Difference]: Without dead ends: 107 [2018-11-12 20:44:57,568 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=266, Invalid=790, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 20:44:57,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-12 20:44:57,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 48. [2018-11-12 20:44:57,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-12 20:44:57,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-11-12 20:44:57,578 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 41 [2018-11-12 20:44:57,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:57,579 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-12 20:44:57,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-12 20:44:57,579 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-12 20:44:57,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-12 20:44:57,580 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:57,581 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:57,581 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:57,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:57,581 INFO L82 PathProgramCache]: Analyzing trace with hash 483382719, now seen corresponding path program 6 times [2018-11-12 20:44:57,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:57,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:57,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:44:57,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:57,583 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:57,708 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-12 20:44:57,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:57,708 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:57,708 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:57,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:57,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:57,709 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:44:57,718 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:44:57,718 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:44:57,735 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:44:57,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:57,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:57,749 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-12 20:44:57,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:57,901 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-12 20:44:57,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:57,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-11-12 20:44:57,923 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:57,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 20:44:57,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 20:44:57,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-12 20:44:57,925 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 9 states. [2018-11-12 20:44:57,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:57,966 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2018-11-12 20:44:57,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 20:44:57,968 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-11-12 20:44:57,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:57,969 INFO L225 Difference]: With dead ends: 73 [2018-11-12 20:44:57,969 INFO L226 Difference]: Without dead ends: 51 [2018-11-12 20:44:57,970 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-12 20:44:57,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-12 20:44:57,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-12 20:44:57,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-12 20:44:57,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-11-12 20:44:57,977 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 47 [2018-11-12 20:44:57,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:57,978 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-11-12 20:44:57,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 20:44:57,978 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-11-12 20:44:57,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-12 20:44:57,979 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:57,979 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:57,980 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:57,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:57,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1018657606, now seen corresponding path program 7 times [2018-11-12 20:44:57,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:57,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:57,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:44:57,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:57,982 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:58,117 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-12 20:44:58,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:58,118 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:58,118 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:58,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:58,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:58,119 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:44:58,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:58,129 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:44:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:58,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:58,163 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-12 20:44:58,164 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:58,348 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-12 20:44:58,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:58,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2018-11-12 20:44:58,369 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:58,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 20:44:58,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 20:44:58,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-12 20:44:58,370 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 10 states. [2018-11-12 20:44:58,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:58,442 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2018-11-12 20:44:58,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-12 20:44:58,443 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-11-12 20:44:58,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:58,444 INFO L225 Difference]: With dead ends: 76 [2018-11-12 20:44:58,444 INFO L226 Difference]: Without dead ends: 54 [2018-11-12 20:44:58,446 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-12 20:44:58,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-12 20:44:58,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-12 20:44:58,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-12 20:44:58,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-11-12 20:44:58,454 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 50 [2018-11-12 20:44:58,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:58,454 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-11-12 20:44:58,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 20:44:58,455 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-11-12 20:44:58,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-12 20:44:58,456 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:58,456 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:58,456 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:58,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:58,457 INFO L82 PathProgramCache]: Analyzing trace with hash 962277343, now seen corresponding path program 8 times [2018-11-12 20:44:58,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:58,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:58,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:58,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:58,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:58,578 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-12 20:44:58,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:58,579 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:58,579 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:58,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:58,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:58,579 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:44:58,591 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:44:58,591 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:44:58,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-12 20:44:58,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:58,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:58,865 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-12 20:44:58,865 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:59,278 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-12 20:44:59,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:59,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 31 [2018-11-12 20:44:59,302 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:59,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 20:44:59,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 20:44:59,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=733, Unknown=0, NotChecked=0, Total=930 [2018-11-12 20:44:59,304 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 21 states. [2018-11-12 20:44:59,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:59,628 INFO L93 Difference]: Finished difference Result 144 states and 177 transitions. [2018-11-12 20:44:59,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 20:44:59,628 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 53 [2018-11-12 20:44:59,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:59,630 INFO L225 Difference]: With dead ends: 144 [2018-11-12 20:44:59,630 INFO L226 Difference]: Without dead ends: 119 [2018-11-12 20:44:59,631 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=428, Invalid=1212, Unknown=0, NotChecked=0, Total=1640 [2018-11-12 20:44:59,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-12 20:44:59,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 60. [2018-11-12 20:44:59,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-12 20:44:59,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2018-11-12 20:44:59,643 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 53 [2018-11-12 20:44:59,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:59,644 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2018-11-12 20:44:59,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 20:44:59,644 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2018-11-12 20:44:59,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-12 20:44:59,645 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:59,645 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:59,645 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:59,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:59,646 INFO L82 PathProgramCache]: Analyzing trace with hash 396561409, now seen corresponding path program 9 times [2018-11-12 20:44:59,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:59,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:59,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:44:59,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:59,647 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:59,799 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-12 20:44:59,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:59,800 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:59,800 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:59,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:59,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:59,800 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:44:59,825 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:44:59,825 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:44:59,860 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:44:59,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:59,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:59,872 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-12 20:44:59,873 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:00,041 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-12 20:45:00,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:00,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-11-12 20:45:00,062 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:00,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 20:45:00,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 20:45:00,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-12 20:45:00,063 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand 12 states. [2018-11-12 20:45:00,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:00,206 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2018-11-12 20:45:00,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-12 20:45:00,206 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-11-12 20:45:00,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:00,207 INFO L225 Difference]: With dead ends: 88 [2018-11-12 20:45:00,207 INFO L226 Difference]: Without dead ends: 63 [2018-11-12 20:45:00,207 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-12 20:45:00,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-12 20:45:00,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-11-12 20:45:00,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-12 20:45:00,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2018-11-12 20:45:00,216 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 59 [2018-11-12 20:45:00,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:00,217 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2018-11-12 20:45:00,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 20:45:00,217 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-11-12 20:45:00,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-12 20:45:00,218 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:00,218 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 10, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:00,218 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:00,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:00,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1291969924, now seen corresponding path program 10 times [2018-11-12 20:45:00,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:00,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:00,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:45:00,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:00,220 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:00,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:00,377 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-12 20:45:00,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:00,378 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:00,378 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:00,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:00,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:00,378 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:45:00,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:45:00,388 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:45:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:00,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:00,432 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-12 20:45:00,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:00,788 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-12 20:45:00,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:00,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-11-12 20:45:00,809 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:00,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-12 20:45:00,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-12 20:45:00,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:45:00,810 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 13 states. [2018-11-12 20:45:00,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:00,979 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2018-11-12 20:45:00,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 20:45:00,980 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-11-12 20:45:00,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:00,981 INFO L225 Difference]: With dead ends: 91 [2018-11-12 20:45:00,982 INFO L226 Difference]: Without dead ends: 66 [2018-11-12 20:45:00,982 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:45:00,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-12 20:45:00,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-12 20:45:00,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-12 20:45:00,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-11-12 20:45:00,991 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 62 [2018-11-12 20:45:00,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:00,991 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-11-12 20:45:00,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-12 20:45:00,991 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-11-12 20:45:00,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-12 20:45:00,993 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:00,993 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 11, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:00,993 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:00,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:00,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1671940575, now seen corresponding path program 11 times [2018-11-12 20:45:00,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:00,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:00,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:45:00,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:00,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:01,358 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-12 20:45:01,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:01,358 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:01,358 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:01,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:01,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:01,359 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:45:01,368 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:45:01,368 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:45:01,393 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-12 20:45:01,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:45:01,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:01,754 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-12 20:45:01,754 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:02,042 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-12 20:45:02,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:02,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 36 [2018-11-12 20:45:02,064 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:02,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-12 20:45:02,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-12 20:45:02,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=993, Unknown=0, NotChecked=0, Total=1260 [2018-11-12 20:45:02,066 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 25 states. [2018-11-12 20:45:02,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:02,621 INFO L93 Difference]: Finished difference Result 159 states and 194 transitions. [2018-11-12 20:45:02,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-12 20:45:02,622 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 65 [2018-11-12 20:45:02,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:02,623 INFO L225 Difference]: With dead ends: 159 [2018-11-12 20:45:02,624 INFO L226 Difference]: Without dead ends: 131 [2018-11-12 20:45:02,625 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=633, Invalid=1719, Unknown=0, NotChecked=0, Total=2352 [2018-11-12 20:45:02,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-12 20:45:02,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 72. [2018-11-12 20:45:02,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-12 20:45:02,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2018-11-12 20:45:02,635 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 65 [2018-11-12 20:45:02,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:02,635 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2018-11-12 20:45:02,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-12 20:45:02,636 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2018-11-12 20:45:02,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-12 20:45:02,637 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:02,637 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 12, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:02,637 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:02,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:02,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1232033535, now seen corresponding path program 12 times [2018-11-12 20:45:02,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:02,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:02,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:45:02,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:02,639 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:02,911 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-12 20:45:02,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:02,911 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:02,911 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:02,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:02,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:02,912 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:45:02,923 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:45:02,923 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:45:02,955 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:45:02,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:45:02,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:02,968 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-12 20:45:02,969 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:03,426 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-12 20:45:03,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:03,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2018-11-12 20:45:03,447 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:03,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-12 20:45:03,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-12 20:45:03,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-12 20:45:03,448 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 15 states. [2018-11-12 20:45:03,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:03,513 INFO L93 Difference]: Finished difference Result 103 states and 119 transitions. [2018-11-12 20:45:03,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-12 20:45:03,514 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 71 [2018-11-12 20:45:03,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:03,515 INFO L225 Difference]: With dead ends: 103 [2018-11-12 20:45:03,516 INFO L226 Difference]: Without dead ends: 75 [2018-11-12 20:45:03,517 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-12 20:45:03,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-12 20:45:03,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-12 20:45:03,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-12 20:45:03,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2018-11-12 20:45:03,527 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 71 [2018-11-12 20:45:03,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:03,527 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2018-11-12 20:45:03,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-12 20:45:03,527 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2018-11-12 20:45:03,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-12 20:45:03,529 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:03,529 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:03,529 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:03,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:03,529 INFO L82 PathProgramCache]: Analyzing trace with hash 2006549754, now seen corresponding path program 13 times [2018-11-12 20:45:03,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:03,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:03,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:45:03,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:03,531 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:03,723 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-12 20:45:03,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:03,723 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:03,724 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:03,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:03,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:03,724 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:45:03,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:45:03,734 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:45:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:03,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:03,765 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-12 20:45:03,766 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:04,145 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-12 20:45:04,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:04,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2018-11-12 20:45:04,167 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:04,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-12 20:45:04,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-12 20:45:04,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-12 20:45:04,168 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 16 states. [2018-11-12 20:45:04,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:04,259 INFO L93 Difference]: Finished difference Result 106 states and 122 transitions. [2018-11-12 20:45:04,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-12 20:45:04,260 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 74 [2018-11-12 20:45:04,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:04,261 INFO L225 Difference]: With dead ends: 106 [2018-11-12 20:45:04,262 INFO L226 Difference]: Without dead ends: 78 [2018-11-12 20:45:04,262 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-12 20:45:04,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-12 20:45:04,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-12 20:45:04,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-12 20:45:04,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2018-11-12 20:45:04,271 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 74 [2018-11-12 20:45:04,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:04,272 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2018-11-12 20:45:04,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-12 20:45:04,272 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2018-11-12 20:45:04,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-12 20:45:04,273 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:04,273 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 14, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:04,273 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:04,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:04,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1240051425, now seen corresponding path program 14 times [2018-11-12 20:45:04,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:04,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:04,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:45:04,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:04,275 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:04,521 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-12 20:45:04,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:04,522 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:04,522 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:04,522 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:04,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:04,522 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:45:04,531 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:45:04,532 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:45:04,624 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-12 20:45:04,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:45:04,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:04,874 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-12 20:45:04,874 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:05,419 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-12 20:45:05,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:05,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 41 [2018-11-12 20:45:05,440 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:05,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-12 20:45:05,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-12 20:45:05,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=1290, Unknown=0, NotChecked=0, Total=1640 [2018-11-12 20:45:05,442 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 29 states. [2018-11-12 20:45:05,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:05,900 INFO L93 Difference]: Finished difference Result 174 states and 211 transitions. [2018-11-12 20:45:05,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-12 20:45:05,901 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 77 [2018-11-12 20:45:05,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:05,902 INFO L225 Difference]: With dead ends: 174 [2018-11-12 20:45:05,903 INFO L226 Difference]: Without dead ends: 143 [2018-11-12 20:45:05,904 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=881, Invalid=2311, Unknown=0, NotChecked=0, Total=3192 [2018-11-12 20:45:05,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-12 20:45:05,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 84. [2018-11-12 20:45:05,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-12 20:45:05,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2018-11-12 20:45:05,917 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 77 [2018-11-12 20:45:05,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:05,918 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2018-11-12 20:45:05,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-12 20:45:05,918 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2018-11-12 20:45:05,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-12 20:45:05,919 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:05,919 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 15, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:05,920 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:05,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:05,920 INFO L82 PathProgramCache]: Analyzing trace with hash 716358593, now seen corresponding path program 15 times [2018-11-12 20:45:05,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:05,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:05,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:45:05,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:05,921 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:06,264 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-12 20:45:06,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:06,265 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:06,265 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:06,265 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:06,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:06,265 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:45:06,274 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:45:06,274 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:45:06,295 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:45:06,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:45:06,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:06,307 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-12 20:45:06,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:07,240 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-12 20:45:07,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:07,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2018-11-12 20:45:07,261 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:07,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 20:45:07,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 20:45:07,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-12 20:45:07,262 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 18 states. [2018-11-12 20:45:07,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:07,449 INFO L93 Difference]: Finished difference Result 118 states and 136 transitions. [2018-11-12 20:45:07,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-12 20:45:07,449 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 83 [2018-11-12 20:45:07,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:07,450 INFO L225 Difference]: With dead ends: 118 [2018-11-12 20:45:07,450 INFO L226 Difference]: Without dead ends: 87 [2018-11-12 20:45:07,451 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-12 20:45:07,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-12 20:45:07,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-11-12 20:45:07,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-12 20:45:07,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2018-11-12 20:45:07,461 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 83 [2018-11-12 20:45:07,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:07,462 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2018-11-12 20:45:07,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 20:45:07,462 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2018-11-12 20:45:07,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-12 20:45:07,463 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:07,463 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 16, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:07,463 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:07,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:07,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1282986300, now seen corresponding path program 16 times [2018-11-12 20:45:07,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:07,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:07,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:45:07,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:07,465 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:07,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:07,854 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-12 20:45:07,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:07,855 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:07,855 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:07,855 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:07,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:07,855 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:45:07,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:45:07,864 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:45:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:07,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:07,907 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-12 20:45:07,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:08,274 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-12 20:45:08,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:08,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2018-11-12 20:45:08,295 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:08,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 20:45:08,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 20:45:08,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-12 20:45:08,296 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand 19 states. [2018-11-12 20:45:08,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:08,575 INFO L93 Difference]: Finished difference Result 121 states and 139 transitions. [2018-11-12 20:45:08,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-12 20:45:08,575 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 86 [2018-11-12 20:45:08,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:08,576 INFO L225 Difference]: With dead ends: 121 [2018-11-12 20:45:08,576 INFO L226 Difference]: Without dead ends: 90 [2018-11-12 20:45:08,577 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-12 20:45:08,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-12 20:45:08,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-11-12 20:45:08,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-12 20:45:08,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2018-11-12 20:45:08,589 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 86 [2018-11-12 20:45:08,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:08,589 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2018-11-12 20:45:08,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 20:45:08,590 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2018-11-12 20:45:08,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-12 20:45:08,590 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:08,591 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 17, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:08,591 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:08,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:08,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1827435039, now seen corresponding path program 17 times [2018-11-12 20:45:08,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:08,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:08,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:45:08,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:08,592 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:08,852 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-12 20:45:08,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:08,853 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:08,853 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:08,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:08,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:08,853 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:45:08,866 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:45:08,867 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:45:08,891 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-11-12 20:45:08,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:45:08,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:09,086 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-12 20:45:09,086 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:09,386 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-12 20:45:09,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:09,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 15] total 46 [2018-11-12 20:45:09,408 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:09,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-12 20:45:09,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-12 20:45:09,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=446, Invalid=1624, Unknown=0, NotChecked=0, Total=2070 [2018-11-12 20:45:09,410 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 33 states. [2018-11-12 20:45:09,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:09,980 INFO L93 Difference]: Finished difference Result 189 states and 228 transitions. [2018-11-12 20:45:09,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-12 20:45:09,980 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 89 [2018-11-12 20:45:09,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:09,983 INFO L225 Difference]: With dead ends: 189 [2018-11-12 20:45:09,983 INFO L226 Difference]: Without dead ends: 155 [2018-11-12 20:45:09,985 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1172, Invalid=2988, Unknown=0, NotChecked=0, Total=4160 [2018-11-12 20:45:09,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-12 20:45:10,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 96. [2018-11-12 20:45:10,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-12 20:45:10,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2018-11-12 20:45:10,002 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 89 [2018-11-12 20:45:10,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:10,002 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2018-11-12 20:45:10,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-12 20:45:10,002 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-11-12 20:45:10,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-12 20:45:10,003 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:10,003 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 18, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:10,004 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:10,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:10,004 INFO L82 PathProgramCache]: Analyzing trace with hash -180631489, now seen corresponding path program 18 times [2018-11-12 20:45:10,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:10,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:10,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:45:10,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:10,005 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:10,966 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-12 20:45:10,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:10,966 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:10,966 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:10,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:10,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:10,967 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:45:10,976 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:45:10,976 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:45:11,003 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:45:11,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:45:11,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:11,033 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-12 20:45:11,033 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:11,468 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-12 20:45:11,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:11,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2018-11-12 20:45:11,491 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:11,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 20:45:11,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 20:45:11,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-12 20:45:11,492 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 21 states. [2018-11-12 20:45:11,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:11,665 INFO L93 Difference]: Finished difference Result 133 states and 153 transitions. [2018-11-12 20:45:11,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 20:45:11,666 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 95 [2018-11-12 20:45:11,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:11,666 INFO L225 Difference]: With dead ends: 133 [2018-11-12 20:45:11,667 INFO L226 Difference]: Without dead ends: 99 [2018-11-12 20:45:11,667 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-12 20:45:11,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-12 20:45:11,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-11-12 20:45:11,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-12 20:45:11,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2018-11-12 20:45:11,679 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 95 [2018-11-12 20:45:11,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:11,680 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2018-11-12 20:45:11,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 20:45:11,680 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2018-11-12 20:45:11,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-12 20:45:11,680 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:11,681 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 19, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:11,681 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:11,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:11,681 INFO L82 PathProgramCache]: Analyzing trace with hash -565545670, now seen corresponding path program 19 times [2018-11-12 20:45:11,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:11,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:11,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:45:11,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:11,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:12,089 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-12 20:45:12,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:12,090 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:12,090 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:12,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:12,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:12,090 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:45:12,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:45:12,100 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:45:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:12,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:12,133 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-12 20:45:12,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:12,594 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-12 20:45:12,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:12,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2018-11-12 20:45:12,615 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:12,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-12 20:45:12,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-12 20:45:12,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-12 20:45:12,617 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 22 states. [2018-11-12 20:45:12,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:12,719 INFO L93 Difference]: Finished difference Result 136 states and 156 transitions. [2018-11-12 20:45:12,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-12 20:45:12,720 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 98 [2018-11-12 20:45:12,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:12,722 INFO L225 Difference]: With dead ends: 136 [2018-11-12 20:45:12,722 INFO L226 Difference]: Without dead ends: 102 [2018-11-12 20:45:12,723 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-12 20:45:12,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-12 20:45:12,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-11-12 20:45:12,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-12 20:45:12,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2018-11-12 20:45:12,734 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 98 [2018-11-12 20:45:12,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:12,735 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2018-11-12 20:45:12,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-12 20:45:12,735 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2018-11-12 20:45:12,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-12 20:45:12,736 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:12,736 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 20, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:12,736 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:12,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:12,736 INFO L82 PathProgramCache]: Analyzing trace with hash 18768479, now seen corresponding path program 20 times [2018-11-12 20:45:12,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:12,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:12,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:45:12,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:12,738 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:12,997 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-12 20:45:12,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:12,998 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:12,998 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:12,998 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:12,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:12,998 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:45:13,007 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:45:13,007 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:45:13,032 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-12 20:45:13,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:45:13,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:13,317 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-12 20:45:13,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:13,624 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-12 20:45:13,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:13,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 16, 16] total 51 [2018-11-12 20:45:13,646 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:13,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-12 20:45:13,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-12 20:45:13,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=555, Invalid=1995, Unknown=0, NotChecked=0, Total=2550 [2018-11-12 20:45:13,647 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 37 states. [2018-11-12 20:45:14,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:14,206 INFO L93 Difference]: Finished difference Result 204 states and 245 transitions. [2018-11-12 20:45:14,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-12 20:45:14,206 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 101 [2018-11-12 20:45:14,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:14,207 INFO L225 Difference]: With dead ends: 204 [2018-11-12 20:45:14,207 INFO L226 Difference]: Without dead ends: 167 [2018-11-12 20:45:14,209 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-12 20:45:14,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-12 20:45:14,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 108. [2018-11-12 20:45:14,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-12 20:45:14,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2018-11-12 20:45:14,223 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 101 [2018-11-12 20:45:14,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:14,223 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2018-11-12 20:45:14,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-12 20:45:14,223 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2018-11-12 20:45:14,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-12 20:45:14,224 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:14,224 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 21, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:14,224 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:14,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:14,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1597803393, now seen corresponding path program 21 times [2018-11-12 20:45:14,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:14,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:14,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:45:14,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:14,226 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:14,510 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-12 20:45:14,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:14,511 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:14,511 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:14,511 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:14,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:14,511 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:45:14,521 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:45:14,521 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:45:14,549 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:45:14,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:45:14,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:14,568 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-12 20:45:14,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:15,334 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-12 20:45:15,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:15,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 46 [2018-11-12 20:45:15,355 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:15,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-12 20:45:15,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-12 20:45:15,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-12 20:45:15,356 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand 24 states. [2018-11-12 20:45:15,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:15,459 INFO L93 Difference]: Finished difference Result 148 states and 170 transitions. [2018-11-12 20:45:15,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-12 20:45:15,460 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 107 [2018-11-12 20:45:15,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:15,461 INFO L225 Difference]: With dead ends: 148 [2018-11-12 20:45:15,461 INFO L226 Difference]: Without dead ends: 111 [2018-11-12 20:45:15,462 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-12 20:45:15,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-12 20:45:15,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-11-12 20:45:15,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-12 20:45:15,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2018-11-12 20:45:15,480 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 107 [2018-11-12 20:45:15,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:15,480 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2018-11-12 20:45:15,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-12 20:45:15,480 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2018-11-12 20:45:15,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-12 20:45:15,481 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:15,481 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 22, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:15,481 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:15,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:15,482 INFO L82 PathProgramCache]: Analyzing trace with hash 102799356, now seen corresponding path program 22 times [2018-11-12 20:45:15,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:15,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:15,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:45:15,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:15,483 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:15,771 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-12 20:45:15,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:15,771 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:15,772 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:15,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:15,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:15,772 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:45:15,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:45:15,781 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:45:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:15,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:15,834 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-12 20:45:15,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:16,510 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-12 20:45:16,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:16,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2018-11-12 20:45:16,530 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:16,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-12 20:45:16,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-12 20:45:16,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-12 20:45:16,532 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand 25 states. [2018-11-12 20:45:16,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:16,636 INFO L93 Difference]: Finished difference Result 151 states and 173 transitions. [2018-11-12 20:45:16,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-12 20:45:16,639 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 110 [2018-11-12 20:45:16,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:16,640 INFO L225 Difference]: With dead ends: 151 [2018-11-12 20:45:16,640 INFO L226 Difference]: Without dead ends: 114 [2018-11-12 20:45:16,642 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-12 20:45:16,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-12 20:45:16,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-11-12 20:45:16,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-12 20:45:16,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2018-11-12 20:45:16,658 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 110 [2018-11-12 20:45:16,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:16,659 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2018-11-12 20:45:16,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-12 20:45:16,659 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2018-11-12 20:45:16,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-12 20:45:16,659 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:16,660 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 23, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:16,660 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:16,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:16,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1248392609, now seen corresponding path program 23 times [2018-11-12 20:45:16,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:16,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:16,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:45:16,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:16,661 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:17,244 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-12 20:45:17,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:17,245 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:17,245 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:17,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:17,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:17,245 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:45:17,254 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:45:17,255 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:45:17,284 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-11-12 20:45:17,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:45:17,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:17,550 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-12 20:45:17,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:17,917 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-12 20:45:17,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:17,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 17, 17] total 56 [2018-11-12 20:45:17,938 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:17,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-12 20:45:17,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-12 20:45:17,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=677, Invalid=2403, Unknown=0, NotChecked=0, Total=3080 [2018-11-12 20:45:17,940 INFO L87 Difference]: Start difference. First operand 114 states and 125 transitions. Second operand 41 states. [2018-11-12 20:45:18,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:18,616 INFO L93 Difference]: Finished difference Result 219 states and 262 transitions. [2018-11-12 20:45:18,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-12 20:45:18,620 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 113 [2018-11-12 20:45:18,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:18,621 INFO L225 Difference]: With dead ends: 219 [2018-11-12 20:45:18,622 INFO L226 Difference]: Without dead ends: 179 [2018-11-12 20:45:18,624 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1883, Invalid=4597, Unknown=0, NotChecked=0, Total=6480 [2018-11-12 20:45:18,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-12 20:45:18,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 120. [2018-11-12 20:45:18,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-12 20:45:18,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2018-11-12 20:45:18,641 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 113 [2018-11-12 20:45:18,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:18,641 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2018-11-12 20:45:18,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-12 20:45:18,641 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2018-11-12 20:45:18,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-12 20:45:18,642 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:18,642 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 24, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:18,642 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:18,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:18,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1004459649, now seen corresponding path program 24 times [2018-11-12 20:45:18,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:18,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:18,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:45:18,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:18,644 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:19,023 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-12 20:45:19,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:19,024 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:19,024 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:19,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:19,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:19,024 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:45:19,035 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:45:19,036 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:45:19,069 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:45:19,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:45:19,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:19,097 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-12 20:45:19,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:19,931 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-12 20:45:19,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:19,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 52 [2018-11-12 20:45:19,954 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:19,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-12 20:45:19,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-12 20:45:19,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:45:19,955 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 27 states. [2018-11-12 20:45:20,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:20,068 INFO L93 Difference]: Finished difference Result 163 states and 187 transitions. [2018-11-12 20:45:20,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-12 20:45:20,069 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 119 [2018-11-12 20:45:20,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:20,069 INFO L225 Difference]: With dead ends: 163 [2018-11-12 20:45:20,070 INFO L226 Difference]: Without dead ends: 123 [2018-11-12 20:45:20,070 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:45:20,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-12 20:45:20,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-11-12 20:45:20,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-12 20:45:20,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 135 transitions. [2018-11-12 20:45:20,088 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 135 transitions. Word has length 119 [2018-11-12 20:45:20,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:20,088 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 135 transitions. [2018-11-12 20:45:20,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-12 20:45:20,088 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 135 transitions. [2018-11-12 20:45:20,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-12 20:45:20,089 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:20,089 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 25, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:20,090 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:20,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:20,090 INFO L82 PathProgramCache]: Analyzing trace with hash -230206086, now seen corresponding path program 25 times [2018-11-12 20:45:20,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:20,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:20,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:45:20,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:20,091 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:20,571 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-12 20:45:20,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:20,571 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:20,571 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:20,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:20,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:20,572 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:45:20,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:45:20,581 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:45:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:20,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:20,630 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-12 20:45:20,631 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:21,367 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-12 20:45:21,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:21,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 54 [2018-11-12 20:45:21,388 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:21,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-12 20:45:21,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-12 20:45:21,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-11-12 20:45:21,389 INFO L87 Difference]: Start difference. First operand 123 states and 135 transitions. Second operand 28 states. [2018-11-12 20:45:21,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:21,564 INFO L93 Difference]: Finished difference Result 166 states and 190 transitions. [2018-11-12 20:45:21,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-12 20:45:21,565 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 122 [2018-11-12 20:45:21,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:21,566 INFO L225 Difference]: With dead ends: 166 [2018-11-12 20:45:21,566 INFO L226 Difference]: Without dead ends: 126 [2018-11-12 20:45:21,566 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-11-12 20:45:21,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-12 20:45:21,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-11-12 20:45:21,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-12 20:45:21,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2018-11-12 20:45:21,580 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 122 [2018-11-12 20:45:21,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:21,581 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2018-11-12 20:45:21,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-12 20:45:21,581 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2018-11-12 20:45:21,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-12 20:45:21,581 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:21,582 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 26, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:21,582 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:21,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:21,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1583309727, now seen corresponding path program 26 times [2018-11-12 20:45:21,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:21,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:21,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:45:21,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:21,583 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:22,318 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-12 20:45:22,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:22,318 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:22,319 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:22,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:22,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:22,319 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:45:22,328 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:45:22,328 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:45:22,358 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-12 20:45:22,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:45:22,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:23,904 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-12 20:45:23,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:24,331 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-12 20:45:24,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:24,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 18, 18] total 61 [2018-11-12 20:45:24,353 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:24,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-12 20:45:24,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-12 20:45:24,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=812, Invalid=2848, Unknown=0, NotChecked=0, Total=3660 [2018-11-12 20:45:24,355 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand 45 states. [2018-11-12 20:45:25,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:25,277 INFO L93 Difference]: Finished difference Result 234 states and 279 transitions. [2018-11-12 20:45:25,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-12 20:45:25,277 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 125 [2018-11-12 20:45:25,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:25,278 INFO L225 Difference]: With dead ends: 234 [2018-11-12 20:45:25,279 INFO L226 Difference]: Without dead ends: 191 [2018-11-12 20:45:25,279 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1355 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2303, Invalid=5529, Unknown=0, NotChecked=0, Total=7832 [2018-11-12 20:45:25,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-11-12 20:45:25,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 132. [2018-11-12 20:45:25,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-12 20:45:25,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 145 transitions. [2018-11-12 20:45:25,308 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 145 transitions. Word has length 125 [2018-11-12 20:45:25,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:25,308 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 145 transitions. [2018-11-12 20:45:25,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-12 20:45:25,308 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 145 transitions. [2018-11-12 20:45:25,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-12 20:45:25,309 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:25,309 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 27, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:25,310 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:25,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:25,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1658086209, now seen corresponding path program 27 times [2018-11-12 20:45:25,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:25,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:25,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:45:25,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:25,311 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:26,906 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-12 20:45:26,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:26,906 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:26,907 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:26,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:26,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:26,907 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:45:26,918 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:45:26,919 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:45:26,954 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:45:26,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:45:26,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:26,974 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-12 20:45:26,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:28,215 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-12 20:45:28,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:28,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 58 [2018-11-12 20:45:28,236 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:28,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-12 20:45:28,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-12 20:45:28,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-11-12 20:45:28,238 INFO L87 Difference]: Start difference. First operand 132 states and 145 transitions. Second operand 30 states. [2018-11-12 20:45:28,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:28,455 INFO L93 Difference]: Finished difference Result 178 states and 204 transitions. [2018-11-12 20:45:28,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-12 20:45:28,455 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 131 [2018-11-12 20:45:28,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:28,456 INFO L225 Difference]: With dead ends: 178 [2018-11-12 20:45:28,456 INFO L226 Difference]: Without dead ends: 135 [2018-11-12 20:45:28,457 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-11-12 20:45:28,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-12 20:45:28,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-11-12 20:45:28,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-12 20:45:28,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 148 transitions. [2018-11-12 20:45:28,475 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 148 transitions. Word has length 131 [2018-11-12 20:45:28,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:28,475 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 148 transitions. [2018-11-12 20:45:28,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-12 20:45:28,476 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 148 transitions. [2018-11-12 20:45:28,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-12 20:45:28,476 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:28,477 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 28, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:28,477 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:28,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:28,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1686728380, now seen corresponding path program 28 times [2018-11-12 20:45:28,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:28,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:28,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:45:28,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:28,478 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:29,146 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-12 20:45:29,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:29,147 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:29,147 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:29,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:29,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:29,147 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:45:29,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:45:29,162 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:45:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:29,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:29,215 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-12 20:45:29,216 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:30,161 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-12 20:45:30,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:30,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 60 [2018-11-12 20:45:30,182 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:30,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-12 20:45:30,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-12 20:45:30,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-11-12 20:45:30,184 INFO L87 Difference]: Start difference. First operand 135 states and 148 transitions. Second operand 31 states. [2018-11-12 20:45:30,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:30,318 INFO L93 Difference]: Finished difference Result 181 states and 207 transitions. [2018-11-12 20:45:30,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-12 20:45:30,319 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 134 [2018-11-12 20:45:30,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:30,321 INFO L225 Difference]: With dead ends: 181 [2018-11-12 20:45:30,321 INFO L226 Difference]: Without dead ends: 138 [2018-11-12 20:45:30,322 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-12 20:45:30,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-12 20:45:30,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-11-12 20:45:30,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-12 20:45:30,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 151 transitions. [2018-11-12 20:45:30,346 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 151 transitions. Word has length 134 [2018-11-12 20:45:30,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:30,347 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 151 transitions. [2018-11-12 20:45:30,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-12 20:45:30,347 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 151 transitions. [2018-11-12 20:45:30,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-12 20:45:30,347 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:30,348 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 29, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:30,348 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:30,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:30,348 INFO L82 PathProgramCache]: Analyzing trace with hash 267152737, now seen corresponding path program 29 times [2018-11-12 20:45:30,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:30,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:30,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:45:30,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:30,350 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:30,888 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-12 20:45:30,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:30,888 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:30,888 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:30,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:30,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:30,889 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:45:30,909 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:45:30,910 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:45:30,946 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-11-12 20:45:30,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:45:30,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:31,282 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-12 20:45:31,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:31,840 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-12 20:45:31,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:31,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 19, 19] total 66 [2018-11-12 20:45:31,862 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:31,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-12 20:45:31,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-12 20:45:31,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=3330, Unknown=0, NotChecked=0, Total=4290 [2018-11-12 20:45:31,864 INFO L87 Difference]: Start difference. First operand 138 states and 151 transitions. Second operand 49 states. [2018-11-12 20:45:33,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:33,024 INFO L93 Difference]: Finished difference Result 249 states and 296 transitions. [2018-11-12 20:45:33,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-12 20:45:33,024 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 137 [2018-11-12 20:45:33,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:33,026 INFO L225 Difference]: With dead ends: 249 [2018-11-12 20:45:33,026 INFO L226 Difference]: Without dead ends: 203 [2018-11-12 20:45:33,028 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1607 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2766, Invalid=6546, Unknown=0, NotChecked=0, Total=9312 [2018-11-12 20:45:33,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-11-12 20:45:33,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 144. [2018-11-12 20:45:33,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-12 20:45:33,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 158 transitions. [2018-11-12 20:45:33,057 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 158 transitions. Word has length 137 [2018-11-12 20:45:33,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:33,057 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 158 transitions. [2018-11-12 20:45:33,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-12 20:45:33,057 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 158 transitions. [2018-11-12 20:45:33,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-12 20:45:33,058 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:33,058 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 30, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:33,059 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:33,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:33,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1727300929, now seen corresponding path program 30 times [2018-11-12 20:45:33,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:33,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:33,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:45:33,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:33,060 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:33,730 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-12 20:45:33,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:33,731 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:33,731 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:33,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:33,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:33,731 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:45:33,749 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:45:33,749 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:45:33,805 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:45:33,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:45:33,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:33,834 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-12 20:45:33,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:34,939 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-12 20:45:34,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:34,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 64 [2018-11-12 20:45:34,960 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:34,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-12 20:45:34,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-12 20:45:34,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-11-12 20:45:34,962 INFO L87 Difference]: Start difference. First operand 144 states and 158 transitions. Second operand 33 states. [2018-11-12 20:45:35,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:35,116 INFO L93 Difference]: Finished difference Result 193 states and 221 transitions. [2018-11-12 20:45:35,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-12 20:45:35,116 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 143 [2018-11-12 20:45:35,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:35,118 INFO L225 Difference]: With dead ends: 193 [2018-11-12 20:45:35,118 INFO L226 Difference]: Without dead ends: 147 [2018-11-12 20:45:35,120 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-11-12 20:45:35,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-12 20:45:35,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-11-12 20:45:35,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-12 20:45:35,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2018-11-12 20:45:35,150 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 143 [2018-11-12 20:45:35,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:35,151 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2018-11-12 20:45:35,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-12 20:45:35,151 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2018-11-12 20:45:35,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-12 20:45:35,152 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:35,152 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 31, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:35,152 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:35,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:35,153 INFO L82 PathProgramCache]: Analyzing trace with hash -310630982, now seen corresponding path program 31 times [2018-11-12 20:45:35,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:35,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:35,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:45:35,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:35,154 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:36,407 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-12 20:45:36,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:36,408 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:36,408 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:36,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:36,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:36,408 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:45:36,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:45:36,425 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:45:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:36,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:36,495 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-12 20:45:36,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:37,912 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-12 20:45:37,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:37,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 66 [2018-11-12 20:45:37,942 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:37,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-12 20:45:37,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-12 20:45:37,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-11-12 20:45:37,946 INFO L87 Difference]: Start difference. First operand 147 states and 161 transitions. Second operand 34 states. [2018-11-12 20:45:38,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:38,140 INFO L93 Difference]: Finished difference Result 196 states and 224 transitions. [2018-11-12 20:45:38,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-12 20:45:38,141 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 146 [2018-11-12 20:45:38,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:38,142 INFO L225 Difference]: With dead ends: 196 [2018-11-12 20:45:38,142 INFO L226 Difference]: Without dead ends: 150 [2018-11-12 20:45:38,143 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-11-12 20:45:38,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-12 20:45:38,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-11-12 20:45:38,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-12 20:45:38,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 164 transitions. [2018-11-12 20:45:38,174 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 164 transitions. Word has length 146 [2018-11-12 20:45:38,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:38,174 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 164 transitions. [2018-11-12 20:45:38,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-12 20:45:38,174 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 164 transitions. [2018-11-12 20:45:38,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-12 20:45:38,175 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:38,176 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 32, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:38,176 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:38,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:38,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1355109599, now seen corresponding path program 32 times [2018-11-12 20:45:38,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:38,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:38,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:45:38,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:38,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:39,676 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-12 20:45:39,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:39,676 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:39,677 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:39,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:39,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:39,677 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:45:39,686 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:45:39,686 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:45:39,721 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-12 20:45:39,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:45:39,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:40,175 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-12 20:45:40,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:40,805 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-12 20:45:40,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:40,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 20, 20] total 71 [2018-11-12 20:45:40,842 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:40,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-12 20:45:40,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-12 20:45:40,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1121, Invalid=3849, Unknown=0, NotChecked=0, Total=4970 [2018-11-12 20:45:40,844 INFO L87 Difference]: Start difference. First operand 150 states and 164 transitions. Second operand 53 states. [2018-11-12 20:45:42,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:42,116 INFO L93 Difference]: Finished difference Result 264 states and 313 transitions. [2018-11-12 20:45:42,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-12 20:45:42,123 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 149 [2018-11-12 20:45:42,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:42,124 INFO L225 Difference]: With dead ends: 264 [2018-11-12 20:45:42,125 INFO L226 Difference]: Without dead ends: 215 [2018-11-12 20:45:42,126 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1880 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3272, Invalid=7648, Unknown=0, NotChecked=0, Total=10920 [2018-11-12 20:45:42,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-11-12 20:45:42,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 156. [2018-11-12 20:45:42,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-12 20:45:42,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 171 transitions. [2018-11-12 20:45:42,189 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 171 transitions. Word has length 149 [2018-11-12 20:45:42,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:42,189 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 171 transitions. [2018-11-12 20:45:42,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-12 20:45:42,189 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 171 transitions. [2018-11-12 20:45:42,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-12 20:45:42,190 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:42,190 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 33, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:42,190 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:42,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:42,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1141787393, now seen corresponding path program 33 times [2018-11-12 20:45:42,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:42,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:42,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:45:42,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:42,194 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:43,013 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-12 20:45:43,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:43,013 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:43,013 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:43,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:43,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:43,013 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:45:43,022 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:45:43,022 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:45:43,083 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:45:43,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:45:43,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:43,118 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-12 20:45:43,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:44,451 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-12 20:45:44,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:44,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 70 [2018-11-12 20:45:44,471 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:44,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-12 20:45:44,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-12 20:45:44,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-11-12 20:45:44,473 INFO L87 Difference]: Start difference. First operand 156 states and 171 transitions. Second operand 36 states. [2018-11-12 20:45:44,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:44,628 INFO L93 Difference]: Finished difference Result 208 states and 238 transitions. [2018-11-12 20:45:44,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-12 20:45:44,629 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 155 [2018-11-12 20:45:44,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:44,630 INFO L225 Difference]: With dead ends: 208 [2018-11-12 20:45:44,630 INFO L226 Difference]: Without dead ends: 159 [2018-11-12 20:45:44,631 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-11-12 20:45:44,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-12 20:45:44,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-11-12 20:45:44,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-12 20:45:44,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 174 transitions. [2018-11-12 20:45:44,656 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 174 transitions. Word has length 155 [2018-11-12 20:45:44,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:44,656 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 174 transitions. [2018-11-12 20:45:44,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-12 20:45:44,657 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 174 transitions. [2018-11-12 20:45:44,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-12 20:45:44,657 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:44,657 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 34, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:44,658 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:44,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:44,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1296520572, now seen corresponding path program 34 times [2018-11-12 20:45:44,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:44,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:44,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:45:44,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:44,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:45,277 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-12 20:45:45,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:45,277 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:45,278 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:45,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:45,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:45,278 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:45:45,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:45:45,286 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:45:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:45,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:45,348 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-12 20:45:45,349 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:46,687 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-12 20:45:46,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:46,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 72 [2018-11-12 20:45:46,710 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:46,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-12 20:45:46,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-12 20:45:46,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-11-12 20:45:46,711 INFO L87 Difference]: Start difference. First operand 159 states and 174 transitions. Second operand 37 states. [2018-11-12 20:45:46,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:46,897 INFO L93 Difference]: Finished difference Result 211 states and 241 transitions. [2018-11-12 20:45:46,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-12 20:45:46,898 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 158 [2018-11-12 20:45:46,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:46,899 INFO L225 Difference]: With dead ends: 211 [2018-11-12 20:45:46,899 INFO L226 Difference]: Without dead ends: 162 [2018-11-12 20:45:46,900 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-11-12 20:45:46,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-12 20:45:46,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-11-12 20:45:46,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-12 20:45:46,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 177 transitions. [2018-11-12 20:45:46,927 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 177 transitions. Word has length 158 [2018-11-12 20:45:46,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:46,927 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 177 transitions. [2018-11-12 20:45:46,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-12 20:45:46,927 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 177 transitions. [2018-11-12 20:45:46,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-12 20:45:46,928 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:46,928 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 35, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:46,929 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:46,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:46,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1842219743, now seen corresponding path program 35 times [2018-11-12 20:45:46,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:46,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:46,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:45:46,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:46,930 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:48,222 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-12 20:45:48,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:48,222 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:48,223 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:48,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:48,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:48,223 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:45:48,232 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:45:48,232 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:45:48,280 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-11-12 20:45:48,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:45:48,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:48,846 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-12 20:45:48,846 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:49,457 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-12 20:45:49,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:49,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 21, 21] total 76 [2018-11-12 20:45:49,478 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:49,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-11-12 20:45:49,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-12 20:45:49,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=4405, Unknown=0, NotChecked=0, Total=5700 [2018-11-12 20:45:49,479 INFO L87 Difference]: Start difference. First operand 162 states and 177 transitions. Second operand 57 states. [2018-11-12 20:45:50,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:50,852 INFO L93 Difference]: Finished difference Result 279 states and 330 transitions. [2018-11-12 20:45:50,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-11-12 20:45:50,852 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 161 [2018-11-12 20:45:50,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:50,853 INFO L225 Difference]: With dead ends: 279 [2018-11-12 20:45:50,853 INFO L226 Difference]: Without dead ends: 227 [2018-11-12 20:45:50,855 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-12 20:45:50,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-11-12 20:45:50,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 168. [2018-11-12 20:45:50,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-12 20:45:50,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 184 transitions. [2018-11-12 20:45:50,894 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 184 transitions. Word has length 161 [2018-11-12 20:45:50,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:50,894 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 184 transitions. [2018-11-12 20:45:50,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-11-12 20:45:50,894 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 184 transitions. [2018-11-12 20:45:50,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-12 20:45:50,895 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:50,895 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 36, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:50,896 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:50,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:50,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1441184767, now seen corresponding path program 36 times [2018-11-12 20:45:50,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:50,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:50,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:45:50,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:50,897 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:50,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:51,582 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-12 20:45:51,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:51,583 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:51,583 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:51,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:51,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:51,583 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:45:51,594 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:45:51,594 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:45:51,633 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:45:51,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:45:51,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:51,694 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-12 20:45:51,694 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:54,388 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-12 20:45:54,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:54,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 76 [2018-11-12 20:45:54,409 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:54,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-12 20:45:54,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-12 20:45:54,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-11-12 20:45:54,411 INFO L87 Difference]: Start difference. First operand 168 states and 184 transitions. Second operand 39 states. [2018-11-12 20:45:54,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:54,583 INFO L93 Difference]: Finished difference Result 223 states and 255 transitions. [2018-11-12 20:45:54,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-12 20:45:54,584 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 167 [2018-11-12 20:45:54,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:54,585 INFO L225 Difference]: With dead ends: 223 [2018-11-12 20:45:54,586 INFO L226 Difference]: Without dead ends: 171 [2018-11-12 20:45:54,587 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-11-12 20:45:54,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-11-12 20:45:54,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-11-12 20:45:54,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-12 20:45:54,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 187 transitions. [2018-11-12 20:45:54,617 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 187 transitions. Word has length 167 [2018-11-12 20:45:54,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:54,617 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 187 transitions. [2018-11-12 20:45:54,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-12 20:45:54,617 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 187 transitions. [2018-11-12 20:45:54,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-12 20:45:54,618 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:54,618 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 37, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:54,618 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:54,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:54,618 INFO L82 PathProgramCache]: Analyzing trace with hash 148170234, now seen corresponding path program 37 times [2018-11-12 20:45:54,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:54,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:54,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:45:54,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:54,619 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:55,975 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-12 20:45:55,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:55,975 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:55,975 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:55,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:55,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:55,976 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:45:55,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:45:55,989 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:45:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:56,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:56,062 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-12 20:45:56,062 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:57,658 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-12 20:45:57,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:57,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 78 [2018-11-12 20:45:57,679 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:57,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-12 20:45:57,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-12 20:45:57,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-11-12 20:45:57,680 INFO L87 Difference]: Start difference. First operand 171 states and 187 transitions. Second operand 40 states. [2018-11-12 20:45:57,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:57,908 INFO L93 Difference]: Finished difference Result 226 states and 258 transitions. [2018-11-12 20:45:57,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-12 20:45:57,909 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 170 [2018-11-12 20:45:57,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:57,910 INFO L225 Difference]: With dead ends: 226 [2018-11-12 20:45:57,910 INFO L226 Difference]: Without dead ends: 174 [2018-11-12 20:45:57,910 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-11-12 20:45:57,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-12 20:45:57,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-11-12 20:45:57,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-12 20:45:57,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 190 transitions. [2018-11-12 20:45:57,940 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 190 transitions. Word has length 170 [2018-11-12 20:45:57,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:57,940 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 190 transitions. [2018-11-12 20:45:57,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-12 20:45:57,940 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 190 transitions. [2018-11-12 20:45:57,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-12 20:45:57,941 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:57,941 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 38, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:57,941 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:57,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:57,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1513895455, now seen corresponding path program 38 times [2018-11-12 20:45:57,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:57,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:57,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:45:57,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:57,942 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:58,877 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-12 20:45:58,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:58,878 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:58,878 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:58,878 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:58,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:58,878 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:45:58,887 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:45:58,887 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:45:58,927 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-11-12 20:45:58,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:45:58,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:59,398 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-12 20:45:59,398 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:46:00,193 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-12 20:46:00,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:46:00,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 22, 22] total 81 [2018-11-12 20:46:00,215 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:46:00,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-11-12 20:46:00,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-11-12 20:46:00,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1482, Invalid=4998, Unknown=0, NotChecked=0, Total=6480 [2018-11-12 20:46:00,216 INFO L87 Difference]: Start difference. First operand 174 states and 190 transitions. Second operand 61 states. [2018-11-12 20:46:01,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:46:01,588 INFO L93 Difference]: Finished difference Result 294 states and 347 transitions. [2018-11-12 20:46:01,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-11-12 20:46:01,589 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 173 [2018-11-12 20:46:01,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:46:01,591 INFO L225 Difference]: With dead ends: 294 [2018-11-12 20:46:01,591 INFO L226 Difference]: Without dead ends: 239 [2018-11-12 20:46:01,592 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2489 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4413, Invalid=10107, Unknown=0, NotChecked=0, Total=14520 [2018-11-12 20:46:01,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-11-12 20:46:01,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 180. [2018-11-12 20:46:01,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-11-12 20:46:01,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 197 transitions. [2018-11-12 20:46:01,638 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 197 transitions. Word has length 173 [2018-11-12 20:46:01,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:46:01,638 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 197 transitions. [2018-11-12 20:46:01,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-11-12 20:46:01,639 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 197 transitions. [2018-11-12 20:46:01,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-12 20:46:01,639 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:46:01,640 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 39, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:46:01,640 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:46:01,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:46:01,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1300348223, now seen corresponding path program 39 times [2018-11-12 20:46:01,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:46:01,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:01,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:46:01,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:01,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:46:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:02,336 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-12 20:46:02,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:02,336 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:46:02,336 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:46:02,336 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:46:02,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:02,337 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:46:02,346 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:46:02,346 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:46:02,393 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:46:02,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:46:02,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:46:02,445 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-12 20:46:02,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:46:04,398 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-12 20:46:04,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:46:04,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 82 [2018-11-12 20:46:04,420 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:46:04,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-12 20:46:04,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-12 20:46:04,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-11-12 20:46:04,422 INFO L87 Difference]: Start difference. First operand 180 states and 197 transitions. Second operand 42 states. [2018-11-12 20:46:04,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:46:04,659 INFO L93 Difference]: Finished difference Result 238 states and 272 transitions. [2018-11-12 20:46:04,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-12 20:46:04,659 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 179 [2018-11-12 20:46:04,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:46:04,660 INFO L225 Difference]: With dead ends: 238 [2018-11-12 20:46:04,660 INFO L226 Difference]: Without dead ends: 183 [2018-11-12 20:46:04,661 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-12 20:46:04,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-12 20:46:04,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-11-12 20:46:04,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-11-12 20:46:04,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 200 transitions. [2018-11-12 20:46:04,706 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 200 transitions. Word has length 179 [2018-11-12 20:46:04,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:46:04,706 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 200 transitions. [2018-11-12 20:46:04,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-12 20:46:04,706 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 200 transitions. [2018-11-12 20:46:04,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-12 20:46:04,707 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:46:04,707 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 40, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:46:04,708 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:46:04,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:46:04,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1190022204, now seen corresponding path program 40 times [2018-11-12 20:46:04,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:46:04,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:04,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:46:04,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:04,709 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:46:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:05,476 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-12 20:46:05,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:05,476 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:46:05,476 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:46:05,476 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:46:05,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:05,477 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:46:05,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:46:05,486 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:46:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:05,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:46:05,565 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-12 20:46:05,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:46:07,627 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-12 20:46:07,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:46:07,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 84 [2018-11-12 20:46:07,649 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:46:07,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-12 20:46:07,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-12 20:46:07,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-11-12 20:46:07,650 INFO L87 Difference]: Start difference. First operand 183 states and 200 transitions. Second operand 43 states. [2018-11-12 20:46:07,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:46:07,902 INFO L93 Difference]: Finished difference Result 241 states and 275 transitions. [2018-11-12 20:46:07,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-12 20:46:07,903 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 182 [2018-11-12 20:46:07,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:46:07,904 INFO L225 Difference]: With dead ends: 241 [2018-11-12 20:46:07,905 INFO L226 Difference]: Without dead ends: 186 [2018-11-12 20:46:07,906 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-11-12 20:46:07,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-12 20:46:07,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-11-12 20:46:07,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-11-12 20:46:07,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 203 transitions. [2018-11-12 20:46:07,953 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 203 transitions. Word has length 182 [2018-11-12 20:46:07,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:46:07,953 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 203 transitions. [2018-11-12 20:46:07,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-12 20:46:07,953 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 203 transitions. [2018-11-12 20:46:07,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-12 20:46:07,954 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:46:07,954 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 41, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:46:07,955 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:46:07,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:46:07,955 INFO L82 PathProgramCache]: Analyzing trace with hash 550341857, now seen corresponding path program 41 times [2018-11-12 20:46:07,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:46:07,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:07,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:46:07,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:07,956 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:46:07,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:10,570 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-12 20:46:10,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:10,570 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:46:10,571 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:46:10,571 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:46:10,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:10,571 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:46:10,580 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:46:10,580 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:46:10,624 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-11-12 20:46:10,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:46:10,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:46:11,203 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-12 20:46:11,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:46:11,965 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-12 20:46:11,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:46:11,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 23, 23] total 86 [2018-11-12 20:46:11,987 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:46:11,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-11-12 20:46:11,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-11-12 20:46:11,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1682, Invalid=5628, Unknown=0, NotChecked=0, Total=7310 [2018-11-12 20:46:11,989 INFO L87 Difference]: Start difference. First operand 186 states and 203 transitions. Second operand 65 states. [2018-11-12 20:46:13,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:46:13,537 INFO L93 Difference]: Finished difference Result 309 states and 364 transitions. [2018-11-12 20:46:13,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-11-12 20:46:13,537 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 185 [2018-11-12 20:46:13,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:46:13,539 INFO L225 Difference]: With dead ends: 309 [2018-11-12 20:46:13,539 INFO L226 Difference]: Without dead ends: 251 [2018-11-12 20:46:13,540 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2825 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5048, Invalid=11464, Unknown=0, NotChecked=0, Total=16512 [2018-11-12 20:46:13,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-11-12 20:46:13,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 192. [2018-11-12 20:46:13,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-11-12 20:46:13,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 210 transitions. [2018-11-12 20:46:13,590 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 210 transitions. Word has length 185 [2018-11-12 20:46:13,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:46:13,591 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 210 transitions. [2018-11-12 20:46:13,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-11-12 20:46:13,591 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 210 transitions. [2018-11-12 20:46:13,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-12 20:46:13,592 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:46:13,592 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 42, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:46:13,593 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:46:13,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:46:13,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1684083393, now seen corresponding path program 42 times [2018-11-12 20:46:13,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:46:13,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:13,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:46:13,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:13,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:46:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:14,585 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-12 20:46:14,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:14,585 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:46:14,585 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:46:14,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:46:14,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:14,586 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:46:14,594 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:46:14,594 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:46:14,638 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:46:14,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:46:14,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:46:14,670 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-12 20:46:14,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:46:16,586 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-12 20:46:16,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:46:16,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 88 [2018-11-12 20:46:16,607 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:46:16,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-12 20:46:16,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-12 20:46:16,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-11-12 20:46:16,608 INFO L87 Difference]: Start difference. First operand 192 states and 210 transitions. Second operand 45 states. [2018-11-12 20:46:16,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:46:16,832 INFO L93 Difference]: Finished difference Result 253 states and 289 transitions. [2018-11-12 20:46:16,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-12 20:46:16,832 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 191 [2018-11-12 20:46:16,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:46:16,834 INFO L225 Difference]: With dead ends: 253 [2018-11-12 20:46:16,834 INFO L226 Difference]: Without dead ends: 195 [2018-11-12 20:46:16,835 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-11-12 20:46:16,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-12 20:46:16,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-11-12 20:46:16,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-11-12 20:46:16,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 213 transitions. [2018-11-12 20:46:16,882 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 213 transitions. Word has length 191 [2018-11-12 20:46:16,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:46:16,882 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 213 transitions. [2018-11-12 20:46:16,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-12 20:46:16,882 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 213 transitions. [2018-11-12 20:46:16,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-12 20:46:16,884 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:46:16,884 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 43, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:46:16,884 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:46:16,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:46:16,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1010669114, now seen corresponding path program 43 times [2018-11-12 20:46:16,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:46:16,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:16,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:46:16,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:16,886 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:46:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:18,914 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-12 20:46:18,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:18,915 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:46:18,915 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:46:18,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:46:18,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:18,915 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:46:18,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:46:18,934 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:46:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:18,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:46:19,042 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-12 20:46:19,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:46:21,287 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-12 20:46:21,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:46:21,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 90 [2018-11-12 20:46:21,310 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:46:21,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-12 20:46:21,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-12 20:46:21,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-11-12 20:46:21,311 INFO L87 Difference]: Start difference. First operand 195 states and 213 transitions. Second operand 46 states. [2018-11-12 20:46:21,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:46:21,513 INFO L93 Difference]: Finished difference Result 256 states and 292 transitions. [2018-11-12 20:46:21,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-12 20:46:21,514 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 194 [2018-11-12 20:46:21,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:46:21,515 INFO L225 Difference]: With dead ends: 256 [2018-11-12 20:46:21,515 INFO L226 Difference]: Without dead ends: 198 [2018-11-12 20:46:21,515 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-11-12 20:46:21,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-11-12 20:46:21,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-11-12 20:46:21,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-11-12 20:46:21,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 216 transitions. [2018-11-12 20:46:21,569 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 216 transitions. Word has length 194 [2018-11-12 20:46:21,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:46:21,569 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 216 transitions. [2018-11-12 20:46:21,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-12 20:46:21,569 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 216 transitions. [2018-11-12 20:46:21,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-12 20:46:21,570 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:46:21,571 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 44, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:46:21,571 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:46:21,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:46:21,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1146091681, now seen corresponding path program 44 times [2018-11-12 20:46:21,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:46:21,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:21,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:46:21,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:21,572 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:46:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:22,634 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-12 20:46:22,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:22,635 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:46:22,635 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:46:22,635 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:46:22,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:22,635 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:46:22,646 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:46:22,646 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:46:22,693 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-11-12 20:46:22,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:46:22,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:46:23,286 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-12 20:46:23,287 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:46:24,466 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-12 20:46:24,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:46:24,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 24, 24] total 91 [2018-11-12 20:46:24,487 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:46:24,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-11-12 20:46:24,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-11-12 20:46:24,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1895, Invalid=6295, Unknown=0, NotChecked=0, Total=8190 [2018-11-12 20:46:24,488 INFO L87 Difference]: Start difference. First operand 198 states and 216 transitions. Second operand 69 states. [2018-11-12 20:46:28,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:46:28,112 INFO L93 Difference]: Finished difference Result 324 states and 381 transitions. [2018-11-12 20:46:28,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-11-12 20:46:28,113 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 197 [2018-11-12 20:46:28,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:46:28,114 INFO L225 Difference]: With dead ends: 324 [2018-11-12 20:46:28,114 INFO L226 Difference]: Without dead ends: 263 [2018-11-12 20:46:28,116 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3182 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5726, Invalid=12906, Unknown=0, NotChecked=0, Total=18632 [2018-11-12 20:46:28,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-11-12 20:46:28,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 204. [2018-11-12 20:46:28,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-12 20:46:28,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 223 transitions. [2018-11-12 20:46:28,168 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 223 transitions. Word has length 197 [2018-11-12 20:46:28,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:46:28,168 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 223 transitions. [2018-11-12 20:46:28,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-11-12 20:46:28,169 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 223 transitions. [2018-11-12 20:46:28,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-12 20:46:28,170 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:46:28,170 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 45, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:46:28,170 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:46:28,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:46:28,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1052265089, now seen corresponding path program 45 times [2018-11-12 20:46:28,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:46:28,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:28,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:46:28,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:28,172 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:46:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:29,444 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-12 20:46:29,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:29,444 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:46:29,444 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:46:29,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:46:29,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:29,444 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:46:29,456 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:46:29,456 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:46:29,497 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:46:29,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:46:29,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:46:29,539 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-12 20:46:29,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:46:31,876 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-12 20:46:31,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:46:31,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 94 [2018-11-12 20:46:31,898 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:46:31,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-12 20:46:31,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-12 20:46:31,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-11-12 20:46:31,899 INFO L87 Difference]: Start difference. First operand 204 states and 223 transitions. Second operand 48 states. [2018-11-12 20:46:32,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:46:32,179 INFO L93 Difference]: Finished difference Result 268 states and 306 transitions. [2018-11-12 20:46:32,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-12 20:46:32,180 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 203 [2018-11-12 20:46:32,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:46:32,181 INFO L225 Difference]: With dead ends: 268 [2018-11-12 20:46:32,181 INFO L226 Difference]: Without dead ends: 207 [2018-11-12 20:46:32,182 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-11-12 20:46:32,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-11-12 20:46:32,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-11-12 20:46:32,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-11-12 20:46:32,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 226 transitions. [2018-11-12 20:46:32,225 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 226 transitions. Word has length 203 [2018-11-12 20:46:32,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:46:32,226 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 226 transitions. [2018-11-12 20:46:32,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-12 20:46:32,226 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 226 transitions. [2018-11-12 20:46:32,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-12 20:46:32,227 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:46:32,227 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 46, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:46:32,227 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:46:32,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:46:32,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1189981444, now seen corresponding path program 46 times [2018-11-12 20:46:32,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:46:32,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:32,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:46:32,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:32,228 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:46:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:33,389 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-12 20:46:33,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:33,390 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:46:33,390 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:46:33,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:46:33,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:33,390 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:46:33,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:46:33,399 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:46:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:33,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:46:33,499 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-12 20:46:33,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:46:36,091 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-12 20:46:36,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:46:36,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 96 [2018-11-12 20:46:36,112 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:46:36,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-12 20:46:36,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-12 20:46:36,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-11-12 20:46:36,113 INFO L87 Difference]: Start difference. First operand 207 states and 226 transitions. Second operand 49 states. [2018-11-12 20:46:36,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:46:36,327 INFO L93 Difference]: Finished difference Result 271 states and 309 transitions. [2018-11-12 20:46:36,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-12 20:46:36,327 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 206 [2018-11-12 20:46:36,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:46:36,329 INFO L225 Difference]: With dead ends: 271 [2018-11-12 20:46:36,329 INFO L226 Difference]: Without dead ends: 210 [2018-11-12 20:46:36,330 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-11-12 20:46:36,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-11-12 20:46:36,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-11-12 20:46:36,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-12 20:46:36,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 229 transitions. [2018-11-12 20:46:36,392 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 229 transitions. Word has length 206 [2018-11-12 20:46:36,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:46:36,392 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 229 transitions. [2018-11-12 20:46:36,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-12 20:46:36,392 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 229 transitions. [2018-11-12 20:46:36,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-11-12 20:46:36,393 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:46:36,393 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 47, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:46:36,394 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:46:36,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:46:36,394 INFO L82 PathProgramCache]: Analyzing trace with hash -330091359, now seen corresponding path program 47 times [2018-11-12 20:46:36,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:46:36,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:36,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:46:36,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:36,395 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:46:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:37,417 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-12 20:46:37,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:37,417 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:46:37,417 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:46:37,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:46:37,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:37,418 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:46:37,426 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:46:37,426 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:46:37,476 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-11-12 20:46:37,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:46:37,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:46:38,123 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-12 20:46:38,124 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:46:39,224 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-12 20:46:39,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:46:39,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 25, 25] total 96 [2018-11-12 20:46:39,244 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:46:39,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-11-12 20:46:39,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-11-12 20:46:39,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2121, Invalid=6999, Unknown=0, NotChecked=0, Total=9120 [2018-11-12 20:46:39,246 INFO L87 Difference]: Start difference. First operand 210 states and 229 transitions. Second operand 73 states. [2018-11-12 20:46:41,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:46:41,028 INFO L93 Difference]: Finished difference Result 339 states and 398 transitions. [2018-11-12 20:46:41,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-11-12 20:46:41,028 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 209 [2018-11-12 20:46:41,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:46:41,030 INFO L225 Difference]: With dead ends: 339 [2018-11-12 20:46:41,030 INFO L226 Difference]: Without dead ends: 275 [2018-11-12 20:46:41,031 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3560 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=6447, Invalid=14433, Unknown=0, NotChecked=0, Total=20880 [2018-11-12 20:46:41,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-11-12 20:46:41,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 216. [2018-11-12 20:46:41,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-11-12 20:46:41,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 236 transitions. [2018-11-12 20:46:41,085 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 236 transitions. Word has length 209 [2018-11-12 20:46:41,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:46:41,085 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 236 transitions. [2018-11-12 20:46:41,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-11-12 20:46:41,085 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 236 transitions. [2018-11-12 20:46:41,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-12 20:46:41,086 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:46:41,087 INFO L375 BasicCegarLoop]: trace histogram [69, 68, 48, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:46:41,087 INFO L423 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:46:41,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:46:41,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1977610625, now seen corresponding path program 48 times [2018-11-12 20:46:41,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:46:41,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:41,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:46:41,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:41,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:46:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:42,192 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-12 20:46:42,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:42,193 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:46:42,193 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:46:42,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:46:42,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:42,193 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:46:42,202 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:46:42,202 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:46:42,250 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:46:42,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:46:42,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:46:42,292 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-12 20:46:42,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:46:45,121 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-12 20:46:45,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:46:45,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 100 [2018-11-12 20:46:45,142 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:46:45,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-12 20:46:45,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-12 20:46:45,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-11-12 20:46:45,144 INFO L87 Difference]: Start difference. First operand 216 states and 236 transitions. Second operand 51 states. [2018-11-12 20:46:45,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:46:45,408 INFO L93 Difference]: Finished difference Result 283 states and 323 transitions. [2018-11-12 20:46:45,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-12 20:46:45,409 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 215 [2018-11-12 20:46:45,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:46:45,410 INFO L225 Difference]: With dead ends: 283 [2018-11-12 20:46:45,410 INFO L226 Difference]: Without dead ends: 219 [2018-11-12 20:46:45,411 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-11-12 20:46:45,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-11-12 20:46:45,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-11-12 20:46:45,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-11-12 20:46:45,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 239 transitions. [2018-11-12 20:46:45,459 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 239 transitions. Word has length 215 [2018-11-12 20:46:45,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:46:45,459 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 239 transitions. [2018-11-12 20:46:45,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-12 20:46:45,460 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 239 transitions. [2018-11-12 20:46:45,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-12 20:46:45,461 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:46:45,461 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 49, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:46:45,461 INFO L423 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:46:45,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:46:45,462 INFO L82 PathProgramCache]: Analyzing trace with hash -22923654, now seen corresponding path program 49 times [2018-11-12 20:46:45,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:46:45,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:45,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:46:45,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:45,463 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:46:45,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:46,496 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-12 20:46:46,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:46,496 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:46:46,496 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:46:46,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:46:46,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:46,497 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:46:46,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:46:46,505 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:46:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:46,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:46:46,606 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-12 20:46:46,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:46:49,810 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-12 20:46:49,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:46:49,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 102 [2018-11-12 20:46:49,832 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:46:49,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-12 20:46:49,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-12 20:46:49,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:46:49,834 INFO L87 Difference]: Start difference. First operand 219 states and 239 transitions. Second operand 52 states. [2018-11-12 20:46:50,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:46:50,131 INFO L93 Difference]: Finished difference Result 286 states and 326 transitions. [2018-11-12 20:46:50,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-12 20:46:50,132 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 218 [2018-11-12 20:46:50,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:46:50,133 INFO L225 Difference]: With dead ends: 286 [2018-11-12 20:46:50,134 INFO L226 Difference]: Without dead ends: 222 [2018-11-12 20:46:50,135 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:46:50,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-11-12 20:46:50,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-11-12 20:46:50,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-11-12 20:46:50,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 242 transitions. [2018-11-12 20:46:50,182 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 242 transitions. Word has length 218 [2018-11-12 20:46:50,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:46:50,183 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 242 transitions. [2018-11-12 20:46:50,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-12 20:46:50,183 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 242 transitions. [2018-11-12 20:46:50,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-12 20:46:50,184 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:46:50,184 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 50, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:46:50,185 INFO L423 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:46:50,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:46:50,185 INFO L82 PathProgramCache]: Analyzing trace with hash 890030239, now seen corresponding path program 50 times [2018-11-12 20:46:50,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:46:50,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:50,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:46:50,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:50,186 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:46:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:51,291 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-12 20:46:51,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:51,292 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:46:51,292 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:46:51,292 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:46:51,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:51,292 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:46:51,301 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:46:51,302 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:46:51,654 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-11-12 20:46:51,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:46:51,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:46:52,339 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-12 20:46:52,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:46:53,361 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-12 20:46:53,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:46:53,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 26, 26] total 101 [2018-11-12 20:46:53,381 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:46:53,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-11-12 20:46:53,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-11-12 20:46:53,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2360, Invalid=7740, Unknown=0, NotChecked=0, Total=10100 [2018-11-12 20:46:53,383 INFO L87 Difference]: Start difference. First operand 222 states and 242 transitions. Second operand 77 states. [2018-11-12 20:46:55,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:46:55,517 INFO L93 Difference]: Finished difference Result 354 states and 415 transitions. [2018-11-12 20:46:55,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-11-12 20:46:55,517 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 221 [2018-11-12 20:46:55,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:46:55,519 INFO L225 Difference]: With dead ends: 354 [2018-11-12 20:46:55,519 INFO L226 Difference]: Without dead ends: 287 [2018-11-12 20:46:55,521 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3959 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=7211, Invalid=16045, Unknown=0, NotChecked=0, Total=23256 [2018-11-12 20:46:55,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-11-12 20:46:55,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 228. [2018-11-12 20:46:55,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-11-12 20:46:55,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 249 transitions. [2018-11-12 20:46:55,575 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 249 transitions. Word has length 221 [2018-11-12 20:46:55,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:46:55,575 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 249 transitions. [2018-11-12 20:46:55,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-11-12 20:46:55,576 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 249 transitions. [2018-11-12 20:46:55,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-11-12 20:46:55,577 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:46:55,577 INFO L375 BasicCegarLoop]: trace histogram [73, 72, 51, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:46:55,577 INFO L423 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:46:55,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:46:55,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1706007999, now seen corresponding path program 51 times [2018-11-12 20:46:55,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:46:55,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:55,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:46:55,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:55,579 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:46:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:56,715 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-12 20:46:56,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:56,716 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:46:56,716 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:46:56,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:46:56,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:56,716 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:46:56,726 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:46:56,726 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:46:56,776 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:46:56,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:46:56,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:46:56,831 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-12 20:46:56,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:46:59,871 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-12 20:46:59,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:46:59,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 106 [2018-11-12 20:46:59,891 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:46:59,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-12 20:46:59,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-12 20:46:59,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-11-12 20:46:59,893 INFO L87 Difference]: Start difference. First operand 228 states and 249 transitions. Second operand 54 states. [2018-11-12 20:47:00,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:47:00,162 INFO L93 Difference]: Finished difference Result 298 states and 340 transitions. [2018-11-12 20:47:00,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-12 20:47:00,162 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 227 [2018-11-12 20:47:00,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:47:00,163 INFO L225 Difference]: With dead ends: 298 [2018-11-12 20:47:00,163 INFO L226 Difference]: Without dead ends: 231 [2018-11-12 20:47:00,164 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-11-12 20:47:00,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-11-12 20:47:00,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-11-12 20:47:00,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-11-12 20:47:00,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 252 transitions. [2018-11-12 20:47:00,220 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 252 transitions. Word has length 227 [2018-11-12 20:47:00,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:47:00,220 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 252 transitions. [2018-11-12 20:47:00,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-12 20:47:00,220 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 252 transitions. [2018-11-12 20:47:00,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-12 20:47:00,222 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:47:00,222 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 52, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:47:00,222 INFO L423 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:47:00,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:47:00,222 INFO L82 PathProgramCache]: Analyzing trace with hash 742877628, now seen corresponding path program 52 times [2018-11-12 20:47:00,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:47:00,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:00,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:47:00,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:00,223 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:47:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:47:01,351 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-12 20:47:01,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:01,352 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:47:01,352 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:47:01,352 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:47:01,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:01,352 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:47:01,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:47:01,361 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:47:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:47:01,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:47:01,460 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-12 20:47:01,460 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:47:04,350 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-12 20:47:04,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:47:04,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 108 [2018-11-12 20:47:04,371 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:47:04,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-12 20:47:04,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-12 20:47:04,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-11-12 20:47:04,373 INFO L87 Difference]: Start difference. First operand 231 states and 252 transitions. Second operand 55 states. [2018-11-12 20:47:04,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:47:04,725 INFO L93 Difference]: Finished difference Result 301 states and 343 transitions. [2018-11-12 20:47:04,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-12 20:47:04,725 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 230 [2018-11-12 20:47:04,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:47:04,727 INFO L225 Difference]: With dead ends: 301 [2018-11-12 20:47:04,727 INFO L226 Difference]: Without dead ends: 234 [2018-11-12 20:47:04,729 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-11-12 20:47:04,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-11-12 20:47:04,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2018-11-12 20:47:04,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-11-12 20:47:04,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 255 transitions. [2018-11-12 20:47:04,781 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 255 transitions. Word has length 230 [2018-11-12 20:47:04,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:47:04,781 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 255 transitions. [2018-11-12 20:47:04,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-12 20:47:04,781 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 255 transitions. [2018-11-12 20:47:04,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-11-12 20:47:04,782 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:47:04,783 INFO L375 BasicCegarLoop]: trace histogram [75, 74, 53, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:47:04,783 INFO L423 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:47:04,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:47:04,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1180101729, now seen corresponding path program 53 times [2018-11-12 20:47:04,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:47:04,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:04,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:47:04,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:04,784 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:47:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:47:05,913 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-12 20:47:05,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:05,914 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:47:05,914 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:47:05,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:47:05,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:05,914 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-12 20:47:05,923 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:47:05,924 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:47:05,989 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-11-12 20:47:05,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:47:05,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:47:06,785 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-12 20:47:06,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:47:07,921 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-12 20:47:07,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:47:07,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 27, 27] total 106 [2018-11-12 20:47:07,942 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:47:07,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-11-12 20:47:07,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-11-12 20:47:07,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2612, Invalid=8518, Unknown=0, NotChecked=0, Total=11130 [2018-11-12 20:47:07,944 INFO L87 Difference]: Start difference. First operand 234 states and 255 transitions. Second operand 81 states. [2018-11-12 20:47:10,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:47:10,306 INFO L93 Difference]: Finished difference Result 369 states and 432 transitions. [2018-11-12 20:47:10,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-11-12 20:47:10,307 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 233 [2018-11-12 20:47:10,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:47:10,309 INFO L225 Difference]: With dead ends: 369 [2018-11-12 20:47:10,309 INFO L226 Difference]: Without dead ends: 299 [2018-11-12 20:47:10,311 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4379 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=8018, Invalid=17742, Unknown=0, NotChecked=0, Total=25760 [2018-11-12 20:47:10,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-11-12 20:47:10,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 240. [2018-11-12 20:47:10,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-11-12 20:47:10,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 262 transitions. [2018-11-12 20:47:10,369 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 262 transitions. Word has length 233 [2018-11-12 20:47:10,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:47:10,369 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 262 transitions. [2018-11-12 20:47:10,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-11-12 20:47:10,370 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 262 transitions. [2018-11-12 20:47:10,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-11-12 20:47:10,370 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:47:10,371 INFO L375 BasicCegarLoop]: trace histogram [77, 76, 54, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:47:10,371 INFO L423 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:47:10,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:47:10,371 INFO L82 PathProgramCache]: Analyzing trace with hash -2141839425, now seen corresponding path program 54 times [2018-11-12 20:47:10,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:47:10,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:10,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:47:10,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:10,372 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:47:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:47:11,531 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-12 20:47:11,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:11,531 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:47:11,531 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:47:11,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:47:11,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:11,532 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-12 20:47:11,542 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:47:11,542 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:47:11,594 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:47:11,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:47:11,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:47:11,639 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-12 20:47:11,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:47:14,859 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-12 20:47:14,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:47:14,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 112 [2018-11-12 20:47:14,879 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:47:14,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-11-12 20:47:14,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-12 20:47:14,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-11-12 20:47:14,881 INFO L87 Difference]: Start difference. First operand 240 states and 262 transitions. Second operand 57 states. [2018-11-12 20:47:15,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:47:15,228 INFO L93 Difference]: Finished difference Result 313 states and 357 transitions. [2018-11-12 20:47:15,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-11-12 20:47:15,228 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 239 [2018-11-12 20:47:15,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:47:15,230 INFO L225 Difference]: With dead ends: 313 [2018-11-12 20:47:15,230 INFO L226 Difference]: Without dead ends: 243 [2018-11-12 20:47:15,231 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-11-12 20:47:15,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-11-12 20:47:15,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-11-12 20:47:15,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-11-12 20:47:15,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 265 transitions. [2018-11-12 20:47:15,289 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 265 transitions. Word has length 239 [2018-11-12 20:47:15,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:47:15,289 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 265 transitions. [2018-11-12 20:47:15,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-11-12 20:47:15,289 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 265 transitions. [2018-11-12 20:47:15,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-11-12 20:47:15,290 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:47:15,290 INFO L375 BasicCegarLoop]: trace histogram [78, 77, 55, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:47:15,290 INFO L423 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:47:15,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:47:15,291 INFO L82 PathProgramCache]: Analyzing trace with hash 99534522, now seen corresponding path program 55 times [2018-11-12 20:47:15,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:47:15,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:15,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:47:15,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:15,292 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:47:15,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:47:16,615 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-12 20:47:16,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:16,615 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:47:16,615 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:47:16,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:47:16,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:16,616 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-12 20:47:16,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:47:16,624 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:47:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:47:16,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:47:16,729 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-12 20:47:16,729 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:47:20,193 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-12 20:47:20,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:47:20,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 114 [2018-11-12 20:47:20,214 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:47:20,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-12 20:47:20,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-12 20:47:20,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-11-12 20:47:20,216 INFO L87 Difference]: Start difference. First operand 243 states and 265 transitions. Second operand 58 states. [2018-11-12 20:47:20,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:47:20,535 INFO L93 Difference]: Finished difference Result 316 states and 360 transitions. [2018-11-12 20:47:20,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-11-12 20:47:20,535 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 242 [2018-11-12 20:47:20,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:47:20,536 INFO L225 Difference]: With dead ends: 316 [2018-11-12 20:47:20,536 INFO L226 Difference]: Without dead ends: 246 [2018-11-12 20:47:20,538 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-12 20:47:20,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-11-12 20:47:20,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2018-11-12 20:47:20,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-11-12 20:47:20,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 268 transitions. [2018-11-12 20:47:20,622 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 268 transitions. Word has length 242 [2018-11-12 20:47:20,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:47:20,622 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 268 transitions. [2018-11-12 20:47:20,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-12 20:47:20,623 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 268 transitions. [2018-11-12 20:47:20,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-11-12 20:47:20,624 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:47:20,624 INFO L375 BasicCegarLoop]: trace histogram [79, 78, 56, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:47:20,624 INFO L423 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:47:20,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:47:20,625 INFO L82 PathProgramCache]: Analyzing trace with hash -985761313, now seen corresponding path program 56 times [2018-11-12 20:47:20,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:47:20,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:20,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:47:20,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:20,626 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:47:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:47:21,870 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-12 20:47:21,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:21,870 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:47:21,870 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:47:21,871 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:47:21,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:21,871 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-12 20:47:21,880 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:47:21,881 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:47:21,943 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-11-12 20:47:21,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:47:21,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:47:22,812 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-12 20:47:22,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:47:24,053 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-12 20:47:24,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:47:24,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 28, 28] total 111 [2018-11-12 20:47:24,074 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:47:24,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-11-12 20:47:24,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-11-12 20:47:24,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2877, Invalid=9333, Unknown=0, NotChecked=0, Total=12210 [2018-11-12 20:47:24,075 INFO L87 Difference]: Start difference. First operand 246 states and 268 transitions. Second operand 85 states. [2018-11-12 20:47:26,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:47:26,654 INFO L93 Difference]: Finished difference Result 384 states and 449 transitions. [2018-11-12 20:47:26,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-11-12 20:47:26,654 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 245 [2018-11-12 20:47:26,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:47:26,656 INFO L225 Difference]: With dead ends: 384 [2018-11-12 20:47:26,656 INFO L226 Difference]: Without dead ends: 311 [2018-11-12 20:47:26,658 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 439 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4820 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=8868, Invalid=19524, Unknown=0, NotChecked=0, Total=28392 [2018-11-12 20:47:26,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-11-12 20:47:26,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 252. [2018-11-12 20:47:26,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-11-12 20:47:26,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 275 transitions. [2018-11-12 20:47:26,727 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 275 transitions. Word has length 245 [2018-11-12 20:47:26,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:47:26,728 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 275 transitions. [2018-11-12 20:47:26,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-11-12 20:47:26,728 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 275 transitions. [2018-11-12 20:47:26,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-11-12 20:47:26,729 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:47:26,729 INFO L375 BasicCegarLoop]: trace histogram [81, 80, 57, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:47:26,729 INFO L423 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:47:26,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:47:26,730 INFO L82 PathProgramCache]: Analyzing trace with hash -673543679, now seen corresponding path program 57 times [2018-11-12 20:47:26,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:47:26,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:26,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:47:26,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:26,731 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:47:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:47:28,014 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-12 20:47:28,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:28,014 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:47:28,014 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:47:28,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:47:28,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:28,015 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-12 20:47:28,023 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:47:28,023 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:47:28,077 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:47:28,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:47:28,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:47:28,125 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-12 20:47:28,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:47:31,907 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-12 20:47:31,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:47:31,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 118 [2018-11-12 20:47:31,928 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:47:31,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-11-12 20:47:31,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-11-12 20:47:31,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-11-12 20:47:31,930 INFO L87 Difference]: Start difference. First operand 252 states and 275 transitions. Second operand 60 states. [2018-11-12 20:47:32,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:47:32,275 INFO L93 Difference]: Finished difference Result 328 states and 374 transitions. [2018-11-12 20:47:32,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-11-12 20:47:32,276 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 251 [2018-11-12 20:47:32,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:47:32,278 INFO L225 Difference]: With dead ends: 328 [2018-11-12 20:47:32,278 INFO L226 Difference]: Without dead ends: 255 [2018-11-12 20:47:32,279 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 445 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-11-12 20:47:32,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-11-12 20:47:32,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-11-12 20:47:32,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-11-12 20:47:32,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 278 transitions. [2018-11-12 20:47:32,353 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 278 transitions. Word has length 251 [2018-11-12 20:47:32,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:47:32,353 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 278 transitions. [2018-11-12 20:47:32,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-11-12 20:47:32,353 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 278 transitions. [2018-11-12 20:47:32,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-11-12 20:47:32,354 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:47:32,354 INFO L375 BasicCegarLoop]: trace histogram [82, 81, 58, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:47:32,355 INFO L423 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:47:32,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:47:32,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1977511812, now seen corresponding path program 58 times [2018-11-12 20:47:32,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:47:32,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:32,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:47:32,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:32,356 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:47:32,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:47:34,332 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-12 20:47:34,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:34,332 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:47:34,332 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:47:34,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:47:34,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:34,332 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-12 20:47:34,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:47:34,341 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:47:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:47:34,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:47:34,444 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-12 20:47:34,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:47:38,272 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-12 20:47:38,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:47:38,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 120 [2018-11-12 20:47:38,292 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:47:38,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-11-12 20:47:38,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-11-12 20:47:38,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-11-12 20:47:38,294 INFO L87 Difference]: Start difference. First operand 255 states and 278 transitions. Second operand 61 states. [2018-11-12 20:47:38,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:47:38,600 INFO L93 Difference]: Finished difference Result 331 states and 377 transitions. [2018-11-12 20:47:38,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-11-12 20:47:38,601 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 254 [2018-11-12 20:47:38,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:47:38,603 INFO L225 Difference]: With dead ends: 331 [2018-11-12 20:47:38,603 INFO L226 Difference]: Without dead ends: 258 [2018-11-12 20:47:38,604 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-11-12 20:47:38,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-12 20:47:38,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2018-11-12 20:47:38,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-11-12 20:47:38,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 281 transitions. [2018-11-12 20:47:38,668 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 281 transitions. Word has length 254 [2018-11-12 20:47:38,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:47:38,668 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 281 transitions. [2018-11-12 20:47:38,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-11-12 20:47:38,668 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 281 transitions. [2018-11-12 20:47:38,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-11-12 20:47:38,669 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:47:38,669 INFO L375 BasicCegarLoop]: trace histogram [83, 82, 59, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:47:38,669 INFO L423 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:47:38,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:47:38,670 INFO L82 PathProgramCache]: Analyzing trace with hash -512969695, now seen corresponding path program 59 times [2018-11-12 20:47:38,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:47:38,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:38,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:47:38,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:38,671 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:47:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:47:40,195 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-12 20:47:40,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:40,195 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:47:40,195 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:47:40,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:47:40,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:40,196 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-12 20:47:40,204 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:47:40,204 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:47:40,281 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-11-12 20:47:40,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:47:40,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:47:41,252 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-12 20:47:41,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:47:42,629 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-12 20:47:42,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:47:42,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 29, 29] total 116 [2018-11-12 20:47:42,649 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:47:42,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-11-12 20:47:42,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-11-12 20:47:42,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3155, Invalid=10185, Unknown=0, NotChecked=0, Total=13340 [2018-11-12 20:47:42,651 INFO L87 Difference]: Start difference. First operand 258 states and 281 transitions. Second operand 89 states. [2018-11-12 20:47:45,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:47:45,229 INFO L93 Difference]: Finished difference Result 399 states and 466 transitions. [2018-11-12 20:47:45,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-11-12 20:47:45,230 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 257 [2018-11-12 20:47:45,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:47:45,231 INFO L225 Difference]: With dead ends: 399 [2018-11-12 20:47:45,231 INFO L226 Difference]: Without dead ends: 323 [2018-11-12 20:47:45,234 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-12 20:47:45,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-11-12 20:47:45,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 264. [2018-11-12 20:47:45,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-11-12 20:47:45,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 288 transitions. [2018-11-12 20:47:45,334 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 288 transitions. Word has length 257 [2018-11-12 20:47:45,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:47:45,334 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 288 transitions. [2018-11-12 20:47:45,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-11-12 20:47:45,334 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 288 transitions. [2018-11-12 20:47:45,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-11-12 20:47:45,335 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:47:45,336 INFO L375 BasicCegarLoop]: trace histogram [85, 84, 60, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:47:45,336 INFO L423 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:47:45,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:47:45,336 INFO L82 PathProgramCache]: Analyzing trace with hash -601022209, now seen corresponding path program 60 times [2018-11-12 20:47:45,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:47:45,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:45,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:47:45,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:45,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:47:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:47:46,841 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-12 20:47:46,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:46,841 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:47:46,841 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:47:46,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:47:46,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:46,841 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-12 20:47:46,852 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:47:46,852 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:47:46,910 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:47:46,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:47:46,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:47:46,978 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-12 20:47:46,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:47:50,834 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-12 20:47:50,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:47:50,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 124 [2018-11-12 20:47:50,856 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:47:50,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-11-12 20:47:50,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-11-12 20:47:50,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-11-12 20:47:50,858 INFO L87 Difference]: Start difference. First operand 264 states and 288 transitions. Second operand 63 states. [2018-11-12 20:47:51,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:47:51,149 INFO L93 Difference]: Finished difference Result 343 states and 391 transitions. [2018-11-12 20:47:51,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-11-12 20:47:51,150 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 263 [2018-11-12 20:47:51,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:47:51,152 INFO L225 Difference]: With dead ends: 343 [2018-11-12 20:47:51,152 INFO L226 Difference]: Without dead ends: 267 [2018-11-12 20:47:51,153 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-12 20:47:51,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-12 20:47:51,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-11-12 20:47:51,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-11-12 20:47:51,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 291 transitions. [2018-11-12 20:47:51,241 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 291 transitions. Word has length 263 [2018-11-12 20:47:51,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:47:51,241 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 291 transitions. [2018-11-12 20:47:51,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-11-12 20:47:51,242 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 291 transitions. [2018-11-12 20:47:51,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-11-12 20:47:51,243 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:47:51,243 INFO L375 BasicCegarLoop]: trace histogram [86, 85, 61, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:47:51,243 INFO L423 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:47:51,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:47:51,244 INFO L82 PathProgramCache]: Analyzing trace with hash 118441722, now seen corresponding path program 61 times [2018-11-12 20:47:51,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:47:51,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:51,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:47:51,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:51,245 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:47:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:47:52,718 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-12 20:47:52,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:52,718 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:47:52,718 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:47:52,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:47:52,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:52,718 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-12 20:47:52,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:47:52,727 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:47:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:47:52,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:47:52,838 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-12 20:47:52,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:47:57,042 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-12 20:47:57,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:47:57,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 126 [2018-11-12 20:47:57,063 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:47:57,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-11-12 20:47:57,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-11-12 20:47:57,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-11-12 20:47:57,065 INFO L87 Difference]: Start difference. First operand 267 states and 291 transitions. Second operand 64 states. [2018-11-12 20:47:57,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:47:57,428 INFO L93 Difference]: Finished difference Result 346 states and 394 transitions. [2018-11-12 20:47:57,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-11-12 20:47:57,428 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 266 [2018-11-12 20:47:57,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:47:57,430 INFO L225 Difference]: With dead ends: 346 [2018-11-12 20:47:57,430 INFO L226 Difference]: Without dead ends: 270 [2018-11-12 20:47:57,431 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 595 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-11-12 20:47:57,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-11-12 20:47:57,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2018-11-12 20:47:57,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-11-12 20:47:57,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 294 transitions. [2018-11-12 20:47:57,499 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 294 transitions. Word has length 266 [2018-11-12 20:47:57,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:47:57,500 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 294 transitions. [2018-11-12 20:47:57,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-11-12 20:47:57,500 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 294 transitions. [2018-11-12 20:47:57,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-11-12 20:47:57,501 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:47:57,501 INFO L375 BasicCegarLoop]: trace histogram [87, 86, 62, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:47:57,502 INFO L423 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:47:57,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:47:57,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1781603103, now seen corresponding path program 62 times [2018-11-12 20:47:57,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:47:57,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:57,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:47:57,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:57,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:47:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:47:59,002 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-12 20:47:59,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:59,003 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:47:59,003 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:47:59,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:47:59,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:59,003 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-12 20:47:59,013 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:47:59,013 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:47:59,072 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-11-12 20:47:59,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:47:59,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:48:00,036 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-12 20:48:00,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:48:01,851 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-12 20:48:01,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:48:01,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 30, 30] total 121 [2018-11-12 20:48:01,872 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:48:01,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-11-12 20:48:01,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-11-12 20:48:01,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3446, Invalid=11074, Unknown=0, NotChecked=0, Total=14520 [2018-11-12 20:48:01,873 INFO L87 Difference]: Start difference. First operand 270 states and 294 transitions. Second operand 93 states. [2018-11-12 20:48:04,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:48:04,709 INFO L93 Difference]: Finished difference Result 414 states and 483 transitions. [2018-11-12 20:48:04,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-11-12 20:48:04,710 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 269 [2018-11-12 20:48:04,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:48:04,711 INFO L225 Difference]: With dead ends: 414 [2018-11-12 20:48:04,711 INFO L226 Difference]: Without dead ends: 335 [2018-11-12 20:48:04,713 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 666 GetRequests, 483 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5765 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=10697, Invalid=23343, Unknown=0, NotChecked=0, Total=34040 [2018-11-12 20:48:04,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-11-12 20:48:04,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 276. [2018-11-12 20:48:04,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-11-12 20:48:04,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 301 transitions. [2018-11-12 20:48:04,798 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 301 transitions. Word has length 269 [2018-11-12 20:48:04,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:48:04,799 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 301 transitions. [2018-11-12 20:48:04,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-11-12 20:48:04,799 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 301 transitions. [2018-11-12 20:48:04,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-11-12 20:48:04,800 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:48:04,800 INFO L375 BasicCegarLoop]: trace histogram [89, 88, 63, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:48:04,800 INFO L423 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:48:04,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:48:04,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1427455551, now seen corresponding path program 63 times [2018-11-12 20:48:04,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:48:04,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:48:04,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:48:04,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:48:04,801 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:48:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:48:06,421 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-12 20:48:06,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:48:06,421 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:48:06,421 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:48:06,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:48:06,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:48:06,422 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-12 20:48:06,434 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:48:06,434 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:48:06,494 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:48:06,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:48:06,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:48:06,549 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-12 20:48:06,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:48:10,764 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-12 20:48:10,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:48:10,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 130 [2018-11-12 20:48:10,786 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:48:10,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-11-12 20:48:10,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-11-12 20:48:10,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-11-12 20:48:10,788 INFO L87 Difference]: Start difference. First operand 276 states and 301 transitions. Second operand 66 states. [2018-11-12 20:48:11,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:48:11,242 INFO L93 Difference]: Finished difference Result 358 states and 408 transitions. [2018-11-12 20:48:11,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-11-12 20:48:11,242 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 275 [2018-11-12 20:48:11,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:48:11,243 INFO L225 Difference]: With dead ends: 358 [2018-11-12 20:48:11,244 INFO L226 Difference]: Without dead ends: 279 [2018-11-12 20:48:11,245 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-12 20:48:11,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-11-12 20:48:11,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-11-12 20:48:11,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-11-12 20:48:11,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 304 transitions. [2018-11-12 20:48:11,344 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 304 transitions. Word has length 275 [2018-11-12 20:48:11,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:48:11,344 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 304 transitions. [2018-11-12 20:48:11,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-11-12 20:48:11,344 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 304 transitions. [2018-11-12 20:48:11,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-11-12 20:48:11,345 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:48:11,345 INFO L375 BasicCegarLoop]: trace histogram [90, 89, 64, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:48:11,346 INFO L423 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:48:11,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:48:11,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1563739964, now seen corresponding path program 64 times [2018-11-12 20:48:11,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:48:11,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:48:11,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:48:11,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:48:11,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:48:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:48:12,961 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-12 20:48:12,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:48:12,962 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:48:12,962 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:48:12,962 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:48:12,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:48:12,962 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-12 20:48:12,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:48:12,971 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:48:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:48:13,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:48:13,108 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-12 20:48:13,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:48:17,862 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-12 20:48:17,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:48:17,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 132 [2018-11-12 20:48:17,883 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:48:17,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-11-12 20:48:17,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-11-12 20:48:17,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-11-12 20:48:17,885 INFO L87 Difference]: Start difference. First operand 279 states and 304 transitions. Second operand 67 states. [2018-11-12 20:48:18,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:48:18,214 INFO L93 Difference]: Finished difference Result 361 states and 411 transitions. [2018-11-12 20:48:18,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-11-12 20:48:18,215 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 278 [2018-11-12 20:48:18,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:48:18,217 INFO L225 Difference]: With dead ends: 361 [2018-11-12 20:48:18,217 INFO L226 Difference]: Without dead ends: 282 [2018-11-12 20:48:18,218 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 492 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-11-12 20:48:18,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-11-12 20:48:18,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2018-11-12 20:48:18,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-11-12 20:48:18,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 307 transitions. [2018-11-12 20:48:18,310 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 307 transitions. Word has length 278 [2018-11-12 20:48:18,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:48:18,310 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 307 transitions. [2018-11-12 20:48:18,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-11-12 20:48:18,310 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 307 transitions. [2018-11-12 20:48:18,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-11-12 20:48:18,311 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:48:18,311 INFO L375 BasicCegarLoop]: trace histogram [91, 90, 65, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:48:18,311 INFO L423 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:48:18,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:48:18,312 INFO L82 PathProgramCache]: Analyzing trace with hash 287869921, now seen corresponding path program 65 times [2018-11-12 20:48:18,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:48:18,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:48:18,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:48:18,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:48:18,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:48:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:48:19,915 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-12 20:48:19,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:48:19,915 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:48:19,915 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:48:19,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:48:19,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:48:19,915 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-12 20:48:19,926 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:48:19,926 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:48:19,987 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-11-12 20:48:19,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:48:19,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:48:21,068 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-12 20:48:21,069 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:48:22,913 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-12 20:48:22,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:48:22,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 31, 31] total 126 [2018-11-12 20:48:22,935 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:48:22,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-11-12 20:48:22,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-11-12 20:48:22,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3750, Invalid=12000, Unknown=0, NotChecked=0, Total=15750 [2018-11-12 20:48:22,937 INFO L87 Difference]: Start difference. First operand 282 states and 307 transitions. Second operand 97 states. [2018-11-12 20:48:26,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:48:26,034 INFO L93 Difference]: Finished difference Result 429 states and 500 transitions. [2018-11-12 20:48:26,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-11-12 20:48:26,035 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 281 [2018-11-12 20:48:26,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:48:26,037 INFO L225 Difference]: With dead ends: 429 [2018-11-12 20:48:26,037 INFO L226 Difference]: Without dead ends: 347 [2018-11-12 20:48:26,039 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 696 GetRequests, 505 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6269 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=11676, Invalid=25380, Unknown=0, NotChecked=0, Total=37056 [2018-11-12 20:48:26,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-11-12 20:48:26,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 288. [2018-11-12 20:48:26,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-11-12 20:48:26,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 314 transitions. [2018-11-12 20:48:26,123 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 314 transitions. Word has length 281 [2018-11-12 20:48:26,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:48:26,123 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 314 transitions. [2018-11-12 20:48:26,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-11-12 20:48:26,123 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 314 transitions. [2018-11-12 20:48:26,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-11-12 20:48:26,124 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:48:26,124 INFO L375 BasicCegarLoop]: trace histogram [93, 92, 66, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:48:26,124 INFO L423 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:48:26,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:48:26,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1164897729, now seen corresponding path program 66 times [2018-11-12 20:48:26,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:48:26,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:48:26,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:48:26,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:48:26,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:48:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:48:28,079 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-12 20:48:28,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:48:28,079 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:48:28,079 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:48:28,080 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:48:28,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:48:28,080 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-12 20:48:28,088 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:48:28,088 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:48:28,149 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:48:28,150 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:48:28,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:48:28,209 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-12 20:48:28,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:48:33,076 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-12 20:48:33,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:48:33,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 136 [2018-11-12 20:48:33,098 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:48:33,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-11-12 20:48:33,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-11-12 20:48:33,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-11-12 20:48:33,100 INFO L87 Difference]: Start difference. First operand 288 states and 314 transitions. Second operand 69 states. [2018-11-12 20:48:33,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:48:33,570 INFO L93 Difference]: Finished difference Result 373 states and 425 transitions. [2018-11-12 20:48:33,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-11-12 20:48:33,571 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 287 [2018-11-12 20:48:33,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:48:33,572 INFO L225 Difference]: With dead ends: 373 [2018-11-12 20:48:33,572 INFO L226 Difference]: Without dead ends: 291 [2018-11-12 20:48:33,573 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 642 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-11-12 20:48:33,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-11-12 20:48:33,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2018-11-12 20:48:33,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-11-12 20:48:33,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 317 transitions. [2018-11-12 20:48:33,673 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 317 transitions. Word has length 287 [2018-11-12 20:48:33,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:48:33,674 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 317 transitions. [2018-11-12 20:48:33,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-11-12 20:48:33,674 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 317 transitions. [2018-11-12 20:48:33,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-11-12 20:48:33,675 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:48:33,675 INFO L375 BasicCegarLoop]: trace histogram [94, 93, 67, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:48:33,675 INFO L423 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:48:33,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:48:33,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1978644282, now seen corresponding path program 67 times [2018-11-12 20:48:33,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:48:33,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:48:33,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:48:33,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:48:33,676 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:48:33,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:48:35,395 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-12 20:48:35,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:48:35,395 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:48:35,395 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:48:35,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:48:35,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:48:35,396 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-12 20:48:35,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:48:35,405 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:48:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:48:35,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:48:35,529 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-12 20:48:35,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:48:40,298 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-12 20:48:40,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:48:40,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 138 [2018-11-12 20:48:40,318 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:48:40,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-11-12 20:48:40,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-11-12 20:48:40,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-11-12 20:48:40,320 INFO L87 Difference]: Start difference. First operand 291 states and 317 transitions. Second operand 70 states. [2018-11-12 20:48:40,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:48:40,684 INFO L93 Difference]: Finished difference Result 376 states and 428 transitions. [2018-11-12 20:48:40,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-11-12 20:48:40,685 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 290 [2018-11-12 20:48:40,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:48:40,687 INFO L225 Difference]: With dead ends: 376 [2018-11-12 20:48:40,687 INFO L226 Difference]: Without dead ends: 294 [2018-11-12 20:48:40,688 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 513 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-11-12 20:48:40,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-11-12 20:48:40,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2018-11-12 20:48:40,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-11-12 20:48:40,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 320 transitions. [2018-11-12 20:48:40,779 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 320 transitions. Word has length 290 [2018-11-12 20:48:40,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:48:40,780 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 320 transitions. [2018-11-12 20:48:40,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-11-12 20:48:40,780 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 320 transitions. [2018-11-12 20:48:40,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-11-12 20:48:40,781 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:48:40,781 INFO L375 BasicCegarLoop]: trace histogram [95, 94, 68, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:48:40,781 INFO L423 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:48:40,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:48:40,781 INFO L82 PathProgramCache]: Analyzing trace with hash -523195297, now seen corresponding path program 68 times [2018-11-12 20:48:40,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:48:40,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:48:40,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:48:40,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:48:40,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:48:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:48:42,608 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-12 20:48:42,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:48:42,609 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:48:42,609 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:48:42,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:48:42,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:48:42,609 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-12 20:48:42,619 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:48:42,619 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:48:42,686 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-11-12 20:48:42,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:48:42,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:48:43,789 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-12 20:48:43,790 INFO L316 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-11-12 20:48:44,679 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-12 20:48:44,880 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:48:44,880 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-12 20:48:44,886 WARN L205 ceAbstractionStarter]: Timeout [2018-11-12 20:48:44,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 08:48:44 BoogieIcfgContainer [2018-11-12 20:48:44,887 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 20:48:44,887 INFO L168 Benchmark]: Toolchain (without parser) took 233023.00 ms. Allocated memory was 1.6 GB in the beginning and 2.8 GB in the end (delta: 1.2 GB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -251.7 MB). Peak memory consumption was 992.4 MB. Max. memory is 7.1 GB. [2018-11-12 20:48:44,889 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:48:44,889 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.85 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-12 20:48:44,890 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.08 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:48:44,890 INFO L168 Benchmark]: Boogie Preprocessor took 22.43 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:48:44,890 INFO L168 Benchmark]: RCFGBuilder took 337.43 ms. Allocated memory was 1.6 GB in the beginning and 2.4 GB in the end (delta: 774.4 MB). Free memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: -828.2 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-12 20:48:44,891 INFO L168 Benchmark]: TraceAbstraction took 232309.13 ms. Allocated memory was 2.4 GB in the beginning and 2.8 GB in the end (delta: 469.8 MB). Free memory was 2.3 GB in the beginning and 1.7 GB in the end (delta: 566.0 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-11-12 20:48:44,893 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.22 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 330.85 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 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 19.08 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.43 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 337.43 ms. Allocated memory was 1.6 GB in the beginning and 2.4 GB in the end (delta: 774.4 MB). Free memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: -828.2 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 232309.13 ms. Allocated memory was 2.4 GB in the beginning and 2.8 GB in the end (delta: 469.8 MB). Free memory was 2.3 GB in the beginning and 1.7 GB in the end (delta: 566.0 MB). Peak memory consumption was 1.0 GB. 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 analyzing trace of length 294 with TraceHistMax 95,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 118 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. TIMEOUT Result, 232.2s OverallTime, 71 OverallIterations, 95 TraceHistogramMax, 42.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 803 SDtfs, 1779 SDslu, 16238 SDs, 0 SdLazy, 9187 SolverSat, 2031 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.9s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 24329 GetRequests, 18801 SyntacticMatches, 0 SemanticMatches, 5528 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53789 ImplicationChecksByTransitivity, 190.7s 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.3s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 0.3076923076923077 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 70 MinimizatonAttempts, 1249 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 174.3s InterpolantComputationTime, 21153 NumberOfCodeBlocks, 19368 NumberOfCodeBlocksAsserted, 617 NumberOfCheckSat, 31508 ConstructedInterpolants, 0 QuantifiedInterpolants, 15351321 SizeOfPredicates, 68 NumberOfNonLiveVariables, 17062 ConjunctsInSsa, 2125 ConjunctsInUnsatCore, 204 InterpolantComputations, 2 PerfectInterpolantSequences, 462269/928997 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown