java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/loops/linear_search_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 15:27:15,452 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 15:27:15,454 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 15:27:15,465 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 15:27:15,466 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 15:27:15,467 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 15:27:15,468 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 15:27:15,471 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 15:27:15,472 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 15:27:15,475 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 15:27:15,476 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 15:27:15,476 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 15:27:15,477 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 15:27:15,478 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 15:27:15,482 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 15:27:15,483 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 15:27:15,484 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 15:27:15,489 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 15:27:15,492 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 15:27:15,493 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 15:27:15,497 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 15:27:15,498 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 15:27:15,502 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 15:27:15,504 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 15:27:15,504 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 15:27:15,505 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 15:27:15,506 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 15:27:15,508 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 15:27:15,509 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 15:27:15,512 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 15:27:15,512 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 15:27:15,513 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 15:27:15,513 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 15:27:15,513 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 15:27:15,514 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 15:27:15,515 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 15:27:15,515 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-10-27 15:27:15,541 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 15:27:15,541 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 15:27:15,542 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 15:27:15,542 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 15:27:15,542 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 15:27:15,543 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 15:27:15,543 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 15:27:15,543 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 15:27:15,543 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 15:27:15,543 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 15:27:15,543 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 15:27:15,544 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 15:27:15,544 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 15:27:15,544 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 15:27:15,546 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 15:27:15,546 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 15:27:15,546 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 15:27:15,546 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 15:27:15,546 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 15:27:15,546 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 15:27:15,547 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 15:27:15,547 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 15:27:15,547 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 15:27:15,547 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 15:27:15,547 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 15:27:15,549 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 15:27:15,549 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 15:27:15,549 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 15:27:15,549 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 15:27:15,549 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 15:27:15,550 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 15:27:15,550 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 15:27:15,550 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 15:27:15,550 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 15:27:15,603 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 15:27:15,616 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 15:27:15,620 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 15:27:15,621 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 15:27:15,622 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 15:27:15,622 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/linear_search_false-unreach-call.i [2018-10-27 15:27:15,688 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/abec1a257/cd37ce139e2346f8a117f0f48c3a1db8/FLAG47c694a5e [2018-10-27 15:27:16,113 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 15:27:16,115 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search_false-unreach-call.i [2018-10-27 15:27:16,123 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/abec1a257/cd37ce139e2346f8a117f0f48c3a1db8/FLAG47c694a5e [2018-10-27 15:27:16,143 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/abec1a257/cd37ce139e2346f8a117f0f48c3a1db8 [2018-10-27 15:27:16,155 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 15:27:16,157 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 15:27:16,158 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 15:27:16,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 15:27:16,162 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 15:27:16,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 03:27:16" (1/1) ... [2018-10-27 15:27:16,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19392d65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:16, skipping insertion in model container [2018-10-27 15:27:16,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 03:27:16" (1/1) ... [2018-10-27 15:27:16,176 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 15:27:16,198 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 15:27:16,384 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 15:27:16,395 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 15:27:16,416 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 15:27:16,434 INFO L193 MainTranslator]: Completed translation [2018-10-27 15:27:16,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:16 WrapperNode [2018-10-27 15:27:16,435 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 15:27:16,436 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 15:27:16,436 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 15:27:16,436 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 15:27:16,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:16" (1/1) ... [2018-10-27 15:27:16,455 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:16" (1/1) ... [2018-10-27 15:27:16,479 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 15:27:16,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 15:27:16,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 15:27:16,481 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 15:27:16,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:16" (1/1) ... [2018-10-27 15:27:16,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:16" (1/1) ... [2018-10-27 15:27:16,494 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:16" (1/1) ... [2018-10-27 15:27:16,494 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:16" (1/1) ... [2018-10-27 15:27:16,500 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:16" (1/1) ... [2018-10-27 15:27:16,505 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:16" (1/1) ... [2018-10-27 15:27:16,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:16" (1/1) ... [2018-10-27 15:27:16,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 15:27:16,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 15:27:16,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 15:27:16,510 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 15:27:16,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 15:27:16,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 15:27:16,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 15:27:16,646 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2018-10-27 15:27:16,646 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2018-10-27 15:27:16,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 15:27:16,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 15:27:16,647 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 15:27:16,647 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 15:27:16,647 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-27 15:27:16,647 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-27 15:27:17,121 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 15:27:17,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 03:27:17 BoogieIcfgContainer [2018-10-27 15:27:17,127 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 15:27:17,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 15:27:17,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 15:27:17,136 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 15:27:17,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 03:27:16" (1/3) ... [2018-10-27 15:27:17,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46021558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 03:27:17, skipping insertion in model container [2018-10-27 15:27:17,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:16" (2/3) ... [2018-10-27 15:27:17,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46021558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 03:27:17, skipping insertion in model container [2018-10-27 15:27:17,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 03:27:17" (3/3) ... [2018-10-27 15:27:17,139 INFO L112 eAbstractionObserver]: Analyzing ICFG linear_search_false-unreach-call.i [2018-10-27 15:27:17,149 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 15:27:17,158 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 15:27:17,175 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 15:27:17,209 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 15:27:17,209 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 15:27:17,209 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 15:27:17,209 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 15:27:17,210 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 15:27:17,210 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 15:27:17,210 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 15:27:17,210 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 15:27:17,229 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-10-27 15:27:17,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-27 15:27:17,236 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:27:17,237 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:27:17,239 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:27:17,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:17,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1855752643, now seen corresponding path program 1 times [2018-10-27 15:27:17,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:27:17,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:17,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:17,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:17,302 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:27:17,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:17,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:17,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 15:27:17,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 15:27:17,470 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 15:27:17,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 15:27:17,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 15:27:17,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 15:27:17,494 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-10-27 15:27:17,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:27:17,518 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-10-27 15:27:17,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 15:27:17,519 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-10-27 15:27:17,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:27:17,529 INFO L225 Difference]: With dead ends: 45 [2018-10-27 15:27:17,529 INFO L226 Difference]: Without dead ends: 22 [2018-10-27 15:27:17,536 INFO L605 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-10-27 15:27:17,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-27 15:27:17,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-27 15:27:17,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-27 15:27:17,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-10-27 15:27:17,586 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2018-10-27 15:27:17,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:27:17,588 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-10-27 15:27:17,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 15:27:17,588 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-10-27 15:27:17,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 15:27:17,589 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:27:17,592 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:27:17,593 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:27:17,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:17,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1049182020, now seen corresponding path program 1 times [2018-10-27 15:27:17,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:27:17,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:17,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:17,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:17,597 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:27:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:18,097 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 17 [2018-10-27 15:27:18,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:18,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 15:27:18,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 15:27:18,246 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 15:27:18,250 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 15:27:18,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 15:27:18,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-27 15:27:18,251 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 6 states. [2018-10-27 15:27:18,497 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-27 15:27:18,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:27:18,841 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2018-10-27 15:27:18,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 15:27:18,842 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-10-27 15:27:18,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:27:18,845 INFO L225 Difference]: With dead ends: 41 [2018-10-27 15:27:18,846 INFO L226 Difference]: Without dead ends: 33 [2018-10-27 15:27:18,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-10-27 15:27:18,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-27 15:27:18,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-10-27 15:27:18,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-27 15:27:18,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-10-27 15:27:18,856 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 20 [2018-10-27 15:27:18,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:27:18,856 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-10-27 15:27:18,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 15:27:18,856 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2018-10-27 15:27:18,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 15:27:18,857 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:27:18,858 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:27:18,858 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:27:18,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:18,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1502974941, now seen corresponding path program 1 times [2018-10-27 15:27:18,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:27:18,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:18,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:18,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:18,860 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:27:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:19,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:19,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 15:27:19,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 15:27:19,004 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 15:27:19,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 15:27:19,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 15:27:19,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-27 15:27:19,006 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 6 states. [2018-10-27 15:27:19,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:27:19,097 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-10-27 15:27:19,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 15:27:19,099 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-10-27 15:27:19,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:27:19,100 INFO L225 Difference]: With dead ends: 35 [2018-10-27 15:27:19,100 INFO L226 Difference]: Without dead ends: 26 [2018-10-27 15:27:19,101 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-27 15:27:19,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-27 15:27:19,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-27 15:27:19,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-27 15:27:19,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-10-27 15:27:19,110 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 20 [2018-10-27 15:27:19,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:27:19,110 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-10-27 15:27:19,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 15:27:19,111 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-10-27 15:27:19,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 15:27:19,112 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:27:19,112 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:27:19,112 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:27:19,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:19,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1442209030, now seen corresponding path program 1 times [2018-10-27 15:27:19,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:27:19,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:19,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:19,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:19,115 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:27:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:19,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:19,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 15:27:19,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 15:27:19,550 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 15:27:19,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 15:27:19,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 15:27:19,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 15:27:19,552 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 5 states. [2018-10-27 15:27:19,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:27:19,674 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-10-27 15:27:19,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 15:27:19,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-10-27 15:27:19,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:27:19,676 INFO L225 Difference]: With dead ends: 36 [2018-10-27 15:27:19,676 INFO L226 Difference]: Without dead ends: 27 [2018-10-27 15:27:19,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 15:27:19,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-27 15:27:19,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-10-27 15:27:19,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-27 15:27:19,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-10-27 15:27:19,684 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 20 [2018-10-27 15:27:19,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:27:19,684 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-10-27 15:27:19,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 15:27:19,685 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-10-27 15:27:19,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-27 15:27:19,685 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:27:19,686 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:27:19,686 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:27:19,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:19,686 INFO L82 PathProgramCache]: Analyzing trace with hash -469535236, now seen corresponding path program 1 times [2018-10-27 15:27:19,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:27:19,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:19,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:19,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:19,688 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:27:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:19,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:19,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 15:27:19,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 15:27:19,911 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 15:27:19,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 15:27:19,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 15:27:19,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 15:27:19,913 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 4 states. [2018-10-27 15:27:20,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:27:20,039 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-10-27 15:27:20,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 15:27:20,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-10-27 15:27:20,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:27:20,041 INFO L225 Difference]: With dead ends: 49 [2018-10-27 15:27:20,041 INFO L226 Difference]: Without dead ends: 34 [2018-10-27 15:27:20,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 15:27:20,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-27 15:27:20,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2018-10-27 15:27:20,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-27 15:27:20,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-10-27 15:27:20,048 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 25 [2018-10-27 15:27:20,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:27:20,049 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-10-27 15:27:20,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 15:27:20,049 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-10-27 15:27:20,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-27 15:27:20,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:27:20,050 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:27:20,051 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:27:20,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:20,051 INFO L82 PathProgramCache]: Analyzing trace with hash -862562246, now seen corresponding path program 1 times [2018-10-27 15:27:20,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:27:20,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:20,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:20,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:20,053 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:27:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:20,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:20,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 15:27:20,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 15:27:20,272 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 15:27:20,272 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 15:27:20,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 15:27:20,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 15:27:20,273 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 4 states. [2018-10-27 15:27:20,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:27:20,344 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-10-27 15:27:20,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 15:27:20,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-10-27 15:27:20,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:27:20,348 INFO L225 Difference]: With dead ends: 52 [2018-10-27 15:27:20,348 INFO L226 Difference]: Without dead ends: 39 [2018-10-27 15:27:20,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 15:27:20,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-27 15:27:20,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2018-10-27 15:27:20,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-27 15:27:20,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-10-27 15:27:20,355 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 25 [2018-10-27 15:27:20,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:27:20,355 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-10-27 15:27:20,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 15:27:20,356 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-10-27 15:27:20,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-27 15:27:20,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:27:20,357 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:27:20,357 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:27:20,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:20,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1056341250, now seen corresponding path program 1 times [2018-10-27 15:27:20,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:27:20,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:20,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:20,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:20,359 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:27:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:20,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:20,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:27:20,927 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:27:20,928 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-10-27 15:27:20,930 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [11], [17], [19], [24], [32], [33], [37], [39], [43], [46], [48], [54], [55], [56], [58], [59], [60] [2018-10-27 15:27:20,966 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 15:27:20,967 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 15:27:21,066 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 15:27:21,564 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 15:27:21,566 INFO L272 AbstractInterpreter]: Visited 22 different actions 94 times. Merged at 8 different actions 64 times. Widened at 1 different actions 4 times. Found 9 fixpoints after 2 different actions. Largest state had 29 variables. [2018-10-27 15:27:21,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:21,613 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 15:27:21,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:27:21,613 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 15:27:21,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:21,630 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 15:27:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:21,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:27:21,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 15:27:21,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:27:22,188 WARN L179 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2018-10-27 15:27:22,736 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 15:27:22,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:27:22,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2018-10-27 15:27:22,766 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:27:22,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 15:27:22,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 15:27:22,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-10-27 15:27:22,767 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 12 states. [2018-10-27 15:27:23,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:27:23,671 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-10-27 15:27:23,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 15:27:23,672 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-10-27 15:27:23,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:27:23,674 INFO L225 Difference]: With dead ends: 51 [2018-10-27 15:27:23,674 INFO L226 Difference]: Without dead ends: 39 [2018-10-27 15:27:23,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2018-10-27 15:27:23,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-27 15:27:23,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2018-10-27 15:27:23,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-27 15:27:23,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-10-27 15:27:23,680 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 25 [2018-10-27 15:27:23,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:27:23,681 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-10-27 15:27:23,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 15:27:23,681 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-10-27 15:27:23,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-27 15:27:23,682 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:27:23,682 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:27:23,682 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:27:23,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:23,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1449368260, now seen corresponding path program 1 times [2018-10-27 15:27:23,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:27:23,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:23,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:23,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:23,684 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:27:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:24,134 WARN L179 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 27 [2018-10-27 15:27:24,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:24,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:27:24,366 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:27:24,367 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-10-27 15:27:24,367 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [11], [13], [17], [19], [24], [32], [33], [37], [39], [43], [46], [48], [54], [55], [56], [58], [59], [60] [2018-10-27 15:27:24,369 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 15:27:24,369 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 15:27:24,376 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 15:27:24,635 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 15:27:24,635 INFO L272 AbstractInterpreter]: Visited 23 different actions 124 times. Merged at 9 different actions 81 times. Widened at 1 different actions 4 times. Found 22 fixpoints after 5 different actions. Largest state had 29 variables. [2018-10-27 15:27:24,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:24,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 15:27:24,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:27:24,676 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 15:27:24,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:24,690 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 15:27:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:24,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:27:24,765 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 15:27:24,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 15:27:26,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-10-27 15:27:26,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 15:27:26,890 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 15:27:26,893 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:26,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:26,944 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:100, output treesize:21 [2018-10-27 15:27:27,377 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-10-27 15:27:28,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:28,091 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:27:28,264 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-10-27 15:27:28,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:28,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:27:28,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 24 [2018-10-27 15:27:28,943 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:27:28,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-27 15:27:28,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-27 15:27:28,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2018-10-27 15:27:28,944 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2018-10-27 15:27:29,204 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2018-10-27 15:27:29,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:27:29,627 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-10-27 15:27:29,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 15:27:29,629 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-10-27 15:27:29,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:27:29,631 INFO L225 Difference]: With dead ends: 45 [2018-10-27 15:27:29,631 INFO L226 Difference]: Without dead ends: 35 [2018-10-27 15:27:29,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2018-10-27 15:27:29,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-27 15:27:29,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-10-27 15:27:29,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-27 15:27:29,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-10-27 15:27:29,639 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 25 [2018-10-27 15:27:29,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:27:29,639 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-10-27 15:27:29,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-27 15:27:29,639 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-10-27 15:27:29,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-27 15:27:29,640 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:27:29,641 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:27:29,641 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:27:29,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:29,641 INFO L82 PathProgramCache]: Analyzing trace with hash 890023736, now seen corresponding path program 1 times [2018-10-27 15:27:29,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:27:29,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:29,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:29,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:29,643 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:27:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:29,826 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:29,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:27:29,827 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:27:29,827 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-10-27 15:27:29,827 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [11], [13], [17], [19], [22], [24], [32], [33], [37], [39], [43], [46], [48], [54], [55], [56], [58], [59], [60] [2018-10-27 15:27:29,830 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 15:27:29,830 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 15:27:29,838 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 15:27:30,105 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 15:27:30,107 INFO L272 AbstractInterpreter]: Visited 24 different actions 157 times. Merged at 10 different actions 97 times. Widened at 2 different actions 6 times. Found 32 fixpoints after 6 different actions. Largest state had 29 variables. [2018-10-27 15:27:30,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:30,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 15:27:30,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:27:30,135 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 15:27:30,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:30,147 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 15:27:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:30,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:27:30,256 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:30,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:27:30,311 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:30,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:27:30,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-10-27 15:27:30,333 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:27:30,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 15:27:30,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 15:27:30,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-27 15:27:30,334 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 7 states. [2018-10-27 15:27:30,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:27:30,398 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-10-27 15:27:30,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 15:27:30,399 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-10-27 15:27:30,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:27:30,400 INFO L225 Difference]: With dead ends: 57 [2018-10-27 15:27:30,400 INFO L226 Difference]: Without dead ends: 44 [2018-10-27 15:27:30,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-27 15:27:30,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-27 15:27:30,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-10-27 15:27:30,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-27 15:27:30,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-10-27 15:27:30,407 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 30 [2018-10-27 15:27:30,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:27:30,408 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-10-27 15:27:30,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 15:27:30,408 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-10-27 15:27:30,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-27 15:27:30,409 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:27:30,409 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:27:30,409 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:27:30,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:30,410 INFO L82 PathProgramCache]: Analyzing trace with hash 303217722, now seen corresponding path program 2 times [2018-10-27 15:27:30,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:27:30,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:30,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:30,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:30,411 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:27:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:34,875 WARN L179 SmtUtils]: Spent 4.27 s on a formula simplification. DAG size of input: 102 DAG size of output: 30 [2018-10-27 15:27:35,577 WARN L179 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 31 [2018-10-27 15:27:35,780 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2018-10-27 15:27:36,553 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2018-10-27 15:27:37,733 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2018-10-27 15:27:39,764 WARN L854 $PredicateComparison]: unable to prove that (or (not (= 0 |c_linear_search_#in~a.offset|)) (let ((.cse19 (div c_~SIZE~0 4294967296))) (let ((.cse2 (* 4294967296 .cse19))) (let ((.cse18 (<= c_~SIZE~0 (+ .cse2 2)))) (and (or (let ((.cse16 (div c_~SIZE~0 2))) (let ((.cse4 (* 2 .cse16))) (let ((.cse11 (= .cse4 c_~SIZE~0)) (.cse14 (<= .cse2 c_~SIZE~0)) (.cse15 (div (+ c_~SIZE~0 (* (- 4294967296) .cse19)) 2))) (let ((.cse1 (div .cse15 4294967296)) (.cse3 (or .cse11 .cse14)) (.cse17 (div (+ .cse15 1) 4294967296)) (.cse8 (not .cse11)) (.cse9 (< c_~SIZE~0 .cse2))) (and (let ((.cse0 (+ c_~SIZE~0 1))) (or (and (<= .cse0 (+ (* 8589934592 .cse1) .cse2)) .cse3) (<= (+ .cse4 2) c_~SIZE~0) (let ((.cse10 (* 17179869184 .cse1)) (.cse5 (* 17179869184 .cse17)) (.cse6 (* 4 c_~SIZE~0)) (.cse7 (+ (* 8 .cse16) (* 4 .cse15)))) (and (or (and (<= (+ .cse5 .cse6 4) .cse7) .cse8 .cse9) (and (<= (+ .cse10 .cse6 4) .cse7) .cse3)) (or (and (<= (+ .cse10 .cse6 5) .cse7) .cse3) (let ((.cse12 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse13 (* (- 4) .cse15))) (and (or .cse11 (not (= (select .cse12 (- (+ .cse5 .cse13))) |c_linear_search_#in~q|)) .cse14) (or (and .cse8 .cse9) (not (= (select .cse12 (- (+ .cse10 .cse13))) |c_linear_search_#in~q|))))) (and (<= (+ .cse5 .cse6 5) .cse7) .cse8 .cse9)))) (<= (+ .cse2 (* 2 .cse15) 2) c_~SIZE~0) (and .cse8 (<= .cse0 (+ (* 8589934592 .cse17) .cse2)) .cse9))) (or (and (<= (+ .cse1 1) 0) .cse3) .cse18 (and (<= (+ .cse17 1) 0) .cse8 .cse9))))))) (not (= c_~SIZE~0 (+ |c_linear_search_#in~n| .cse2)))) .cse18))))) is different from true [2018-10-27 15:27:39,775 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:39,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:27:39,776 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:27:39,776 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:27:39,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:27:39,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:27:39,777 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 15:27:39,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 15:27:39,788 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 15:27:39,871 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-27 15:27:39,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:27:39,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:27:39,895 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 15:27:39,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 15:27:39,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-10-27 15:27:40,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 15:27:40,001 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 15:27:40,003 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:40,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:40,009 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:100, output treesize:21 [2018-10-27 15:27:40,882 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:40,882 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:27:41,051 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2018-10-27 15:27:41,858 WARN L179 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-10-27 15:27:42,438 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2018-10-27 15:27:42,715 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2018-10-27 15:27:42,924 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-10-27 15:27:42,975 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:42,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:27:42,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 33 [2018-10-27 15:27:42,995 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:27:42,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-27 15:27:42,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-27 15:27:42,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=854, Unknown=1, NotChecked=60, Total=1056 [2018-10-27 15:27:42,997 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 23 states. [2018-10-27 15:27:43,336 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2018-10-27 15:27:46,248 WARN L179 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 138 DAG size of output: 35 [2018-10-27 15:27:46,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:27:46,302 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-10-27 15:27:46,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 15:27:46,303 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-10-27 15:27:46,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:27:46,304 INFO L225 Difference]: With dead ends: 50 [2018-10-27 15:27:46,305 INFO L226 Difference]: Without dead ends: 40 [2018-10-27 15:27:46,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=228, Invalid=1107, Unknown=1, NotChecked=70, Total=1406 [2018-10-27 15:27:46,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-27 15:27:46,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-10-27 15:27:46,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-27 15:27:46,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-10-27 15:27:46,314 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 30 [2018-10-27 15:27:46,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:27:46,315 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-10-27 15:27:46,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-27 15:27:46,315 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-10-27 15:27:46,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-27 15:27:46,316 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:27:46,316 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:27:46,316 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:27:46,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:46,317 INFO L82 PathProgramCache]: Analyzing trace with hash 411764474, now seen corresponding path program 2 times [2018-10-27 15:27:46,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:27:46,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:46,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:27:46,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:46,318 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:27:46,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:46,953 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2018-10-27 15:27:46,958 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:46,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:27:46,958 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:27:46,959 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:27:46,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:27:46,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:27:46,959 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 15:27:46,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 15:27:46,979 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 15:27:47,140 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-27 15:27:47,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:27:47,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:27:47,396 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:47,396 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:27:47,470 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:47,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:27:47,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2018-10-27 15:27:47,492 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:27:47,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 15:27:47,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 15:27:47,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-10-27 15:27:47,493 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 9 states. [2018-10-27 15:27:47,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:27:47,596 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-10-27 15:27:47,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 15:27:47,600 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-10-27 15:27:47,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:27:47,602 INFO L225 Difference]: With dead ends: 62 [2018-10-27 15:27:47,602 INFO L226 Difference]: Without dead ends: 49 [2018-10-27 15:27:47,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-10-27 15:27:47,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-27 15:27:47,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2018-10-27 15:27:47,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-27 15:27:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-10-27 15:27:47,610 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 35 [2018-10-27 15:27:47,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:27:47,611 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-10-27 15:27:47,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 15:27:47,611 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-10-27 15:27:47,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-27 15:27:47,612 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:27:47,612 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:27:47,612 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:27:47,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:47,613 INFO L82 PathProgramCache]: Analyzing trace with hash -175041540, now seen corresponding path program 3 times [2018-10-27 15:27:47,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:27:47,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:47,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:27:47,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:47,614 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:27:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:48,172 WARN L179 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 29 [2018-10-27 15:27:48,537 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 23 [2018-10-27 15:27:48,715 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 36 [2018-10-27 15:27:49,140 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 56 [2018-10-27 15:27:49,313 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 53 [2018-10-27 15:27:49,581 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 58 [2018-10-27 15:27:49,958 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 51 [2018-10-27 15:27:50,148 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 45 [2018-10-27 15:27:50,729 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2018-10-27 15:27:50,879 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2018-10-27 15:27:51,115 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 31 [2018-10-27 15:27:51,126 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:51,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:27:51,126 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:27:51,126 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:27:51,126 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:27:51,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:27:51,127 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 15:27:51,135 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 15:27:51,135 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 15:27:51,234 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 15:27:51,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:27:51,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:27:51,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-10-27 15:27:51,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 15:27:51,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:27:51,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:51,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-10-27 15:27:51,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 15:27:51,313 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 15:27:51,320 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:53,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:53,372 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:100, output treesize:21 [2018-10-27 15:27:54,035 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2018-10-27 15:27:54,420 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2018-10-27 15:27:54,847 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2018-10-27 15:27:55,010 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:55,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:27:55,217 WARN L179 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 71 [2018-10-27 15:27:55,412 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-10-27 15:27:55,600 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2018-10-27 15:27:56,231 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-10-27 15:27:57,031 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-10-27 15:27:57,307 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-10-27 15:27:57,756 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-27 15:27:58,572 WARN L179 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2018-10-27 15:27:58,914 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-10-27 15:27:59,213 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-10-27 15:28:00,513 WARN L179 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2018-10-27 15:28:00,541 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:28:00,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:28:00,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 47 [2018-10-27 15:28:00,563 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:28:00,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-27 15:28:00,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-27 15:28:00,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1923, Unknown=0, NotChecked=0, Total=2162 [2018-10-27 15:28:00,565 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 32 states. [2018-10-27 15:28:01,058 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 45 [2018-10-27 15:28:02,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:28:02,109 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-10-27 15:28:02,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 15:28:02,109 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 35 [2018-10-27 15:28:02,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:28:02,111 INFO L225 Difference]: With dead ends: 55 [2018-10-27 15:28:02,111 INFO L226 Difference]: Without dead ends: 45 [2018-10-27 15:28:02,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=364, Invalid=2498, Unknown=0, NotChecked=0, Total=2862 [2018-10-27 15:28:02,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-27 15:28:02,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-10-27 15:28:02,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-27 15:28:02,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-10-27 15:28:02,120 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 35 [2018-10-27 15:28:02,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:28:02,120 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-10-27 15:28:02,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-27 15:28:02,121 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-10-27 15:28:02,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-27 15:28:02,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:28:02,121 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:28:02,122 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:28:02,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:28:02,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1953970296, now seen corresponding path program 3 times [2018-10-27 15:28:02,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:28:02,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:02,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:28:02,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:02,123 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:28:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:28:02,448 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 16 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:28:02,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:28:02,449 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:28:02,449 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:28:02,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:28:02,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:28:02,449 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 15:28:02,457 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 15:28:02,457 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 15:28:02,495 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 15:28:02,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:28:02,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:28:02,548 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 16 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:28:02,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:28:02,655 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 16 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:28:02,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:28:02,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2018-10-27 15:28:02,677 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:28:02,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 15:28:02,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 15:28:02,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-10-27 15:28:02,678 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 11 states. [2018-10-27 15:28:02,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:28:02,817 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-10-27 15:28:02,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 15:28:02,818 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2018-10-27 15:28:02,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:28:02,819 INFO L225 Difference]: With dead ends: 67 [2018-10-27 15:28:02,819 INFO L226 Difference]: Without dead ends: 54 [2018-10-27 15:28:02,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-10-27 15:28:02,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-27 15:28:02,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2018-10-27 15:28:02,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-27 15:28:02,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-10-27 15:28:02,828 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 40 [2018-10-27 15:28:02,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:28:02,828 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-10-27 15:28:02,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 15:28:02,828 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-10-27 15:28:02,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-27 15:28:02,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:28:02,829 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:28:02,829 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:28:02,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:28:02,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1367164282, now seen corresponding path program 4 times [2018-10-27 15:28:02,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:28:02,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:02,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:28:02,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:02,831 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:28:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:28:05,178 WARN L179 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 111 DAG size of output: 24 [2018-10-27 15:28:05,531 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 31 [2018-10-27 15:28:05,730 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2018-10-27 15:28:05,862 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 43 [2018-10-27 15:28:06,063 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 55 [2018-10-27 15:28:06,261 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 63 [2018-10-27 15:28:06,417 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2018-10-27 15:28:06,670 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2018-10-27 15:28:08,914 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse13 (div c_~SIZE~0 4294967296))) (let ((.cse9 (* 4294967296 .cse13))) (and (let ((.cse11 (* 2 (div c_~SIZE~0 2)))) (let ((.cse4 (= .cse11 c_~SIZE~0)) (.cse6 (<= .cse9 c_~SIZE~0)) (.cse10 (div (+ c_~SIZE~0 (* (- 4294967296) .cse13)) 2))) (let ((.cse0 (div .cse10 4294967296)) (.cse1 (or .cse4 .cse6)) (.cse12 (not (= c_~SIZE~0 (+ |c_linear_search_#in~n| .cse9)))) (.cse5 (div (+ .cse10 1) 4294967296)) (.cse2 (not .cse4)) (.cse3 (< c_~SIZE~0 .cse9))) (or (and (<= (+ .cse0 1) 0) .cse1) (let ((.cse8 (* 8589934592 .cse13))) (and (or (and (or (and .cse2 .cse3) (< 0 .cse0)) (or .cse4 (< 0 .cse5) .cse6)) (and (let ((.cse7 (<= (+ c_~SIZE~0 1) .cse9))) (or .cse7 (and (or (not (= (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (- (+ .cse8 (* (- 2) c_~SIZE~0)))) |c_linear_search_#in~q|)) (< (+ .cse9 (* 2 .cse10)) c_~SIZE~0)) (or (<= c_~SIZE~0 .cse11) (<= (+ .cse9 4294967300) c_~SIZE~0) (<= (+ .cse11 2) c_~SIZE~0) .cse7 .cse12)))) (not (= c_~SIZE~0 (+ |c_linear_search_#in~n| .cse9 4294967296))))) (or (<= (* 2 c_~SIZE~0) (+ .cse8 8)) (and (<= .cse0 0) .cse1) (and .cse2 (<= .cse5 0) .cse3)))) .cse12 (and (<= (+ .cse5 1) 0) .cse2 .cse3))))) (<= c_~SIZE~0 (+ .cse9 4))))) (not (= 0 |c_linear_search_#in~a.offset|))) is different from true [2018-10-27 15:28:08,928 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:28:08,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:28:08,929 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:28:08,929 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:28:08,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:28:08,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:28:08,929 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 15:28:08,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:28:08,937 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 15:28:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:28:09,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:28:09,028 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 15:28:09,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 15:28:09,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-10-27 15:28:09,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 15:28:09,060 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 15:28:09,062 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:28:09,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:28:09,067 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:100, output treesize:21 [2018-10-27 15:28:09,906 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2018-10-27 15:28:10,642 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2018-10-27 15:28:18,736 WARN L179 SmtUtils]: Spent 6.84 s on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2018-10-27 15:28:18,912 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:28:18,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:28:21,833 WARN L179 SmtUtils]: Spent 2.92 s on a formula simplification. DAG size of input: 134 DAG size of output: 97 [2018-10-27 15:28:23,547 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-10-27 15:28:24,125 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-10-27 15:28:24,699 WARN L179 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2018-10-27 15:28:25,147 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-10-27 15:28:25,704 WARN L179 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-10-27 15:28:26,641 WARN L179 SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-10-27 15:28:27,762 WARN L179 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2018-10-27 15:28:27,799 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:28:27,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:28:27,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 20] total 50 [2018-10-27 15:28:27,822 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:28:27,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-27 15:28:27,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-27 15:28:27,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2137, Unknown=2, NotChecked=94, Total=2450 [2018-10-27 15:28:27,824 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 32 states. [2018-10-27 15:28:28,682 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2018-10-27 15:28:28,956 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2018-10-27 15:28:29,604 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2018-10-27 15:28:30,762 WARN L179 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2018-10-27 15:28:31,342 WARN L179 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 73 [2018-10-27 15:28:34,772 WARN L179 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 71 [2018-10-27 15:28:35,165 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 64 [2018-10-27 15:28:35,607 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 68 [2018-10-27 15:28:35,916 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 75 [2018-10-27 15:28:36,171 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 67 [2018-10-27 15:28:38,450 WARN L179 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 174 DAG size of output: 69 [2018-10-27 15:28:38,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:28:38,859 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-10-27 15:28:38,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-27 15:28:38,859 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2018-10-27 15:28:38,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:28:38,860 INFO L225 Difference]: With dead ends: 60 [2018-10-27 15:28:38,860 INFO L226 Difference]: Without dead ends: 50 [2018-10-27 15:28:38,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 30.7s TimeCoverageRelationStatistics Valid=428, Invalid=3733, Unknown=3, NotChecked=126, Total=4290 [2018-10-27 15:28:38,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-27 15:28:38,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-10-27 15:28:38,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-27 15:28:38,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-10-27 15:28:38,870 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 40 [2018-10-27 15:28:38,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:28:38,871 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-10-27 15:28:38,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-27 15:28:38,871 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-10-27 15:28:38,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-27 15:28:38,872 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:28:38,872 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:28:38,872 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:28:38,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:28:38,873 INFO L82 PathProgramCache]: Analyzing trace with hash 545539514, now seen corresponding path program 4 times [2018-10-27 15:28:38,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:28:38,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:38,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:28:38,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:38,874 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:28:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:28:43,039 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:28:43,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:28:43,040 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:28:43,040 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:28:43,040 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:28:43,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:28:43,040 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 15:28:43,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:28:43,048 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 15:28:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:28:43,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:28:43,182 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:28:43,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:28:43,325 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:28:43,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:28:43,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2018-10-27 15:28:43,346 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:28:43,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-27 15:28:43,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 15:28:43,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=235, Unknown=1, NotChecked=0, Total=342 [2018-10-27 15:28:43,347 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 13 states. [2018-10-27 15:28:43,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:28:43,561 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-10-27 15:28:43,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 15:28:43,562 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2018-10-27 15:28:43,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:28:43,563 INFO L225 Difference]: With dead ends: 72 [2018-10-27 15:28:43,563 INFO L226 Difference]: Without dead ends: 59 [2018-10-27 15:28:43,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=106, Invalid=235, Unknown=1, NotChecked=0, Total=342 [2018-10-27 15:28:43,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-27 15:28:43,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2018-10-27 15:28:43,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-27 15:28:43,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-10-27 15:28:43,581 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 45 [2018-10-27 15:28:43,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:28:43,581 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-10-27 15:28:43,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-27 15:28:43,581 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-10-27 15:28:43,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-27 15:28:43,582 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:28:43,582 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:28:43,582 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:28:43,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:28:43,583 INFO L82 PathProgramCache]: Analyzing trace with hash -41266500, now seen corresponding path program 5 times [2018-10-27 15:28:43,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:28:43,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:43,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:28:43,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:43,584 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:28:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:28:44,149 WARN L179 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 28 [2018-10-27 15:28:44,776 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2018-10-27 15:28:45,449 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 46 [2018-10-27 15:28:45,470 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:28:45,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:28:45,471 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:28:45,471 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:28:45,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:28:45,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:28:45,471 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 15:28:45,480 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 15:28:45,480 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 15:29:05,576 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-27 15:29:05,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:29:05,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:29:05,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2018-10-27 15:29:05,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 15:29:05,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:05,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:05,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2018-10-27 15:29:05,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 15:29:05,641 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:05,660 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:05,662 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 15:29:05,662 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:05,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2018-10-27 15:29:05,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 15:29:05,669 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:05,688 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:05,689 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 15:29:05,690 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:05,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-10-27 15:29:05,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 15:29:05,701 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:05,717 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:07,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-27 15:29:07,809 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:445, output treesize:66 [2018-10-27 15:29:08,934 WARN L179 SmtUtils]: Spent 569.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-10-27 15:29:09,737 WARN L179 SmtUtils]: Spent 641.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-10-27 15:29:10,138 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-10-27 15:29:10,790 WARN L179 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2018-10-27 15:29:11,411 WARN L179 SmtUtils]: Spent 549.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-10-27 15:29:11,637 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-10-27 15:29:12,542 WARN L179 SmtUtils]: Spent 703.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-10-27 15:29:12,849 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:29:12,849 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:29:14,281 WARN L179 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 121 DAG size of output: 92 [2018-10-27 15:29:14,431 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2018-10-27 15:29:15,196 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2018-10-27 15:29:16,289 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2018-10-27 15:29:16,594 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-10-27 15:29:16,883 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-10-27 15:29:17,391 WARN L179 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2018-10-27 15:29:17,871 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-10-27 15:29:18,441 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-10-27 15:29:18,984 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-10-27 15:29:19,665 WARN L179 SmtUtils]: Spent 387.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-10-27 15:29:20,866 WARN L179 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 72 [2018-10-27 15:29:21,526 WARN L179 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-10-27 15:29:22,646 WARN L179 SmtUtils]: Spent 542.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-10-27 15:29:22,822 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:29:22,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:29:22,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 21] total 52 [2018-10-27 15:29:22,856 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:29:22,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-27 15:29:22,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-27 15:29:22,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=2393, Unknown=0, NotChecked=0, Total=2652 [2018-10-27 15:29:22,859 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 33 states. [2018-10-27 15:29:23,456 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-10-27 15:29:26,480 WARN L179 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 92 DAG size of output: 48 [2018-10-27 15:29:29,332 WARN L179 SmtUtils]: Spent 2.69 s on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-10-27 15:29:30,063 WARN L179 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2018-10-27 15:29:30,731 WARN L179 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2018-10-27 15:29:31,448 WARN L179 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2018-10-27 15:29:31,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:29:31,519 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-10-27 15:29:31,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-27 15:29:31,520 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 45 [2018-10-27 15:29:31,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:29:31,521 INFO L225 Difference]: With dead ends: 65 [2018-10-27 15:29:31,521 INFO L226 Difference]: Without dead ends: 55 [2018-10-27 15:29:31,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 51 SyntacticMatches, 7 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 843 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=383, Invalid=2923, Unknown=0, NotChecked=0, Total=3306 [2018-10-27 15:29:31,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-27 15:29:31,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-10-27 15:29:31,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-27 15:29:31,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-10-27 15:29:31,530 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 45 [2018-10-27 15:29:31,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:29:31,531 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-10-27 15:29:31,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-27 15:29:31,531 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-10-27 15:29:31,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-27 15:29:31,532 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:29:31,532 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:29:31,532 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:29:31,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:29:31,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1808322120, now seen corresponding path program 5 times [2018-10-27 15:29:31,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:29:31,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:31,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:29:31,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:31,533 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:29:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:29:36,610 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 24 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:29:36,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:36,611 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:29:36,611 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:29:36,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:29:36,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:36,611 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 15:29:36,619 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 15:29:36,620 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 15:29:37,466 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-27 15:29:37,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:29:37,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:29:37,540 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 24 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:29:37,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:29:37,793 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 24 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:29:37,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:29:37,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2018-10-27 15:29:37,814 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:29:37,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-27 15:29:37,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-27 15:29:37,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=322, Unknown=2, NotChecked=0, Total=462 [2018-10-27 15:29:37,815 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 15 states. [2018-10-27 15:29:38,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:29:38,227 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-10-27 15:29:38,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 15:29:38,227 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2018-10-27 15:29:38,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:29:38,228 INFO L225 Difference]: With dead ends: 77 [2018-10-27 15:29:38,228 INFO L226 Difference]: Without dead ends: 64 [2018-10-27 15:29:38,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=138, Invalid=322, Unknown=2, NotChecked=0, Total=462 [2018-10-27 15:29:38,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-27 15:29:38,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2018-10-27 15:29:38,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-27 15:29:38,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-10-27 15:29:38,238 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 50 [2018-10-27 15:29:38,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:29:38,238 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-10-27 15:29:38,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-27 15:29:38,238 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-10-27 15:29:38,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-27 15:29:38,239 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:29:38,239 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:29:38,239 INFO L424 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:29:38,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:29:38,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1899839162, now seen corresponding path program 6 times [2018-10-27 15:29:38,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:29:38,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:38,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:29:38,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:38,241 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:29:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:29:40,546 WARN L179 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 120 DAG size of output: 26 [2018-10-27 15:29:41,514 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 44 [2018-10-27 15:29:41,706 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 52 [2018-10-27 15:29:41,872 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 43 [2018-10-27 15:29:42,163 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 38 [2018-10-27 15:29:42,574 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 35 [2018-10-27 15:29:42,593 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:29:42,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:42,593 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:29:42,593 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:29:42,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:29:42,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:42,594 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 15:29:42,601 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 15:29:42,601 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 15:29:42,758 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 15:29:42,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:29:42,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:29:42,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-10-27 15:29:42,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 15:29:42,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:42,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:42,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-10-27 15:29:42,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 15:29:42,795 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:42,808 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:48,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:48,855 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:100, output treesize:21 [2018-10-27 15:29:51,537 WARN L179 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2018-10-27 15:29:52,842 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:29:52,843 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:29:53,348 WARN L179 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 115 [2018-10-27 15:29:55,500 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-10-27 15:29:55,840 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-10-27 15:29:56,192 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-10-27 15:29:56,721 WARN L179 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 87 [2018-10-27 15:29:57,381 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-10-27 15:29:58,403 WARN L179 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2018-10-27 15:29:59,308 WARN L179 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2018-10-27 15:30:01,813 WARN L179 SmtUtils]: Spent 1.47 s on a formula simplification that was a NOOP. DAG size: 98 [2018-10-27 15:30:03,812 WARN L179 SmtUtils]: Spent 570.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2018-10-27 15:30:03,886 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:30:03,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:30:03,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 21] total 56 [2018-10-27 15:30:03,907 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:30:03,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-27 15:30:03,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-27 15:30:03,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=2848, Unknown=0, NotChecked=0, Total=3080 [2018-10-27 15:30:03,909 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 37 states. [2018-10-27 15:30:04,462 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2018-10-27 15:30:05,171 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2018-10-27 15:30:06,007 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2018-10-27 15:30:06,812 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2018-10-27 15:30:10,482 WARN L179 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2018-10-27 15:30:11,270 WARN L179 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 83 [2018-10-27 15:30:12,028 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2018-10-27 15:30:12,732 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2018-10-27 15:30:13,085 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 81 [2018-10-27 15:30:13,525 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2018-10-27 15:30:13,853 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 67 [2018-10-27 15:30:14,150 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2018-10-27 15:30:14,372 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 60 [2018-10-27 15:30:14,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:30:14,480 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2018-10-27 15:30:14,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-27 15:30:14,481 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 50 [2018-10-27 15:30:14,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:30:14,482 INFO L225 Difference]: With dead ends: 70 [2018-10-27 15:30:14,482 INFO L226 Difference]: Without dead ends: 60 [2018-10-27 15:30:14,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 27.2s TimeCoverageRelationStatistics Valid=465, Invalid=5085, Unknown=0, NotChecked=0, Total=5550 [2018-10-27 15:30:14,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-27 15:30:14,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-10-27 15:30:14,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-27 15:30:14,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-10-27 15:30:14,494 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 50 [2018-10-27 15:30:14,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:30:14,495 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-10-27 15:30:14,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-27 15:30:14,495 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-10-27 15:30:14,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-27 15:30:14,496 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:30:14,496 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:30:14,496 INFO L424 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:30:14,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:30:14,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1410208890, now seen corresponding path program 6 times [2018-10-27 15:30:14,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:30:14,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:30:14,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:30:14,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:30:14,497 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:30:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:30:14,775 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 9 [2018-10-27 15:30:22,829 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 28 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:30:22,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:30:22,830 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:30:22,830 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:30:22,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:30:22,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:30:22,830 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 15:30:22,838 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 15:30:22,838 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 15:30:22,881 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 15:30:22,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:30:22,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:30:22,989 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 28 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:30:22,989 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:30:23,276 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 28 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:30:23,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:30:23,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2018-10-27 15:30:23,296 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:30:23,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-27 15:30:23,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-27 15:30:23,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=424, Unknown=2, NotChecked=0, Total=600 [2018-10-27 15:30:23,297 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 17 states. [2018-10-27 15:30:23,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:30:23,565 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2018-10-27 15:30:23,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 15:30:23,566 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2018-10-27 15:30:23,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:30:23,566 INFO L225 Difference]: With dead ends: 82 [2018-10-27 15:30:23,566 INFO L226 Difference]: Without dead ends: 69 [2018-10-27 15:30:23,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=174, Invalid=424, Unknown=2, NotChecked=0, Total=600 [2018-10-27 15:30:23,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-27 15:30:23,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2018-10-27 15:30:23,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-27 15:30:23,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-10-27 15:30:23,575 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 55 [2018-10-27 15:30:23,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:30:23,576 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-10-27 15:30:23,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-27 15:30:23,576 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-10-27 15:30:23,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-27 15:30:23,577 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:30:23,577 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:30:23,577 INFO L424 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:30:23,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:30:23,577 INFO L82 PathProgramCache]: Analyzing trace with hash 823402876, now seen corresponding path program 7 times [2018-10-27 15:30:23,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:30:23,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:30:23,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:30:23,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:30:23,579 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:30:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:30:24,425 WARN L179 SmtUtils]: Spent 705.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 28 [2018-10-27 15:30:25,773 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:30:25,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:30:25,774 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:30:25,774 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:30:25,774 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:30:25,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:30:25,774 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 15:30:25,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:30:25,781 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 15:30:25,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:30:25,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:30:25,954 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 15:30:25,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:25,967 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 15:30:25,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:25,981 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 15:30:25,981 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:30,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 36 [2018-10-27 15:30:30,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 15:30:30,104 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:30,117 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:30,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 31 [2018-10-27 15:30:30,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 15:30:30,125 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:30,134 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:30,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-27 15:30:30,167 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:445, output treesize:66 [2018-10-27 15:30:30,788 WARN L179 SmtUtils]: Spent 451.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-27 15:30:31,588 WARN L179 SmtUtils]: Spent 618.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-10-27 15:30:32,251 WARN L179 SmtUtils]: Spent 542.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-10-27 15:30:32,483 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2018-10-27 15:30:33,228 WARN L179 SmtUtils]: Spent 611.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-10-27 15:30:34,006 WARN L179 SmtUtils]: Spent 642.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-10-27 15:30:35,132 WARN L179 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2018-10-27 15:30:35,430 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-10-27 15:30:38,595 WARN L179 SmtUtils]: Spent 2.73 s on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2018-10-27 15:30:38,905 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:30:38,906 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:30:39,206 WARN L179 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 82 [2018-10-27 15:30:39,343 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2018-10-27 15:30:40,061 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-10-27 15:30:41,185 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2018-10-27 15:30:41,912 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-10-27 15:30:42,293 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-27 15:30:42,681 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-10-27 15:30:43,346 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-10-27 15:30:43,805 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-10-27 15:30:44,664 WARN L179 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2018-10-27 15:30:45,696 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-10-27 15:30:46,383 WARN L179 SmtUtils]: Spent 448.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-10-27 15:30:47,125 WARN L179 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2018-10-27 15:30:48,421 WARN L179 SmtUtils]: Spent 669.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-10-27 15:30:48,468 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:30:48,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:30:48,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 23] total 59 [2018-10-27 15:30:48,489 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:30:48,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-27 15:30:48,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-27 15:30:48,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=3136, Unknown=0, NotChecked=0, Total=3422 [2018-10-27 15:30:48,491 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 38 states. [2018-10-27 15:30:49,380 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2018-10-27 15:30:50,691 WARN L179 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2018-10-27 15:30:53,812 WARN L179 SmtUtils]: Spent 815.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2018-10-27 15:30:54,663 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2018-10-27 15:30:55,664 WARN L179 SmtUtils]: Spent 834.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 76 [2018-10-27 15:30:57,872 WARN L179 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2018-10-27 15:31:00,831 WARN L179 SmtUtils]: Spent 2.78 s on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2018-10-27 15:31:01,093 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2018-10-27 15:31:01,307 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2018-10-27 15:31:01,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:31:01,611 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2018-10-27 15:31:01,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-27 15:31:01,611 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 55 [2018-10-27 15:31:01,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:31:01,612 INFO L225 Difference]: With dead ends: 75 [2018-10-27 15:31:01,613 INFO L226 Difference]: Without dead ends: 65 [2018-10-27 15:31:01,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 67 SyntacticMatches, 6 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1119 ImplicationChecksByTransitivity, 31.4s TimeCoverageRelationStatistics Valid=490, Invalid=4621, Unknown=1, NotChecked=0, Total=5112 [2018-10-27 15:31:01,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-27 15:31:01,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-10-27 15:31:01,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-27 15:31:01,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-10-27 15:31:01,625 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 55 [2018-10-27 15:31:01,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:31:01,626 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-10-27 15:31:01,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-27 15:31:01,626 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-10-27 15:31:01,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-27 15:31:01,627 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:31:01,627 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:31:01,627 INFO L424 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:31:01,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:31:01,627 INFO L82 PathProgramCache]: Analyzing trace with hash -62874888, now seen corresponding path program 7 times [2018-10-27 15:31:01,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:31:01,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:31:01,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:31:01,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:31:01,628 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:31:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:31:05,435 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 32 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:31:05,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:31:05,435 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:31:05,435 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:31:05,436 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:31:05,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:31:05,436 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 15:31:05,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:31:05,445 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 15:31:05,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:31:05,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:31:05,602 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 32 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:31:05,602 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:31:05,965 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 32 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:31:05,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:31:05,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2018-10-27 15:31:05,987 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:31:05,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-27 15:31:05,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-27 15:31:05,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=542, Unknown=0, NotChecked=0, Total=756 [2018-10-27 15:31:05,988 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 19 states. [2018-10-27 15:31:06,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:31:06,350 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2018-10-27 15:31:06,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 15:31:06,351 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-10-27 15:31:06,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:31:06,351 INFO L225 Difference]: With dead ends: 87 [2018-10-27 15:31:06,352 INFO L226 Difference]: Without dead ends: 74 [2018-10-27 15:31:06,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=214, Invalid=542, Unknown=0, NotChecked=0, Total=756 [2018-10-27 15:31:06,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-27 15:31:06,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2018-10-27 15:31:06,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-27 15:31:06,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2018-10-27 15:31:06,361 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 60 [2018-10-27 15:31:06,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:31:06,361 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2018-10-27 15:31:06,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-27 15:31:06,362 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-10-27 15:31:06,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-27 15:31:06,362 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:31:06,362 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:31:06,362 INFO L424 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:31:06,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:31:06,363 INFO L82 PathProgramCache]: Analyzing trace with hash -649680902, now seen corresponding path program 8 times [2018-10-27 15:31:06,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:31:06,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:31:06,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:31:06,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:31:06,364 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:31:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:31:08,781 WARN L179 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 126 DAG size of output: 24 [2018-10-27 15:31:09,987 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 45 [2018-10-27 15:31:10,234 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 53 [2018-10-27 15:31:10,507 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 44 [2018-10-27 15:31:10,794 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 44 [2018-10-27 15:31:21,256 WARN L179 SmtUtils]: Spent 10.14 s on a formula simplification. DAG size of input: 87 DAG size of output: 36 [2018-10-27 15:31:21,294 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:31:21,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:31:21,294 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:31:21,294 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:31:21,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:31:21,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:31:21,295 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 15:31:21,307 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 15:31:21,307 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown