java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array_true-unreach-call4_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 10:32:15,372 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 10:32:15,374 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 10:32:15,389 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 10:32:15,389 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 10:32:15,391 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 10:32:15,392 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 10:32:15,394 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 10:32:15,398 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 10:32:15,399 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 10:32:15,401 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 10:32:15,401 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 10:32:15,402 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 10:32:15,403 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 10:32:15,404 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 10:32:15,407 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 10:32:15,414 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 10:32:15,416 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 10:32:15,424 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 10:32:15,426 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 10:32:15,427 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 10:32:15,428 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 10:32:15,430 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 10:32:15,430 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 10:32:15,430 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 10:32:15,431 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 10:32:15,432 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 10:32:15,433 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 10:32:15,434 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 10:32:15,435 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 10:32:15,435 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 10:32:15,436 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 10:32:15,436 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 10:32:15,436 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 10:32:15,437 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 10:32:15,437 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 10:32:15,438 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 10:32:15,465 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 10:32:15,465 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 10:32:15,466 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 10:32:15,466 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 10:32:15,467 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 10:32:15,467 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 10:32:15,467 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 10:32:15,467 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 10:32:15,467 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 10:32:15,468 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 10:32:15,468 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 10:32:15,468 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 10:32:15,468 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 10:32:15,468 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 10:32:15,469 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 10:32:15,469 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 10:32:15,469 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 10:32:15,470 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 10:32:15,470 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 10:32:15,470 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 10:32:15,470 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 10:32:15,470 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 10:32:15,471 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 10:32:15,471 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 10:32:15,471 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 10:32:15,471 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 10:32:15,471 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:32:15,471 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 10:32:15,472 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 10:32:15,472 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 10:32:15,472 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 10:32:15,472 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 10:32:15,472 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 10:32:15,473 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 10:32:15,473 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 10:32:15,473 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 10:32:15,521 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 10:32:15,536 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 10:32:15,540 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 10:32:15,541 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 10:32:15,542 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 10:32:15,543 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_true-unreach-call4_true-termination.i [2018-11-07 10:32:15,603 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a136f8c/b824099574f84dd8a45a90d7700e0e1e/FLAG8d7527b79 [2018-11-07 10:32:16,084 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 10:32:16,087 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_true-unreach-call4_true-termination.i [2018-11-07 10:32:16,095 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a136f8c/b824099574f84dd8a45a90d7700e0e1e/FLAG8d7527b79 [2018-11-07 10:32:16,117 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a136f8c/b824099574f84dd8a45a90d7700e0e1e [2018-11-07 10:32:16,131 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 10:32:16,132 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 10:32:16,133 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 10:32:16,134 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 10:32:16,139 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 10:32:16,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:32:16" (1/1) ... [2018-11-07 10:32:16,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6afa0154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:32:16, skipping insertion in model container [2018-11-07 10:32:16,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:32:16" (1/1) ... [2018-11-07 10:32:16,155 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 10:32:16,185 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 10:32:16,410 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:32:16,414 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 10:32:16,436 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:32:16,459 INFO L193 MainTranslator]: Completed translation [2018-11-07 10:32:16,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:32:16 WrapperNode [2018-11-07 10:32:16,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 10:32:16,461 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 10:32:16,461 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 10:32:16,461 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 10:32:16,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:32:16" (1/1) ... [2018-11-07 10:32:16,481 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:32:16" (1/1) ... [2018-11-07 10:32:16,488 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 10:32:16,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 10:32:16,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 10:32:16,489 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 10:32:16,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:32:16" (1/1) ... [2018-11-07 10:32:16,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:32:16" (1/1) ... [2018-11-07 10:32:16,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:32:16" (1/1) ... [2018-11-07 10:32:16,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:32:16" (1/1) ... [2018-11-07 10:32:16,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:32:16" (1/1) ... [2018-11-07 10:32:16,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:32:16" (1/1) ... [2018-11-07 10:32:16,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:32:16" (1/1) ... [2018-11-07 10:32:16,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 10:32:16,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 10:32:16,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 10:32:16,517 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 10:32:16,518 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:32:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:32:16,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 10:32:16,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 10:32:16,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 10:32:16,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 10:32:16,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 10:32:16,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 10:32:16,641 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 10:32:16,641 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 10:32:16,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 10:32:16,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 10:32:16,641 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 10:32:16,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 10:32:17,089 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 10:32:17,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:32:17 BoogieIcfgContainer [2018-11-07 10:32:17,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 10:32:17,090 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 10:32:17,090 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 10:32:17,094 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 10:32:17,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:32:16" (1/3) ... [2018-11-07 10:32:17,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5017f4b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:32:17, skipping insertion in model container [2018-11-07 10:32:17,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:32:16" (2/3) ... [2018-11-07 10:32:17,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5017f4b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:32:17, skipping insertion in model container [2018-11-07 10:32:17,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:32:17" (3/3) ... [2018-11-07 10:32:17,097 INFO L112 eAbstractionObserver]: Analyzing ICFG array_true-unreach-call4_true-termination.i [2018-11-07 10:32:17,108 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 10:32:17,117 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 10:32:17,134 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 10:32:17,167 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 10:32:17,167 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 10:32:17,167 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 10:32:17,167 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 10:32:17,167 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 10:32:17,167 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 10:32:17,168 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 10:32:17,168 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 10:32:17,187 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-07 10:32:17,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 10:32:17,193 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:17,195 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:17,197 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:17,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:17,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1537618980, now seen corresponding path program 1 times [2018-11-07 10:32:17,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:17,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:17,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:32:17,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:17,259 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:17,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:32:17,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:32:17,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 10:32:17,341 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:32:17,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 10:32:17,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 10:32:17,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 10:32:17,362 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-07 10:32:17,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:32:17,384 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-11-07 10:32:17,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 10:32:17,386 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-07 10:32:17,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:32:17,395 INFO L225 Difference]: With dead ends: 50 [2018-11-07 10:32:17,395 INFO L226 Difference]: Without dead ends: 23 [2018-11-07 10:32:17,399 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 10:32:17,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-07 10:32:17,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-07 10:32:17,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-07 10:32:17,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-07 10:32:17,436 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 15 [2018-11-07 10:32:17,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:32:17,437 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-07 10:32:17,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 10:32:17,437 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-07 10:32:17,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-07 10:32:17,438 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:17,438 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:17,439 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:17,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:17,439 INFO L82 PathProgramCache]: Analyzing trace with hash -131902987, now seen corresponding path program 1 times [2018-11-07 10:32:17,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:17,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:17,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:32:17,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:17,441 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:17,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:32:17,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:32:17,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:32:17,511 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:32:17,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:32:17,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:32:17,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:32:17,514 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 3 states. [2018-11-07 10:32:17,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:32:17,615 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-11-07 10:32:17,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:32:17,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-07 10:32:17,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:32:17,618 INFO L225 Difference]: With dead ends: 44 [2018-11-07 10:32:17,619 INFO L226 Difference]: Without dead ends: 33 [2018-11-07 10:32:17,620 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:32:17,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-07 10:32:17,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2018-11-07 10:32:17,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-07 10:32:17,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-07 10:32:17,627 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 18 [2018-11-07 10:32:17,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:32:17,628 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-07 10:32:17,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:32:17,628 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-07 10:32:17,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 10:32:17,629 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:17,629 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:17,629 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:17,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:17,630 INFO L82 PathProgramCache]: Analyzing trace with hash 154158618, now seen corresponding path program 1 times [2018-11-07 10:32:17,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:17,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:17,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:32:17,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:17,632 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:17,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:32:17,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:17,744 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:32:17,745 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-11-07 10:32:17,747 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [10], [13], [15], [16], [17], [19], [23], [24], [28], [29], [32], [44], [47], [49], [55], [56], [57], [59] [2018-11-07 10:32:17,779 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:32:17,779 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:32:17,979 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:32:17,981 INFO L272 AbstractInterpreter]: Visited 22 different actions 34 times. Merged at 5 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 16 variables. [2018-11-07 10:32:17,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:18,000 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:32:18,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:18,000 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:32:18,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:32:18,012 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:32:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:18,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:32:18,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:32:18,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:32:18,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:32:18,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:32:18,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-07 10:32:18,251 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:32:18,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:32:18,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:32:18,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:32:18,253 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 5 states. [2018-11-07 10:32:18,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:32:18,473 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-11-07 10:32:18,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 10:32:18,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-07 10:32:18,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:32:18,476 INFO L225 Difference]: With dead ends: 54 [2018-11-07 10:32:18,476 INFO L226 Difference]: Without dead ends: 43 [2018-11-07 10:32:18,477 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:32:18,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-07 10:32:18,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-11-07 10:32:18,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-07 10:32:18,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-07 10:32:18,483 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 23 [2018-11-07 10:32:18,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:32:18,484 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-07 10:32:18,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:32:18,484 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-07 10:32:18,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-07 10:32:18,485 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:18,485 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:18,486 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:18,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:18,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1564418325, now seen corresponding path program 2 times [2018-11-07 10:32:18,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:18,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:18,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:32:18,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:18,488 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:18,689 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:32:18,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:18,690 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:32:18,690 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:32:18,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:32:18,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:18,691 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:32:18,708 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:32:18,708 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:32:18,735 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-07 10:32:18,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:32:18,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:32:18,803 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-07 10:32:18,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:32:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-07 10:32:18,898 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:32:18,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5] total 11 [2018-11-07 10:32:18,899 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:32:18,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:32:18,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:32:18,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 10:32:18,900 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 5 states. [2018-11-07 10:32:19,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:32:19,065 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-11-07 10:32:19,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:32:19,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-07 10:32:19,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:32:19,068 INFO L225 Difference]: With dead ends: 39 [2018-11-07 10:32:19,068 INFO L226 Difference]: Without dead ends: 34 [2018-11-07 10:32:19,069 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-07 10:32:19,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-07 10:32:19,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-07 10:32:19,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-07 10:32:19,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-07 10:32:19,074 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2018-11-07 10:32:19,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:32:19,075 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-07 10:32:19,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:32:19,075 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-07 10:32:19,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-07 10:32:19,077 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:19,077 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:19,077 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:19,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:19,077 INFO L82 PathProgramCache]: Analyzing trace with hash -582131022, now seen corresponding path program 1 times [2018-11-07 10:32:19,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:19,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:19,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:32:19,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:19,079 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:19,159 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 10:32:19,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:19,159 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:32:19,159 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-11-07 10:32:19,160 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [10], [13], [15], [16], [17], [19], [23], [24], [28], [29], [32], [34], [36], [44], [47], [49], [55], [56], [57], [59] [2018-11-07 10:32:19,162 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:32:19,162 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:32:19,247 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:32:19,247 INFO L272 AbstractInterpreter]: Visited 24 different actions 54 times. Merged at 10 different actions 20 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 17 variables. [2018-11-07 10:32:19,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:19,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:32:19,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:19,256 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:32:19,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:32:19,266 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:32:19,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:19,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:32:19,345 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 10:32:19,346 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:32:19,414 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 10:32:19,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:32:19,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-07 10:32:19,435 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:32:19,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:32:19,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:32:19,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-07 10:32:19,437 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 6 states. [2018-11-07 10:32:19,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:32:19,631 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-07 10:32:19,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:32:19,634 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-11-07 10:32:19,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:32:19,635 INFO L225 Difference]: With dead ends: 66 [2018-11-07 10:32:19,635 INFO L226 Difference]: Without dead ends: 52 [2018-11-07 10:32:19,636 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-07 10:32:19,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-07 10:32:19,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 38. [2018-11-07 10:32:19,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-07 10:32:19,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-11-07 10:32:19,651 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 32 [2018-11-07 10:32:19,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:32:19,652 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-11-07 10:32:19,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:32:19,652 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-07 10:32:19,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-07 10:32:19,655 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:19,655 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:19,656 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:19,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:19,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1196798487, now seen corresponding path program 2 times [2018-11-07 10:32:19,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:19,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:19,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:32:19,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:19,660 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:19,964 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 10:32:19,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:19,965 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:32:19,965 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:32:19,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:32:19,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:19,966 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:32:19,983 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:32:19,983 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:32:20,015 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 10:32:20,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:32:20,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:32:20,065 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 10:32:20,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:32:20,150 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 10:32:20,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:32:20,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2018-11-07 10:32:20,170 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:32:20,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 10:32:20,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 10:32:20,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-07 10:32:20,171 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 9 states. [2018-11-07 10:32:20,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:32:20,331 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-11-07 10:32:20,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 10:32:20,332 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-11-07 10:32:20,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:32:20,334 INFO L225 Difference]: With dead ends: 78 [2018-11-07 10:32:20,334 INFO L226 Difference]: Without dead ends: 59 [2018-11-07 10:32:20,335 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-07 10:32:20,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-07 10:32:20,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-11-07 10:32:20,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-07 10:32:20,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-11-07 10:32:20,343 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 37 [2018-11-07 10:32:20,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:32:20,344 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-11-07 10:32:20,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 10:32:20,344 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-11-07 10:32:20,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-07 10:32:20,345 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:20,345 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:20,346 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:20,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:20,346 INFO L82 PathProgramCache]: Analyzing trace with hash 692438953, now seen corresponding path program 3 times [2018-11-07 10:32:20,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:20,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:20,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:32:20,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:20,347 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:20,456 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 10:32:20,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:20,457 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:32:20,457 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:32:20,457 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:32:20,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:20,457 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:32:20,467 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:32:20,467 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:32:20,517 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:32:20,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:32:20,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:32:20,543 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 10:32:20,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:32:20,714 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 10:32:20,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:32:20,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-07 10:32:20,734 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:32:20,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 10:32:20,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 10:32:20,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-07 10:32:20,736 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 8 states. [2018-11-07 10:32:21,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:32:21,005 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2018-11-07 10:32:21,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 10:32:21,006 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-11-07 10:32:21,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:32:21,008 INFO L225 Difference]: With dead ends: 95 [2018-11-07 10:32:21,008 INFO L226 Difference]: Without dead ends: 69 [2018-11-07 10:32:21,010 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-07 10:32:21,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-07 10:32:21,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2018-11-07 10:32:21,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-07 10:32:21,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-11-07 10:32:21,017 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 54 [2018-11-07 10:32:21,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:32:21,018 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-11-07 10:32:21,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 10:32:21,018 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-07 10:32:21,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 10:32:21,019 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:21,019 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:21,020 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:21,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:21,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1898597710, now seen corresponding path program 4 times [2018-11-07 10:32:21,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:21,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:21,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:32:21,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:21,022 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:21,186 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 10:32:21,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:21,187 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:32:21,187 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:32:21,187 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:32:21,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:21,187 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:32:21,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:32:21,212 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:32:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:21,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:32:21,269 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 10:32:21,270 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:32:21,423 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 10:32:21,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:32:21,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-11-07 10:32:21,444 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:32:21,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 10:32:21,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 10:32:21,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-07 10:32:21,445 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 9 states. [2018-11-07 10:32:21,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:32:21,557 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-11-07 10:32:21,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 10:32:21,558 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2018-11-07 10:32:21,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:32:21,560 INFO L225 Difference]: With dead ends: 105 [2018-11-07 10:32:21,560 INFO L226 Difference]: Without dead ends: 79 [2018-11-07 10:32:21,562 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-07 10:32:21,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-07 10:32:21,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 65. [2018-11-07 10:32:21,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-07 10:32:21,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-11-07 10:32:21,569 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 59 [2018-11-07 10:32:21,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:32:21,570 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-11-07 10:32:21,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 10:32:21,570 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-11-07 10:32:21,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-07 10:32:21,571 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:21,571 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:21,572 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:21,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:21,572 INFO L82 PathProgramCache]: Analyzing trace with hash -2048882999, now seen corresponding path program 5 times [2018-11-07 10:32:21,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:21,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:21,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:32:21,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:21,573 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:22,342 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 10:32:22,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:22,343 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:32:22,343 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:32:22,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:32:22,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:22,344 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:32:22,352 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:32:22,352 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:32:22,381 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-07 10:32:22,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:32:22,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:32:22,447 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-07 10:32:22,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:32:22,630 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-07 10:32:22,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:32:22,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2018-11-07 10:32:22,652 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:32:22,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 10:32:22,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 10:32:22,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-11-07 10:32:22,653 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 12 states. [2018-11-07 10:32:22,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:32:22,822 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2018-11-07 10:32:22,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 10:32:22,822 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2018-11-07 10:32:22,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:32:22,824 INFO L225 Difference]: With dead ends: 117 [2018-11-07 10:32:22,824 INFO L226 Difference]: Without dead ends: 86 [2018-11-07 10:32:22,826 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2018-11-07 10:32:22,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-07 10:32:22,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2018-11-07 10:32:22,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-07 10:32:22,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2018-11-07 10:32:22,833 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 64 [2018-11-07 10:32:22,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:32:22,834 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2018-11-07 10:32:22,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 10:32:22,834 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2018-11-07 10:32:22,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-07 10:32:22,836 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:22,836 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:22,836 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:22,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:22,837 INFO L82 PathProgramCache]: Analyzing trace with hash -478550523, now seen corresponding path program 6 times [2018-11-07 10:32:22,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:22,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:22,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:32:22,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:22,838 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:22,985 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 10:32:22,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:22,986 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:32:22,986 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:32:22,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:32:22,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:22,987 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:32:22,999 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:32:22,999 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:32:23,038 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:32:23,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:32:23,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:32:23,091 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 10:32:23,091 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:32:23,271 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 10:32:23,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:32:23,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-11-07 10:32:23,293 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:32:23,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 10:32:23,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 10:32:23,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-07 10:32:23,294 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 11 states. [2018-11-07 10:32:23,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:32:23,375 INFO L93 Difference]: Finished difference Result 134 states and 137 transitions. [2018-11-07 10:32:23,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 10:32:23,375 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 81 [2018-11-07 10:32:23,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:32:23,377 INFO L225 Difference]: With dead ends: 134 [2018-11-07 10:32:23,377 INFO L226 Difference]: Without dead ends: 96 [2018-11-07 10:32:23,379 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-07 10:32:23,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-07 10:32:23,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2018-11-07 10:32:23,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-07 10:32:23,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-11-07 10:32:23,386 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 81 [2018-11-07 10:32:23,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:32:23,387 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-11-07 10:32:23,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 10:32:23,387 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-11-07 10:32:23,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-07 10:32:23,388 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:23,388 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:23,389 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:23,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:23,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1666973376, now seen corresponding path program 7 times [2018-11-07 10:32:23,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:23,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:23,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:32:23,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:23,390 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:23,593 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 10:32:23,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:23,593 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:32:23,593 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:32:23,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:32:23,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:23,594 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:32:23,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:32:23,603 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:32:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:23,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:32:23,667 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 10:32:23,667 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:32:23,886 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 10:32:23,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:32:23,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-11-07 10:32:23,907 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:32:23,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 10:32:23,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 10:32:23,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-07 10:32:23,909 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 12 states. [2018-11-07 10:32:24,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:32:24,038 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2018-11-07 10:32:24,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 10:32:24,039 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 86 [2018-11-07 10:32:24,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:32:24,040 INFO L225 Difference]: With dead ends: 144 [2018-11-07 10:32:24,041 INFO L226 Difference]: Without dead ends: 106 [2018-11-07 10:32:24,042 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-07 10:32:24,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-07 10:32:24,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 92. [2018-11-07 10:32:24,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-07 10:32:24,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2018-11-07 10:32:24,049 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 86 [2018-11-07 10:32:24,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:32:24,050 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2018-11-07 10:32:24,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 10:32:24,050 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2018-11-07 10:32:24,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-07 10:32:24,052 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:24,052 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:24,052 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:24,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:24,053 INFO L82 PathProgramCache]: Analyzing trace with hash -2059357467, now seen corresponding path program 8 times [2018-11-07 10:32:24,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:24,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:24,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:32:24,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:24,054 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:24,273 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 10:32:24,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:24,273 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:32:24,274 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:32:24,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:32:24,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:24,274 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:32:24,286 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:32:24,287 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:32:24,349 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-07 10:32:24,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:32:24,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:32:24,478 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-11-07 10:32:24,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:32:24,753 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-11-07 10:32:24,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:32:24,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 25 [2018-11-07 10:32:24,775 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:32:24,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 10:32:24,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 10:32:24,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=380, Unknown=0, NotChecked=0, Total=600 [2018-11-07 10:32:24,776 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 15 states. [2018-11-07 10:32:25,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:32:25,041 INFO L93 Difference]: Finished difference Result 156 states and 161 transitions. [2018-11-07 10:32:25,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 10:32:25,041 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 91 [2018-11-07 10:32:25,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:32:25,043 INFO L225 Difference]: With dead ends: 156 [2018-11-07 10:32:25,043 INFO L226 Difference]: Without dead ends: 113 [2018-11-07 10:32:25,044 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=226, Invalid=424, Unknown=0, NotChecked=0, Total=650 [2018-11-07 10:32:25,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-07 10:32:25,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2018-11-07 10:32:25,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-07 10:32:25,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-11-07 10:32:25,053 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 91 [2018-11-07 10:32:25,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:32:25,053 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-11-07 10:32:25,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 10:32:25,053 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-11-07 10:32:25,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-07 10:32:25,056 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:25,056 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:25,057 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:25,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:25,057 INFO L82 PathProgramCache]: Analyzing trace with hash -988518089, now seen corresponding path program 9 times [2018-11-07 10:32:25,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:25,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:25,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:32:25,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:25,058 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:25,294 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 10:32:25,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:25,295 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:32:25,295 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:32:25,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:32:25,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:25,295 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:32:25,303 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:32:25,303 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:32:25,445 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:32:25,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:32:25,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:32:25,491 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 10:32:25,491 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:32:25,917 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 10:32:25,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:32:25,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-11-07 10:32:25,938 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:32:25,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 10:32:25,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 10:32:25,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-07 10:32:25,939 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 14 states. [2018-11-07 10:32:26,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:32:26,066 INFO L93 Difference]: Finished difference Result 173 states and 176 transitions. [2018-11-07 10:32:26,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 10:32:26,067 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 108 [2018-11-07 10:32:26,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:32:26,068 INFO L225 Difference]: With dead ends: 173 [2018-11-07 10:32:26,069 INFO L226 Difference]: Without dead ends: 123 [2018-11-07 10:32:26,070 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-07 10:32:26,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-07 10:32:26,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 114. [2018-11-07 10:32:26,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-07 10:32:26,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2018-11-07 10:32:26,080 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 108 [2018-11-07 10:32:26,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:32:26,080 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2018-11-07 10:32:26,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 10:32:26,080 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2018-11-07 10:32:26,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-07 10:32:26,083 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:26,083 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:26,083 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:26,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:26,084 INFO L82 PathProgramCache]: Analyzing trace with hash 765337884, now seen corresponding path program 10 times [2018-11-07 10:32:26,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:26,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:26,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:32:26,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:26,091 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:26,989 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 10:32:26,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:26,990 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:32:26,990 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:32:26,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:32:26,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:26,991 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:32:27,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:32:27,005 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:32:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:27,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:32:27,114 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 10:32:27,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:32:27,489 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 10:32:27,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:32:27,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-11-07 10:32:27,509 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:32:27,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 10:32:27,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 10:32:27,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-07 10:32:27,511 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 15 states. [2018-11-07 10:32:27,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:32:27,674 INFO L93 Difference]: Finished difference Result 183 states and 187 transitions. [2018-11-07 10:32:27,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 10:32:27,675 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 113 [2018-11-07 10:32:27,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:32:27,676 INFO L225 Difference]: With dead ends: 183 [2018-11-07 10:32:27,676 INFO L226 Difference]: Without dead ends: 133 [2018-11-07 10:32:27,678 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-07 10:32:27,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-07 10:32:27,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 119. [2018-11-07 10:32:27,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-07 10:32:27,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-11-07 10:32:27,684 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 113 [2018-11-07 10:32:27,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:32:27,684 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-11-07 10:32:27,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 10:32:27,685 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-11-07 10:32:27,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-07 10:32:27,686 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:27,686 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:27,687 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:27,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:27,687 INFO L82 PathProgramCache]: Analyzing trace with hash -2141941673, now seen corresponding path program 11 times [2018-11-07 10:32:27,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:27,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:27,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:32:27,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:27,688 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:27,896 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 10:32:27,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:27,896 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:32:27,896 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:32:27,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:32:27,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:27,897 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:32:27,905 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:32:27,906 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:32:28,009 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-07 10:32:28,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:32:28,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:32:28,091 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2018-11-07 10:32:28,091 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:32:28,396 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2018-11-07 10:32:28,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:32:28,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 31 [2018-11-07 10:32:28,425 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:32:28,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 10:32:28,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 10:32:28,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=569, Unknown=0, NotChecked=0, Total=930 [2018-11-07 10:32:28,426 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 18 states. [2018-11-07 10:32:28,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:32:28,619 INFO L93 Difference]: Finished difference Result 195 states and 200 transitions. [2018-11-07 10:32:28,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 10:32:28,620 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 118 [2018-11-07 10:32:28,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:32:28,621 INFO L225 Difference]: With dead ends: 195 [2018-11-07 10:32:28,622 INFO L226 Difference]: Without dead ends: 140 [2018-11-07 10:32:28,623 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=367, Invalid=625, Unknown=0, NotChecked=0, Total=992 [2018-11-07 10:32:28,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-07 10:32:28,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 136. [2018-11-07 10:32:28,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-07 10:32:28,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2018-11-07 10:32:28,631 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 118 [2018-11-07 10:32:28,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:32:28,632 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2018-11-07 10:32:28,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 10:32:28,632 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2018-11-07 10:32:28,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-07 10:32:28,633 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:28,633 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:28,634 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:28,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:28,634 INFO L82 PathProgramCache]: Analyzing trace with hash -619705133, now seen corresponding path program 12 times [2018-11-07 10:32:28,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:28,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:28,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:32:28,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:28,638 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:28,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:28,842 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-07 10:32:28,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:28,842 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:32:28,842 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:32:28,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:32:28,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:28,842 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:32:28,857 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:32:28,857 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:32:29,090 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:32:29,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:32:29,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:32:29,132 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-07 10:32:29,133 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:32:29,639 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-07 10:32:29,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:32:29,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-11-07 10:32:29,669 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:32:29,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 10:32:29,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 10:32:29,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-07 10:32:29,670 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 17 states. [2018-11-07 10:32:29,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:32:29,820 INFO L93 Difference]: Finished difference Result 212 states and 215 transitions. [2018-11-07 10:32:29,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 10:32:29,821 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 135 [2018-11-07 10:32:29,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:32:29,822 INFO L225 Difference]: With dead ends: 212 [2018-11-07 10:32:29,822 INFO L226 Difference]: Without dead ends: 150 [2018-11-07 10:32:29,823 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-07 10:32:29,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-07 10:32:29,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 141. [2018-11-07 10:32:29,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-07 10:32:29,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-11-07 10:32:29,827 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 135 [2018-11-07 10:32:29,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:32:29,828 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-11-07 10:32:29,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 10:32:29,828 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-11-07 10:32:29,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-07 10:32:29,829 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:29,829 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:29,830 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:29,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:29,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1009225166, now seen corresponding path program 13 times [2018-11-07 10:32:29,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:29,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:29,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:32:29,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:29,831 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:30,122 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-07 10:32:30,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:30,123 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:32:30,123 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:32:30,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:32:30,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:30,123 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:32:30,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:32:30,132 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:32:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:30,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:32:30,286 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-07 10:32:30,287 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:32:30,685 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-07 10:32:30,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:32:30,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-11-07 10:32:30,705 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:32:30,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 10:32:30,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 10:32:30,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 10:32:30,706 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 18 states. [2018-11-07 10:32:30,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:32:30,860 INFO L93 Difference]: Finished difference Result 222 states and 226 transitions. [2018-11-07 10:32:30,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 10:32:30,861 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 140 [2018-11-07 10:32:30,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:32:30,862 INFO L225 Difference]: With dead ends: 222 [2018-11-07 10:32:30,863 INFO L226 Difference]: Without dead ends: 160 [2018-11-07 10:32:30,864 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 10:32:30,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-07 10:32:30,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2018-11-07 10:32:30,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-07 10:32:30,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 147 transitions. [2018-11-07 10:32:30,869 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 147 transitions. Word has length 140 [2018-11-07 10:32:30,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:32:30,869 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 147 transitions. [2018-11-07 10:32:30,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 10:32:30,870 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 147 transitions. [2018-11-07 10:32:30,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-07 10:32:30,870 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:30,871 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 14, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:30,871 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:30,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:30,871 INFO L82 PathProgramCache]: Analyzing trace with hash 168849843, now seen corresponding path program 14 times [2018-11-07 10:32:30,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:30,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:30,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:32:30,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:30,872 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:31,821 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-07 10:32:31,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:31,822 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:32:31,822 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:32:31,822 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:32:31,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:31,822 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:32:31,831 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:32:31,831 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:32:32,078 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-11-07 10:32:32,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:32:32,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:32:32,175 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2018-11-07 10:32:32,176 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:32:32,809 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2018-11-07 10:32:32,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:32:32,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 37 [2018-11-07 10:32:32,832 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:32:32,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 10:32:32,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 10:32:32,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=794, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 10:32:32,833 INFO L87 Difference]: Start difference. First operand 146 states and 147 transitions. Second operand 21 states. [2018-11-07 10:32:33,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:32:33,012 INFO L93 Difference]: Finished difference Result 234 states and 239 transitions. [2018-11-07 10:32:33,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 10:32:33,012 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 145 [2018-11-07 10:32:33,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:32:33,014 INFO L225 Difference]: With dead ends: 234 [2018-11-07 10:32:33,014 INFO L226 Difference]: Without dead ends: 167 [2018-11-07 10:32:33,016 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=544, Invalid=862, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 10:32:33,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-07 10:32:33,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 163. [2018-11-07 10:32:33,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-07 10:32:33,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-11-07 10:32:33,021 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 145 [2018-11-07 10:32:33,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:32:33,021 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-11-07 10:32:33,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 10:32:33,021 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-11-07 10:32:33,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-07 10:32:33,022 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:33,023 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:33,023 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:33,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:33,023 INFO L82 PathProgramCache]: Analyzing trace with hash 914159813, now seen corresponding path program 15 times [2018-11-07 10:32:33,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:33,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:33,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:32:33,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:33,024 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:33,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-07 10:32:33,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:33,281 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:32:33,281 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:32:33,281 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:32:33,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:33,282 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:32:33,290 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:32:33,290 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:32:33,763 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:32:33,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:32:33,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:32:33,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-07 10:32:33,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:32:34,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-07 10:32:34,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:32:34,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-11-07 10:32:34,638 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:32:34,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 10:32:34,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 10:32:34,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 10:32:34,640 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 20 states. [2018-11-07 10:32:34,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:32:34,803 INFO L93 Difference]: Finished difference Result 251 states and 254 transitions. [2018-11-07 10:32:34,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 10:32:34,805 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 162 [2018-11-07 10:32:34,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:32:34,806 INFO L225 Difference]: With dead ends: 251 [2018-11-07 10:32:34,806 INFO L226 Difference]: Without dead ends: 177 [2018-11-07 10:32:34,807 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 10:32:34,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-07 10:32:34,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 168. [2018-11-07 10:32:34,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-07 10:32:34,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2018-11-07 10:32:34,812 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 162 [2018-11-07 10:32:34,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:32:34,813 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2018-11-07 10:32:34,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 10:32:34,813 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2018-11-07 10:32:34,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-07 10:32:34,814 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:34,814 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:34,814 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:34,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:34,814 INFO L82 PathProgramCache]: Analyzing trace with hash 2141696746, now seen corresponding path program 16 times [2018-11-07 10:32:34,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:34,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:34,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:32:34,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:34,816 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:35,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-07 10:32:35,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:35,167 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:32:35,168 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:32:35,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:32:35,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:35,168 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:32:35,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:32:35,177 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:32:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:35,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:32:35,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-07 10:32:35,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:32:36,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-07 10:32:36,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:32:36,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-11-07 10:32:36,030 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:32:36,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 10:32:36,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 10:32:36,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 10:32:36,032 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand 21 states. [2018-11-07 10:32:36,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:32:36,228 INFO L93 Difference]: Finished difference Result 261 states and 265 transitions. [2018-11-07 10:32:36,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 10:32:36,229 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 167 [2018-11-07 10:32:36,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:32:36,230 INFO L225 Difference]: With dead ends: 261 [2018-11-07 10:32:36,230 INFO L226 Difference]: Without dead ends: 187 [2018-11-07 10:32:36,231 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 10:32:36,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-07 10:32:36,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 173. [2018-11-07 10:32:36,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-07 10:32:36,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2018-11-07 10:32:36,236 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 167 [2018-11-07 10:32:36,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:32:36,236 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2018-11-07 10:32:36,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 10:32:36,237 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2018-11-07 10:32:36,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-07 10:32:36,237 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:36,238 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:36,238 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:36,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:36,238 INFO L82 PathProgramCache]: Analyzing trace with hash 88377317, now seen corresponding path program 17 times [2018-11-07 10:32:36,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:36,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:36,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:32:36,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:36,239 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:36,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1329 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-07 10:32:36,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:36,726 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:32:36,726 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:32:36,727 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:32:36,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:36,727 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:32:36,735 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:32:36,735 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:32:37,306 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-11-07 10:32:37,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:32:37,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:32:37,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1329 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2018-11-07 10:32:37,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:32:37,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1329 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2018-11-07 10:32:37,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:32:37,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 43 [2018-11-07 10:32:37,874 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:32:37,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 10:32:37,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 10:32:37,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=751, Invalid=1055, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 10:32:37,876 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 24 states. [2018-11-07 10:32:38,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:32:38,181 INFO L93 Difference]: Finished difference Result 273 states and 278 transitions. [2018-11-07 10:32:38,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 10:32:38,183 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 172 [2018-11-07 10:32:38,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:32:38,184 INFO L225 Difference]: With dead ends: 273 [2018-11-07 10:32:38,184 INFO L226 Difference]: Without dead ends: 194 [2018-11-07 10:32:38,185 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=757, Invalid=1135, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 10:32:38,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-07 10:32:38,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 190. [2018-11-07 10:32:38,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-11-07 10:32:38,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 191 transitions. [2018-11-07 10:32:38,190 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 191 transitions. Word has length 172 [2018-11-07 10:32:38,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:32:38,190 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 191 transitions. [2018-11-07 10:32:38,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 10:32:38,191 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 191 transitions. [2018-11-07 10:32:38,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-07 10:32:38,192 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:38,192 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:38,192 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:38,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:38,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1525477793, now seen corresponding path program 18 times [2018-11-07 10:32:38,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:38,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:38,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:32:38,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:38,193 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:38,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1634 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-07 10:32:38,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:38,531 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:32:38,531 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:32:38,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:32:38,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:38,531 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:32:38,540 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:32:38,540 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:32:39,316 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:32:39,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:32:39,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:32:39,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1634 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-07 10:32:39,358 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:32:39,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1634 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-07 10:32:39,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:32:39,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-11-07 10:32:39,861 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:32:39,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 10:32:39,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 10:32:39,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 10:32:39,863 INFO L87 Difference]: Start difference. First operand 190 states and 191 transitions. Second operand 23 states. [2018-11-07 10:32:40,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:32:40,277 INFO L93 Difference]: Finished difference Result 290 states and 293 transitions. [2018-11-07 10:32:40,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 10:32:40,280 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 189 [2018-11-07 10:32:40,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:32:40,281 INFO L225 Difference]: With dead ends: 290 [2018-11-07 10:32:40,281 INFO L226 Difference]: Without dead ends: 204 [2018-11-07 10:32:40,282 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 10:32:40,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-11-07 10:32:40,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 195. [2018-11-07 10:32:40,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-11-07 10:32:40,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2018-11-07 10:32:40,287 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 189 [2018-11-07 10:32:40,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:32:40,287 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2018-11-07 10:32:40,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 10:32:40,287 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2018-11-07 10:32:40,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-07 10:32:40,288 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:40,289 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:40,289 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:40,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:40,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1427376220, now seen corresponding path program 19 times [2018-11-07 10:32:40,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:40,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:40,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:32:40,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:40,290 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:41,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1731 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-07 10:32:41,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:41,709 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:32:41,709 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:32:41,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:32:41,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:41,709 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:32:41,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:32:41,717 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:32:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:41,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:32:41,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1731 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-07 10:32:41,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:32:42,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1731 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-07 10:32:42,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:32:42,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-11-07 10:32:42,527 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:32:42,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 10:32:42,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 10:32:42,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 10:32:42,529 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 24 states. [2018-11-07 10:32:42,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:32:42,706 INFO L93 Difference]: Finished difference Result 300 states and 304 transitions. [2018-11-07 10:32:42,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 10:32:42,706 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 194 [2018-11-07 10:32:42,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:32:42,708 INFO L225 Difference]: With dead ends: 300 [2018-11-07 10:32:42,708 INFO L226 Difference]: Without dead ends: 214 [2018-11-07 10:32:42,709 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 10:32:42,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-11-07 10:32:42,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 200. [2018-11-07 10:32:42,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-07 10:32:42,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 201 transitions. [2018-11-07 10:32:42,714 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 201 transitions. Word has length 194 [2018-11-07 10:32:42,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:32:42,714 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 201 transitions. [2018-11-07 10:32:42,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 10:32:42,714 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 201 transitions. [2018-11-07 10:32:42,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-07 10:32:42,715 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:42,716 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:42,716 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:42,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:42,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1694822017, now seen corresponding path program 20 times [2018-11-07 10:32:42,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:42,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:42,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:32:42,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:42,717 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:42,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:43,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1833 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-07 10:32:43,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:43,396 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:32:43,396 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:32:43,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:32:43,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:43,396 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:32:43,405 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:32:43,405 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:32:44,081 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-11-07 10:32:44,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:32:44,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:32:44,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1833 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2018-11-07 10:32:44,846 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:32:45,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1833 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2018-11-07 10:32:45,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:32:45,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 49 [2018-11-07 10:32:45,815 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:32:45,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 10:32:45,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 10:32:45,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1000, Invalid=1352, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 10:32:45,817 INFO L87 Difference]: Start difference. First operand 200 states and 201 transitions. Second operand 27 states. [2018-11-07 10:32:46,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:32:46,012 INFO L93 Difference]: Finished difference Result 312 states and 317 transitions. [2018-11-07 10:32:46,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 10:32:46,012 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 199 [2018-11-07 10:32:46,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:32:46,014 INFO L225 Difference]: With dead ends: 312 [2018-11-07 10:32:46,014 INFO L226 Difference]: Without dead ends: 221 [2018-11-07 10:32:46,016 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1006, Invalid=1444, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 10:32:46,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-11-07 10:32:46,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 217. [2018-11-07 10:32:46,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-07 10:32:46,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2018-11-07 10:32:46,022 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 199 [2018-11-07 10:32:46,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:32:46,022 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2018-11-07 10:32:46,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 10:32:46,023 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2018-11-07 10:32:46,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-07 10:32:46,024 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:46,024 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:46,024 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:46,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:46,025 INFO L82 PathProgramCache]: Analyzing trace with hash 2134603347, now seen corresponding path program 21 times [2018-11-07 10:32:46,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:46,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:46,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:32:46,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:46,026 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:47,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2189 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-07 10:32:47,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:47,354 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:32:47,354 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:32:47,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:32:47,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:47,354 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:32:47,362 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:32:47,363 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:32:48,528 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:32:48,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:32:48,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:32:48,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2189 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-07 10:32:48,658 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:32:49,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2189 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-07 10:32:49,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:32:49,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-11-07 10:32:49,724 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:32:49,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 10:32:49,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 10:32:49,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 10:32:49,726 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 26 states. [2018-11-07 10:32:49,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:32:49,991 INFO L93 Difference]: Finished difference Result 329 states and 332 transitions. [2018-11-07 10:32:49,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 10:32:49,991 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 216 [2018-11-07 10:32:49,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:32:49,993 INFO L225 Difference]: With dead ends: 329 [2018-11-07 10:32:49,993 INFO L226 Difference]: Without dead ends: 231 [2018-11-07 10:32:49,994 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 10:32:49,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-11-07 10:32:49,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 222. [2018-11-07 10:32:49,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-11-07 10:32:49,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 223 transitions. [2018-11-07 10:32:50,000 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 223 transitions. Word has length 216 [2018-11-07 10:32:50,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:32:50,000 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 223 transitions. [2018-11-07 10:32:50,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 10:32:50,000 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 223 transitions. [2018-11-07 10:32:50,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-07 10:32:50,001 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:50,002 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:50,002 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:50,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:50,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1141310136, now seen corresponding path program 22 times [2018-11-07 10:32:50,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:50,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:50,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:32:50,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:50,004 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:50,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:51,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-07 10:32:51,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:51,044 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:32:51,044 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:32:51,044 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:32:51,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:51,044 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:32:51,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:32:51,052 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:32:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:51,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:32:51,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-07 10:32:51,246 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:32:52,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-07 10:32:52,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:32:52,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-11-07 10:32:52,139 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:32:52,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 10:32:52,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 10:32:52,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 10:32:52,141 INFO L87 Difference]: Start difference. First operand 222 states and 223 transitions. Second operand 27 states. [2018-11-07 10:32:52,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:32:52,553 INFO L93 Difference]: Finished difference Result 339 states and 343 transitions. [2018-11-07 10:32:52,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 10:32:52,553 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 221 [2018-11-07 10:32:52,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:32:52,556 INFO L225 Difference]: With dead ends: 339 [2018-11-07 10:32:52,556 INFO L226 Difference]: Without dead ends: 241 [2018-11-07 10:32:52,558 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 10:32:52,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-11-07 10:32:52,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 227. [2018-11-07 10:32:52,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-11-07 10:32:52,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 228 transitions. [2018-11-07 10:32:52,563 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 228 transitions. Word has length 221 [2018-11-07 10:32:52,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:32:52,564 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 228 transitions. [2018-11-07 10:32:52,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 10:32:52,564 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 228 transitions. [2018-11-07 10:32:52,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-11-07 10:32:52,565 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:52,566 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:52,566 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:52,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:52,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1491889523, now seen corresponding path program 23 times [2018-11-07 10:32:52,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:52,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:52,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:32:52,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:52,567 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:53,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-07 10:32:53,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:53,819 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:32:53,819 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:32:53,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:32:53,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:53,820 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:32:53,829 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:32:53,829 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:32:55,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-11-07 10:32:55,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:32:55,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:32:55,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2018-11-07 10:32:55,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:32:55,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2018-11-07 10:32:55,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:32:55,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 55 [2018-11-07 10:32:55,964 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:32:55,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 10:32:55,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 10:32:55,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1285, Invalid=1685, Unknown=0, NotChecked=0, Total=2970 [2018-11-07 10:32:55,967 INFO L87 Difference]: Start difference. First operand 227 states and 228 transitions. Second operand 30 states. [2018-11-07 10:32:56,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:32:56,273 INFO L93 Difference]: Finished difference Result 351 states and 356 transitions. [2018-11-07 10:32:56,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 10:32:56,274 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 226 [2018-11-07 10:32:56,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:32:56,276 INFO L225 Difference]: With dead ends: 351 [2018-11-07 10:32:56,277 INFO L226 Difference]: Without dead ends: 248 [2018-11-07 10:32:56,278 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1291, Invalid=1789, Unknown=0, NotChecked=0, Total=3080 [2018-11-07 10:32:56,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-11-07 10:32:56,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 244. [2018-11-07 10:32:56,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-11-07 10:32:56,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 245 transitions. [2018-11-07 10:32:56,284 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 245 transitions. Word has length 226 [2018-11-07 10:32:56,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:32:56,284 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 245 transitions. [2018-11-07 10:32:56,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 10:32:56,284 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 245 transitions. [2018-11-07 10:32:56,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-11-07 10:32:56,286 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:56,286 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:56,286 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:56,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:56,287 INFO L82 PathProgramCache]: Analyzing trace with hash 760255599, now seen corresponding path program 24 times [2018-11-07 10:32:56,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:56,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:56,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:32:56,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:56,288 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:56,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2825 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-07 10:32:56,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:56,701 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:32:56,701 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:32:56,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:32:56,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:56,702 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:32:56,710 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:32:56,710 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:32:58,779 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:32:58,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:32:58,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:32:58,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2825 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-07 10:32:58,933 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:01,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2825 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-07 10:33:01,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:33:01,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-11-07 10:33:01,144 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:33:01,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-07 10:33:01,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-07 10:33:01,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-07 10:33:01,145 INFO L87 Difference]: Start difference. First operand 244 states and 245 transitions. Second operand 29 states. [2018-11-07 10:33:01,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:01,395 INFO L93 Difference]: Finished difference Result 368 states and 371 transitions. [2018-11-07 10:33:01,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 10:33:01,395 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 243 [2018-11-07 10:33:01,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:01,397 INFO L225 Difference]: With dead ends: 368 [2018-11-07 10:33:01,397 INFO L226 Difference]: Without dead ends: 258 [2018-11-07 10:33:01,398 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-07 10:33:01,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-07 10:33:01,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 249. [2018-11-07 10:33:01,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-11-07 10:33:01,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 250 transitions. [2018-11-07 10:33:01,404 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 250 transitions. Word has length 243 [2018-11-07 10:33:01,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:01,405 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 250 transitions. [2018-11-07 10:33:01,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-07 10:33:01,405 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 250 transitions. [2018-11-07 10:33:01,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-11-07 10:33:01,406 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:01,406 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 26, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:01,407 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:01,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:01,407 INFO L82 PathProgramCache]: Analyzing trace with hash 337998058, now seen corresponding path program 25 times [2018-11-07 10:33:01,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:01,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:01,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:33:01,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:01,408 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:02,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2952 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-07 10:33:02,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:02,112 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:02,112 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:33:02,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:33:02,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:02,113 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:33:02,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:02,121 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:33:02,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:02,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:02,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2952 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-07 10:33:02,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:03,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2952 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-07 10:33:03,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:33:03,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-11-07 10:33:03,352 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:33:03,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 10:33:03,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 10:33:03,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 10:33:03,354 INFO L87 Difference]: Start difference. First operand 249 states and 250 transitions. Second operand 30 states. [2018-11-07 10:33:03,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:03,596 INFO L93 Difference]: Finished difference Result 378 states and 382 transitions. [2018-11-07 10:33:03,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 10:33:03,596 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 248 [2018-11-07 10:33:03,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:03,598 INFO L225 Difference]: With dead ends: 378 [2018-11-07 10:33:03,598 INFO L226 Difference]: Without dead ends: 268 [2018-11-07 10:33:03,599 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 469 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 10:33:03,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-11-07 10:33:03,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 254. [2018-11-07 10:33:03,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-11-07 10:33:03,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 255 transitions. [2018-11-07 10:33:03,605 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 255 transitions. Word has length 248 [2018-11-07 10:33:03,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:03,605 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 255 transitions. [2018-11-07 10:33:03,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 10:33:03,605 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 255 transitions. [2018-11-07 10:33:03,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-11-07 10:33:03,607 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:03,607 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 26, 26, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:03,607 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:03,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:03,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1914820273, now seen corresponding path program 26 times [2018-11-07 10:33:03,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:03,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:03,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:03,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:03,609 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:04,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3084 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-07 10:33:04,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:04,100 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:04,100 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:33:04,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:33:04,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:04,100 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:33:04,109 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:33:04,109 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:33:07,019 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-11-07 10:33:07,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:33:07,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:07,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3084 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1809 trivial. 0 not checked. [2018-11-07 10:33:07,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:08,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3084 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1809 trivial. 0 not checked. [2018-11-07 10:33:08,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:33:08,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 61 [2018-11-07 10:33:08,278 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:33:08,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 10:33:08,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 10:33:08,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1606, Invalid=2054, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 10:33:08,280 INFO L87 Difference]: Start difference. First operand 254 states and 255 transitions. Second operand 33 states. [2018-11-07 10:33:08,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:08,636 INFO L93 Difference]: Finished difference Result 390 states and 395 transitions. [2018-11-07 10:33:08,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 10:33:08,637 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 253 [2018-11-07 10:33:08,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:08,639 INFO L225 Difference]: With dead ends: 390 [2018-11-07 10:33:08,639 INFO L226 Difference]: Without dead ends: 275 [2018-11-07 10:33:08,641 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 476 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1612, Invalid=2170, Unknown=0, NotChecked=0, Total=3782 [2018-11-07 10:33:08,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-11-07 10:33:08,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 271. [2018-11-07 10:33:08,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-11-07 10:33:08,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 272 transitions. [2018-11-07 10:33:08,646 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 272 transitions. Word has length 253 [2018-11-07 10:33:08,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:08,646 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 272 transitions. [2018-11-07 10:33:08,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 10:33:08,647 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 272 transitions. [2018-11-07 10:33:08,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-11-07 10:33:08,648 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:08,648 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:08,648 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:08,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:08,649 INFO L82 PathProgramCache]: Analyzing trace with hash 344711649, now seen corresponding path program 27 times [2018-11-07 10:33:08,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:08,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:08,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:33:08,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:08,650 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:09,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3542 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-11-07 10:33:09,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:09,136 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:09,137 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:33:09,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:33:09,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:09,137 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:33:09,145 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:33:09,145 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:33:12,067 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:33:12,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:33:12,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:12,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3542 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-11-07 10:33:12,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:13,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3542 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-11-07 10:33:13,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:33:13,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-11-07 10:33:13,320 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:33:13,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 10:33:13,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 10:33:13,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 10:33:13,322 INFO L87 Difference]: Start difference. First operand 271 states and 272 transitions. Second operand 32 states. [2018-11-07 10:33:13,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:13,626 INFO L93 Difference]: Finished difference Result 407 states and 410 transitions. [2018-11-07 10:33:13,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 10:33:13,627 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 270 [2018-11-07 10:33:13,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:13,628 INFO L225 Difference]: With dead ends: 407 [2018-11-07 10:33:13,628 INFO L226 Difference]: Without dead ends: 285 [2018-11-07 10:33:13,629 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 511 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 10:33:13,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-11-07 10:33:13,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 276. [2018-11-07 10:33:13,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-11-07 10:33:13,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 277 transitions. [2018-11-07 10:33:13,635 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 277 transitions. Word has length 270 [2018-11-07 10:33:13,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:13,636 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 277 transitions. [2018-11-07 10:33:13,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 10:33:13,636 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 277 transitions. [2018-11-07 10:33:13,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-11-07 10:33:13,637 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:13,638 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:13,638 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:13,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:13,638 INFO L82 PathProgramCache]: Analyzing trace with hash -537128826, now seen corresponding path program 28 times [2018-11-07 10:33:13,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:13,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:13,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:33:13,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:13,639 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:14,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3684 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-11-07 10:33:14,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:14,491 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:14,491 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:33:14,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:33:14,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:14,491 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:33:14,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:14,503 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:33:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:14,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:14,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3684 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-11-07 10:33:14,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:15,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3684 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-11-07 10:33:15,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:33:15,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-11-07 10:33:15,733 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:33:15,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 10:33:15,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 10:33:15,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-07 10:33:15,735 INFO L87 Difference]: Start difference. First operand 276 states and 277 transitions. Second operand 33 states. [2018-11-07 10:33:16,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:16,023 INFO L93 Difference]: Finished difference Result 417 states and 421 transitions. [2018-11-07 10:33:16,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 10:33:16,023 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 275 [2018-11-07 10:33:16,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:16,025 INFO L225 Difference]: With dead ends: 417 [2018-11-07 10:33:16,025 INFO L226 Difference]: Without dead ends: 295 [2018-11-07 10:33:16,026 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 520 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-07 10:33:16,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-11-07 10:33:16,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 281. [2018-11-07 10:33:16,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-11-07 10:33:16,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 282 transitions. [2018-11-07 10:33:16,032 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 282 transitions. Word has length 275 [2018-11-07 10:33:16,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:16,032 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 282 transitions. [2018-11-07 10:33:16,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 10:33:16,032 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 282 transitions. [2018-11-07 10:33:16,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-11-07 10:33:16,033 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:16,033 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 29, 29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:16,034 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:16,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:16,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1393049857, now seen corresponding path program 29 times [2018-11-07 10:33:16,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:16,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:16,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:16,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:16,035 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:16,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3831 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-11-07 10:33:16,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:16,618 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:16,618 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:33:16,619 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:33:16,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:16,619 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:33:16,627 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:33:16,627 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:33:25,439 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-11-07 10:33:25,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:33:25,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:25,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3831 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2018-11-07 10:33:25,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:26,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3831 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2018-11-07 10:33:26,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:33:26,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 67 [2018-11-07 10:33:26,661 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:33:26,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 10:33:26,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 10:33:26,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1963, Invalid=2459, Unknown=0, NotChecked=0, Total=4422 [2018-11-07 10:33:26,663 INFO L87 Difference]: Start difference. First operand 281 states and 282 transitions. Second operand 36 states. [2018-11-07 10:33:27,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:27,007 INFO L93 Difference]: Finished difference Result 429 states and 434 transitions. [2018-11-07 10:33:27,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 10:33:27,007 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 280 [2018-11-07 10:33:27,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:27,009 INFO L225 Difference]: With dead ends: 429 [2018-11-07 10:33:27,010 INFO L226 Difference]: Without dead ends: 302 [2018-11-07 10:33:27,011 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 527 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1969, Invalid=2587, Unknown=0, NotChecked=0, Total=4556 [2018-11-07 10:33:27,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-11-07 10:33:27,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2018-11-07 10:33:27,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-11-07 10:33:27,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 299 transitions. [2018-11-07 10:33:27,016 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 299 transitions. Word has length 280 [2018-11-07 10:33:27,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:27,016 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 299 transitions. [2018-11-07 10:33:27,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 10:33:27,016 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 299 transitions. [2018-11-07 10:33:27,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-11-07 10:33:27,017 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:27,017 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:27,017 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:27,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:27,018 INFO L82 PathProgramCache]: Analyzing trace with hash -990186179, now seen corresponding path program 30 times [2018-11-07 10:33:27,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:27,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:27,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:33:27,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:27,019 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:27,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:28,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4340 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-07 10:33:28,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:28,144 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:28,144 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:33:28,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:33:28,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:28,145 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:33:28,152 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:33:28,153 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:33:33,460 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:33:33,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:33:33,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:33,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4340 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-07 10:33:33,661 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:34,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4340 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-07 10:33:34,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:33:34,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-11-07 10:33:34,831 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:33:34,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 10:33:34,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 10:33:34,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-11-07 10:33:34,833 INFO L87 Difference]: Start difference. First operand 298 states and 299 transitions. Second operand 35 states. [2018-11-07 10:33:35,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:35,198 INFO L93 Difference]: Finished difference Result 446 states and 449 transitions. [2018-11-07 10:33:35,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-07 10:33:35,198 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 297 [2018-11-07 10:33:35,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:35,201 INFO L225 Difference]: With dead ends: 446 [2018-11-07 10:33:35,201 INFO L226 Difference]: Without dead ends: 312 [2018-11-07 10:33:35,202 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 562 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-11-07 10:33:35,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-11-07 10:33:35,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 303. [2018-11-07 10:33:35,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-11-07 10:33:35,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 304 transitions. [2018-11-07 10:33:35,208 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 304 transitions. Word has length 297 [2018-11-07 10:33:35,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:35,208 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 304 transitions. [2018-11-07 10:33:35,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-07 10:33:35,208 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 304 transitions. [2018-11-07 10:33:35,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-11-07 10:33:35,210 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:35,210 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:35,211 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:35,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:35,211 INFO L82 PathProgramCache]: Analyzing trace with hash 429377400, now seen corresponding path program 31 times [2018-11-07 10:33:35,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:35,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:35,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:33:35,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:35,212 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:35,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4497 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-07 10:33:35,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:35,957 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:35,958 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:33:35,958 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:33:35,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:35,958 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:33:35,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:35,966 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:33:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:36,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:36,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4497 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-07 10:33:36,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:37,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4497 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-07 10:33:37,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:33:37,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-11-07 10:33:37,482 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:33:37,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 10:33:37,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 10:33:37,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 10:33:37,484 INFO L87 Difference]: Start difference. First operand 303 states and 304 transitions. Second operand 36 states. [2018-11-07 10:33:37,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:37,909 INFO L93 Difference]: Finished difference Result 456 states and 460 transitions. [2018-11-07 10:33:37,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 10:33:37,910 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 302 [2018-11-07 10:33:37,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:37,911 INFO L225 Difference]: With dead ends: 456 [2018-11-07 10:33:37,911 INFO L226 Difference]: Without dead ends: 322 [2018-11-07 10:33:37,912 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 571 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 10:33:37,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-11-07 10:33:37,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 308. [2018-11-07 10:33:37,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-11-07 10:33:37,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 309 transitions. [2018-11-07 10:33:37,919 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 309 transitions. Word has length 302 [2018-11-07 10:33:37,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:37,919 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 309 transitions. [2018-11-07 10:33:37,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 10:33:37,919 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 309 transitions. [2018-11-07 10:33:37,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-11-07 10:33:37,921 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:37,921 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 32, 32, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:37,921 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:37,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:37,922 INFO L82 PathProgramCache]: Analyzing trace with hash 81535517, now seen corresponding path program 32 times [2018-11-07 10:33:37,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:37,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:37,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:37,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:37,923 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:38,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4659 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-07 10:33:38,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:38,602 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:38,602 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:33:38,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:33:38,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:38,602 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:33:38,610 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:33:38,610 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:33:48,140 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-11-07 10:33:48,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:33:48,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4659 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 2706 trivial. 0 not checked. [2018-11-07 10:33:48,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:49,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4659 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 2706 trivial. 0 not checked. [2018-11-07 10:33:49,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:33:49,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 73 [2018-11-07 10:33:49,770 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:33:49,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 10:33:49,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 10:33:49,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2356, Invalid=2900, Unknown=0, NotChecked=0, Total=5256 [2018-11-07 10:33:49,771 INFO L87 Difference]: Start difference. First operand 308 states and 309 transitions. Second operand 39 states. [2018-11-07 10:33:50,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:50,160 INFO L93 Difference]: Finished difference Result 468 states and 473 transitions. [2018-11-07 10:33:50,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-07 10:33:50,161 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 307 [2018-11-07 10:33:50,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:50,162 INFO L225 Difference]: With dead ends: 468 [2018-11-07 10:33:50,162 INFO L226 Difference]: Without dead ends: 329 [2018-11-07 10:33:50,163 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 650 GetRequests, 578 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2362, Invalid=3040, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 10:33:50,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-11-07 10:33:50,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 325. [2018-11-07 10:33:50,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-11-07 10:33:50,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 326 transitions. [2018-11-07 10:33:50,169 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 326 transitions. Word has length 307 [2018-11-07 10:33:50,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:50,170 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 326 transitions. [2018-11-07 10:33:50,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 10:33:50,170 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 326 transitions. [2018-11-07 10:33:50,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-11-07 10:33:50,172 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:50,172 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:50,172 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:50,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:50,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1087751313, now seen corresponding path program 33 times [2018-11-07 10:33:50,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:50,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:50,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:33:50,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:50,174 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:50,850 INFO L134 CoverageAnalysis]: Checked inductivity of 5219 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-11-07 10:33:50,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:50,850 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:50,850 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:33:50,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:33:50,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:50,851 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:33:50,859 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:33:50,859 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:33:58,318 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:33:58,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:33:58,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:58,512 INFO L134 CoverageAnalysis]: Checked inductivity of 5219 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-11-07 10:33:58,513 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:59,959 INFO L134 CoverageAnalysis]: Checked inductivity of 5219 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-11-07 10:33:59,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:33:59,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-11-07 10:33:59,982 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:33:59,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 10:33:59,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 10:33:59,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-11-07 10:33:59,984 INFO L87 Difference]: Start difference. First operand 325 states and 326 transitions. Second operand 38 states. [2018-11-07 10:34:00,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:34:00,373 INFO L93 Difference]: Finished difference Result 485 states and 488 transitions. [2018-11-07 10:34:00,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-07 10:34:00,373 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 324 [2018-11-07 10:34:00,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:34:00,375 INFO L225 Difference]: With dead ends: 485 [2018-11-07 10:34:00,375 INFO L226 Difference]: Without dead ends: 339 [2018-11-07 10:34:00,376 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 613 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-11-07 10:34:00,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-11-07 10:34:00,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 330. [2018-11-07 10:34:00,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-11-07 10:34:00,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 331 transitions. [2018-11-07 10:34:00,382 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 331 transitions. Word has length 324 [2018-11-07 10:34:00,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:34:00,382 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 331 transitions. [2018-11-07 10:34:00,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 10:34:00,382 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 331 transitions. [2018-11-07 10:34:00,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-11-07 10:34:00,384 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:34:00,384 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 35, 35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:34:00,385 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:34:00,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:34:00,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1632033876, now seen corresponding path program 34 times [2018-11-07 10:34:00,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:34:00,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:34:00,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:34:00,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:34:00,386 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:34:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:34:01,223 INFO L134 CoverageAnalysis]: Checked inductivity of 5391 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-11-07 10:34:01,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:34:01,224 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:34:01,224 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:34:01,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:34:01,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:34:01,225 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:34:01,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:34:01,233 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:34:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:34:01,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:34:01,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5391 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-11-07 10:34:01,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:34:02,802 INFO L134 CoverageAnalysis]: Checked inductivity of 5391 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-11-07 10:34:02,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:34:02,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-11-07 10:34:02,823 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:34:02,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 10:34:02,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 10:34:02,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-11-07 10:34:02,824 INFO L87 Difference]: Start difference. First operand 330 states and 331 transitions. Second operand 39 states. [2018-11-07 10:34:03,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:34:03,308 INFO L93 Difference]: Finished difference Result 495 states and 499 transitions. [2018-11-07 10:34:03,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-07 10:34:03,308 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 329 [2018-11-07 10:34:03,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:34:03,310 INFO L225 Difference]: With dead ends: 495 [2018-11-07 10:34:03,310 INFO L226 Difference]: Without dead ends: 349 [2018-11-07 10:34:03,311 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 695 GetRequests, 622 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-11-07 10:34:03,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-11-07 10:34:03,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 335. [2018-11-07 10:34:03,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-11-07 10:34:03,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 336 transitions. [2018-11-07 10:34:03,317 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 336 transitions. Word has length 329 [2018-11-07 10:34:03,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:34:03,318 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 336 transitions. [2018-11-07 10:34:03,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 10:34:03,318 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 336 transitions. [2018-11-07 10:34:03,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-11-07 10:34:03,320 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:34:03,320 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 35, 35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:34:03,320 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:34:03,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:34:03,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1054081679, now seen corresponding path program 35 times [2018-11-07 10:34:03,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:34:03,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:34:03,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:34:03,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:34:03,325 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:34:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:34:05,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5568 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-11-07 10:34:05,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:34:05,977 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:34:05,977 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:34:05,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:34:05,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:34:05,977 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:34:05,986 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:34:05,986 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:34:24,723 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-11-07 10:34:24,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:34:24,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:34:24,872 INFO L134 CoverageAnalysis]: Checked inductivity of 5568 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 3222 trivial. 0 not checked. [2018-11-07 10:34:24,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:34:26,344 INFO L134 CoverageAnalysis]: Checked inductivity of 5568 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 3222 trivial. 0 not checked. [2018-11-07 10:34:26,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:34:26,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 79 [2018-11-07 10:34:26,368 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:34:26,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 10:34:26,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 10:34:26,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2785, Invalid=3377, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 10:34:26,370 INFO L87 Difference]: Start difference. First operand 335 states and 336 transitions. Second operand 42 states. [2018-11-07 10:34:26,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:34:26,798 INFO L93 Difference]: Finished difference Result 507 states and 512 transitions. [2018-11-07 10:34:26,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 10:34:26,799 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 334 [2018-11-07 10:34:26,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:34:26,801 INFO L225 Difference]: With dead ends: 507 [2018-11-07 10:34:26,801 INFO L226 Difference]: Without dead ends: 356 [2018-11-07 10:34:26,802 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 707 GetRequests, 629 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2791, Invalid=3529, Unknown=0, NotChecked=0, Total=6320 [2018-11-07 10:34:26,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-11-07 10:34:26,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 352. [2018-11-07 10:34:26,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-11-07 10:34:26,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 353 transitions. [2018-11-07 10:34:26,808 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 353 transitions. Word has length 334 [2018-11-07 10:34:26,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:34:26,808 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 353 transitions. [2018-11-07 10:34:26,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 10:34:26,809 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 353 transitions. [2018-11-07 10:34:26,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-11-07 10:34:26,810 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:34:26,811 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:34:26,811 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:34:26,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:34:26,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1563169803, now seen corresponding path program 36 times [2018-11-07 10:34:26,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:34:26,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:34:26,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:34:26,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:34:26,812 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:34:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:34:27,883 INFO L134 CoverageAnalysis]: Checked inductivity of 6179 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-11-07 10:34:27,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:34:27,884 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:34:27,884 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:34:27,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:34:27,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:34:27,884 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:34:27,893 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:34:27,893 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:34:36,913 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:34:36,913 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:34:36,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:34:37,061 INFO L134 CoverageAnalysis]: Checked inductivity of 6179 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-11-07 10:34:37,061 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:34:39,126 INFO L134 CoverageAnalysis]: Checked inductivity of 6179 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-11-07 10:34:39,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:34:39,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-11-07 10:34:39,148 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:34:39,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-07 10:34:39,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-07 10:34:39,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 10:34:39,149 INFO L87 Difference]: Start difference. First operand 352 states and 353 transitions. Second operand 41 states. [2018-11-07 10:34:39,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:34:39,616 INFO L93 Difference]: Finished difference Result 524 states and 527 transitions. [2018-11-07 10:34:39,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-07 10:34:39,616 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 351 [2018-11-07 10:34:39,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:34:39,619 INFO L225 Difference]: With dead ends: 524 [2018-11-07 10:34:39,619 INFO L226 Difference]: Without dead ends: 366 [2018-11-07 10:34:39,620 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 664 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 10:34:39,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-11-07 10:34:39,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 357. [2018-11-07 10:34:39,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-11-07 10:34:39,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 358 transitions. [2018-11-07 10:34:39,626 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 358 transitions. Word has length 351 [2018-11-07 10:34:39,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:34:39,626 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 358 transitions. [2018-11-07 10:34:39,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-07 10:34:39,626 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 358 transitions. [2018-11-07 10:34:39,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-11-07 10:34:39,628 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:34:39,628 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 38, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:34:39,629 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:34:39,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:34:39,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1495731206, now seen corresponding path program 37 times [2018-11-07 10:34:39,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:34:39,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:34:39,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:34:39,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:34:39,630 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:34:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:34:40,423 INFO L134 CoverageAnalysis]: Checked inductivity of 6366 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-11-07 10:34:40,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:34:40,423 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:34:40,423 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:34:40,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:34:40,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:34:40,424 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:34:40,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:34:40,433 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:34:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:34:40,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:34:40,629 INFO L134 CoverageAnalysis]: Checked inductivity of 6366 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-11-07 10:34:40,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:34:42,303 INFO L134 CoverageAnalysis]: Checked inductivity of 6366 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-11-07 10:34:42,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:34:42,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-11-07 10:34:42,322 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:34:42,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 10:34:42,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 10:34:42,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-11-07 10:34:42,324 INFO L87 Difference]: Start difference. First operand 357 states and 358 transitions. Second operand 42 states. [2018-11-07 10:34:42,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:34:42,748 INFO L93 Difference]: Finished difference Result 534 states and 538 transitions. [2018-11-07 10:34:42,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 10:34:42,749 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 356 [2018-11-07 10:34:42,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:34:42,751 INFO L225 Difference]: With dead ends: 534 [2018-11-07 10:34:42,751 INFO L226 Difference]: Without dead ends: 376 [2018-11-07 10:34:42,753 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 752 GetRequests, 673 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-11-07 10:34:42,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-11-07 10:34:42,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 362. [2018-11-07 10:34:42,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-11-07 10:34:42,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 363 transitions. [2018-11-07 10:34:42,759 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 363 transitions. Word has length 356 [2018-11-07 10:34:42,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:34:42,760 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 363 transitions. [2018-11-07 10:34:42,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 10:34:42,760 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 363 transitions. [2018-11-07 10:34:42,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2018-11-07 10:34:42,762 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:34:42,762 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 38, 38, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:34:42,762 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:34:42,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:34:42,763 INFO L82 PathProgramCache]: Analyzing trace with hash -222373653, now seen corresponding path program 38 times [2018-11-07 10:34:42,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:34:42,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:34:42,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:34:42,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:34:42,764 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:34:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:34:44,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6558 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-11-07 10:34:44,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:34:44,875 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:34:44,875 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:34:44,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:34:44,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:34:44,876 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:34:44,885 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:34:44,885 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:35:10,052 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-11-07 10:35:10,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:35:10,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:35:10,272 INFO L134 CoverageAnalysis]: Checked inductivity of 6558 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 3783 trivial. 0 not checked. [2018-11-07 10:35:10,272 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:35:11,998 INFO L134 CoverageAnalysis]: Checked inductivity of 6558 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 3783 trivial. 0 not checked. [2018-11-07 10:35:12,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:35:12,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 85 [2018-11-07 10:35:12,023 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:35:12,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-07 10:35:12,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-07 10:35:12,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3250, Invalid=3890, Unknown=0, NotChecked=0, Total=7140 [2018-11-07 10:35:12,025 INFO L87 Difference]: Start difference. First operand 362 states and 363 transitions. Second operand 45 states. [2018-11-07 10:35:12,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:35:12,409 INFO L93 Difference]: Finished difference Result 546 states and 551 transitions. [2018-11-07 10:35:12,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 10:35:12,409 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 361 [2018-11-07 10:35:12,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:35:12,411 INFO L225 Difference]: With dead ends: 546 [2018-11-07 10:35:12,412 INFO L226 Difference]: Without dead ends: 383 [2018-11-07 10:35:12,413 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 764 GetRequests, 680 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3256, Invalid=4054, Unknown=0, NotChecked=0, Total=7310 [2018-11-07 10:35:12,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-11-07 10:35:12,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 379. [2018-11-07 10:35:12,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-11-07 10:35:12,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 380 transitions. [2018-11-07 10:35:12,419 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 380 transitions. Word has length 361 [2018-11-07 10:35:12,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:35:12,420 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 380 transitions. [2018-11-07 10:35:12,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-07 10:35:12,420 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 380 transitions. [2018-11-07 10:35:12,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-11-07 10:35:12,422 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:35:12,422 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:35:12,423 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:35:12,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:35:12,423 INFO L82 PathProgramCache]: Analyzing trace with hash 2069005053, now seen corresponding path program 39 times [2018-11-07 10:35:12,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:35:12,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:35:12,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:35:12,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:35:12,424 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:35:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:35:13,908 INFO L134 CoverageAnalysis]: Checked inductivity of 7220 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 10:35:13,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:35:13,908 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:35:13,909 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:35:13,909 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:35:13,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:35:13,909 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:35:13,917 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:35:13,918 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:35:26,023 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:35:26,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:35:26,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:35:26,153 INFO L134 CoverageAnalysis]: Checked inductivity of 7220 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 10:35:26,154 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:35:28,123 INFO L134 CoverageAnalysis]: Checked inductivity of 7220 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 10:35:28,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:35:28,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-11-07 10:35:28,145 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:35:28,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-07 10:35:28,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-07 10:35:28,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-11-07 10:35:28,146 INFO L87 Difference]: Start difference. First operand 379 states and 380 transitions. Second operand 44 states. [2018-11-07 10:35:28,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:35:28,606 INFO L93 Difference]: Finished difference Result 563 states and 566 transitions. [2018-11-07 10:35:28,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-07 10:35:28,606 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 378 [2018-11-07 10:35:28,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:35:28,608 INFO L225 Difference]: With dead ends: 563 [2018-11-07 10:35:28,608 INFO L226 Difference]: Without dead ends: 393 [2018-11-07 10:35:28,608 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 798 GetRequests, 715 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-11-07 10:35:28,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-11-07 10:35:28,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 384. [2018-11-07 10:35:28,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-11-07 10:35:28,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 385 transitions. [2018-11-07 10:35:28,614 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 385 transitions. Word has length 378 [2018-11-07 10:35:28,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:35:28,614 INFO L480 AbstractCegarLoop]: Abstraction has 384 states and 385 transitions. [2018-11-07 10:35:28,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-07 10:35:28,615 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 385 transitions. [2018-11-07 10:35:28,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-11-07 10:35:28,617 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:35:28,617 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 41, 41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:35:28,617 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:35:28,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:35:28,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1641585118, now seen corresponding path program 40 times [2018-11-07 10:35:28,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:35:28,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:35:28,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:35:28,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:35:28,619 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:35:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:35:29,823 INFO L134 CoverageAnalysis]: Checked inductivity of 7422 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 10:35:29,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:35:29,823 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:35:29,823 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:35:29,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:35:29,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:35:29,823 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:35:29,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:35:29,833 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:35:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:35:29,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:35:30,043 INFO L134 CoverageAnalysis]: Checked inductivity of 7422 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 10:35:30,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:35:32,442 INFO L134 CoverageAnalysis]: Checked inductivity of 7422 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 10:35:32,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:35:32,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-11-07 10:35:32,462 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:35:32,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-07 10:35:32,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-07 10:35:32,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-11-07 10:35:32,464 INFO L87 Difference]: Start difference. First operand 384 states and 385 transitions. Second operand 45 states. [2018-11-07 10:35:32,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:35:32,939 INFO L93 Difference]: Finished difference Result 573 states and 577 transitions. [2018-11-07 10:35:32,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 10:35:32,940 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 383 [2018-11-07 10:35:32,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:35:32,941 INFO L225 Difference]: With dead ends: 573 [2018-11-07 10:35:32,941 INFO L226 Difference]: Without dead ends: 403 [2018-11-07 10:35:32,942 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 809 GetRequests, 724 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-11-07 10:35:32,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-11-07 10:35:32,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 389. [2018-11-07 10:35:32,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-11-07 10:35:32,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 390 transitions. [2018-11-07 10:35:32,949 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 390 transitions. Word has length 383 [2018-11-07 10:35:32,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:35:32,949 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 390 transitions. [2018-11-07 10:35:32,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-07 10:35:32,949 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 390 transitions. [2018-11-07 10:35:32,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-11-07 10:35:32,951 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:35:32,952 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 41, 41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:35:32,952 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:35:32,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:35:32,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1156861411, now seen corresponding path program 41 times [2018-11-07 10:35:32,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:35:32,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:35:32,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:35:32,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:35:32,953 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:35:32,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:35:33,827 INFO L134 CoverageAnalysis]: Checked inductivity of 7629 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 10:35:33,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:35:33,827 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:35:33,827 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:35:33,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:35:33,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:35:33,828 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:35:33,838 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:35:33,838 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:36:15,847 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-11-07 10:36:15,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:36:15,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:36:16,045 INFO L134 CoverageAnalysis]: Checked inductivity of 7629 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 4389 trivial. 0 not checked. [2018-11-07 10:36:16,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:36:18,174 INFO L134 CoverageAnalysis]: Checked inductivity of 7629 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 4389 trivial. 0 not checked. [2018-11-07 10:36:18,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:36:18,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 91 [2018-11-07 10:36:18,202 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:36:18,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-07 10:36:18,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-07 10:36:18,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3751, Invalid=4439, Unknown=0, NotChecked=0, Total=8190 [2018-11-07 10:36:18,204 INFO L87 Difference]: Start difference. First operand 389 states and 390 transitions. Second operand 48 states. [2018-11-07 10:36:18,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:18,607 INFO L93 Difference]: Finished difference Result 585 states and 590 transitions. [2018-11-07 10:36:18,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-07 10:36:18,607 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 388 [2018-11-07 10:36:18,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:18,610 INFO L225 Difference]: With dead ends: 585 [2018-11-07 10:36:18,610 INFO L226 Difference]: Without dead ends: 410 [2018-11-07 10:36:18,611 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 821 GetRequests, 731 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3757, Invalid=4615, Unknown=0, NotChecked=0, Total=8372 [2018-11-07 10:36:18,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-11-07 10:36:18,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 406. [2018-11-07 10:36:18,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-11-07 10:36:18,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 407 transitions. [2018-11-07 10:36:18,616 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 407 transitions. Word has length 388 [2018-11-07 10:36:18,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:18,616 INFO L480 AbstractCegarLoop]: Abstraction has 406 states and 407 transitions. [2018-11-07 10:36:18,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-07 10:36:18,616 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 407 transitions. [2018-11-07 10:36:18,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-11-07 10:36:18,619 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:18,619 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:18,619 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:18,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:18,620 INFO L82 PathProgramCache]: Analyzing trace with hash 430174425, now seen corresponding path program 42 times [2018-11-07 10:36:18,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:18,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:18,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:36:18,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:18,621 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:19,610 INFO L134 CoverageAnalysis]: Checked inductivity of 8342 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-11-07 10:36:19,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:19,611 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:36:19,611 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:36:19,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:36:19,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:19,611 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:36:19,620 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:36:19,620 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:36:31,733 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:36:31,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:36:31,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2018-11-07 10:36:31,850 INFO L134 CoverageAnalysis]: Checked inductivity of 8342 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-11-07 10:36:31,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:36:31,856 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-07 10:36:32,057 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:36:32,057 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 10:36:32,063 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 10:36:32,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:36:32 BoogieIcfgContainer [2018-11-07 10:36:32,063 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 10:36:32,064 INFO L168 Benchmark]: Toolchain (without parser) took 255932.91 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -436.9 MB). Peak memory consumption was 598.1 MB. Max. memory is 7.1 GB. [2018-11-07 10:36:32,066 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:36:32,066 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 10:36:32,067 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.36 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:36:32,067 INFO L168 Benchmark]: Boogie Preprocessor took 28.53 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:36:32,067 INFO L168 Benchmark]: RCFGBuilder took 572.23 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -772.6 MB). Peak memory consumption was 17.5 MB. Max. memory is 7.1 GB. [2018-11-07 10:36:32,068 INFO L168 Benchmark]: TraceAbstraction took 254973.16 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 305.1 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 325.2 MB). Peak memory consumption was 630.3 MB. Max. memory is 7.1 GB. [2018-11-07 10:36:32,071 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 326.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 27.36 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.53 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 572.23 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -772.6 MB). Peak memory consumption was 17.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 254973.16 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 305.1 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 325.2 MB). Peak memory consumption was 630.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 6]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 6). Cancelled while BasicCegarLoop was analyzing trace of length 406 with TraceHistMax 44,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. TIMEOUT Result, 254.9s OverallTime, 46 OverallIterations, 44 TraceHistogramMax, 12.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 853 SDtfs, 6865 SDslu, 11250 SDs, 0 SdLazy, 6084 SolverSat, 1403 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18489 GetRequests, 16504 SyntacticMatches, 0 SemanticMatches, 1985 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5869 ImplicationChecksByTransitivity, 65.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=406occurred in iteration=45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 45 MinimizatonAttempts, 391 StatesRemovedByMinimization, 44 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 152.8s SatisfiabilityAnalysisTime, 71.7s InterpolantComputationTime, 17511 NumberOfCodeBlocks, 17361 NumberOfCodeBlocksAsserted, 388 NumberOfCheckSat, 26119 ConstructedInterpolants, 0 QuantifiedInterpolants, 13850179 SizeOfPredicates, 58 NumberOfNonLiveVariables, 14525 ConjunctsInSsa, 1036 ConjunctsInUnsatCore, 131 InterpolantComputations, 4 PerfectInterpolantSequences, 158412/335892 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown